Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks

• URL: http://arxiv.org/abs/2510.04946v1
• Date: Mon, 06 Oct 2025 15:47:21 GMT
• Title: Leveraging Analog Neutral Atom Quantum Computers for Diversified Pricing in Hybrid Column Generation Frameworks
• Authors: Cédrick Perron, Yves Bérubé-Lauzière, Victor Drouin-Touchette,
• Abstract summary: We develop new pulse designs and embed strategies to improve the analog quantum subroutines of hybrid column generation (CG) algorithms based on neutral-atoms quantum computers (NAQCs)<n>These strategies are designed to improve the quality and diversity of the samples generated.<n>We apply these to an important optimization (CO) problem in logistics, namely the fleet assignment.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we develop new pulse designs and embedding strategies to improve the analog quantum subroutines of hybrid column generation (CG) algorithms based on neutral-atoms quantum computers (NAQCs). These strategies are designed to improve the quality and diversity of the samples generated. We apply these to an important combinatorial optimization (CO) problem in logistics, namely the fleet assignment. Depending on the instance tested, our quantum protocol has a performance that is either comparable or worse than the best classical method tested, both in terms of the number of iterations and final objective value. We identify the cause of these suboptimal solutions as a result of our quantum protocol often generating high-quality but degenerate samples. We address this limitation by introducing a greedy post-processing technique, Make\_Diff, which applies bit-wise modifications to degenerate samples in order to return a non-degenerate set. With this modification, our quantum protocol becomes competitive with an exact solver for the subproblem, all the while being resilient to state preparation and measurements (SPAM) errors. We also compare our CG scheme with a Gurobi solver and find that it performs better on over 50\% of our synthetic instances and that, despite Gurobi having a more extensive runtime. These improvements and benchmarks herald the potential of deploying hybrid CG schemes on NISQ devices for industrially relevant CO problems.

Related papers

• Quantum feedback algorithms for DNA assembly using FALQON variants [31.458406135473805]
  We analyze long-read DNA fragments from SARS-CoV-2 and human DNA using standard FALQON, second-order FALQON (SO-FALQON), and time-rescaled FALQON (TR-FALQON)<n> Numerical results show that both variants improve convergence to the ground state and increase success probabilities at reduced circuit depths.
  arXiv  Detail & Related papers  (2026-02-24T16:44:24Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits [1.5739024454537747]
  We introduce QAOA-GPT, a generative framework that leverages Generative Pretrained Transformers (GPT) to directly synthesize quantum circuits for solving unconstrained binary optimization problems.<n>To diversify the training circuits and ensure their quality, we have generated a synthetic dataset using the adaptive QAOA approach.<n>Our results show that using QAOA-GPT to generate quantum circuits will significantly decrease both the computational overhead of classical QAOA and adaptive approaches.
  arXiv  Detail & Related papers  (2025-04-23T02:00:36Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Quantum evolutionary algorithm for TSP combinatorial optimisation problem [0.0]
  This paper implements a new way of solving a problem called the traveling salesman problem (TSP) using quantum genetic algorithm (QGA) We compared how well this new approach works to the traditional method known as a classical genetic algorithm (CGA)
  arXiv  Detail & Related papers  (2024-09-20T08:27:42Z)
• VAE-QWGAN: Addressing Mode Collapse in Quantum GANs via Autoencoding Priors [3.823356975862005]
  VAE-QWGAN combines the strengths of a classical Variational AutoEncoder (VAE) with a hybrid Quantum Wasserstein GAN (QWGAN)<n>We show that VAE-QWGAN demonstrates significant improvement over existing QGAN approaches.
  arXiv  Detail & Related papers  (2024-09-16T14:52:22Z)
• Non-native Quantum Generative Optimization with Adversarial Autoencoders [34.82692226532414]
  We introduce the adversarial quantum autoencoder model (AQAM) that can be used to map large-scale optimization problems onto existing quantum samplers. We demonstrate that the AQAM achieves a lower Renyi divergence and a larger spectral gap when compared to classical Markov Chain Monte Carlo samplers.
  arXiv  Detail & Related papers  (2024-07-18T18:03:18Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Rethinking Data-Free Quantization as a Zero-Sum Game [44.00726062583708]
  Data- quantization (DFQ) recovers the performance of quantized network (Q) without accessing the real data. DFQ generates a fake sample via a generator (G) by learning from full-precision network (P) instead. We propose an Adaptability-free Sample Generation (AdaSG) method to generate samples with desirable adaptability.
  arXiv  Detail & Related papers  (2023-02-19T13:22:40Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Adaptive shot allocation for fast convergence in variational quantum algorithms [0.0]
  We present a new gradient descent method using an adaptive number of shots at each step, called the global Coupled Adaptive Number of Shots (gCANS) method. These improvements reduce both the time and money required to run VQAs on current cloud platforms.
  arXiv  Detail & Related papers  (2021-08-23T22:29:44Z)
• GEO: Enhancing Combinatorial Optimization with Classical and Quantum Generative Models [62.997667081978825]
  We introduce a new framework that leverages machine learning models known as generative models to solve optimization problems. We focus on a quantum-inspired version of GEO relying on tensor-network Born machines. We show its superior performance when the goal is to find the best minimum given a fixed budget for the number of function calls.
  arXiv  Detail & Related papers  (2021-01-15T18:18:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.