The low-autocorrelation binary sequence problem, known in the literature as LABS, asks for a binary string of length N whose autocorrelations, measured across all possible shifts of the sequence, are as small as possible. The objective function sums the squared autocorrelation values, and finding the string that minimizes this energy is exponentially hard in the worst case. The problem is not an academic curiosity: binary sequences with low autocorrelation are the backbone of pulse compression codes used in radar, spread-spectrum communications, and signal processing, a connection that dates back to foundational work in the 1960s and 1970s. Because the energy landscape of LABS is rugged and spin-glass-like, filled with metastable states that trap local search algorithms, it has become a standard proving ground for optimization heuristics and, more recently, for quantum algorithms.

The new method works in two stages. First, a quantum processor or quantum simulator runs digitized counterdiabatic quantum optimization, DCQO, a technique that approximates the shortcuts to adiabaticity that would, in principle, allow a quantum system to follow the instantaneous ground state of a slowly changing Hamiltonian. By digitizing the evolution into a sequence of quantum gates and incorporating approximate counterdiabatic terms, DCQO produces high-quality candidate solutions with circuits that are far shallower than those required by the quantum approximate optimization algorithm, QAOA. These quantum-generated bitstrings then serve as the initial population for a classical memetic tabu search, which combines a population-based evolutionary framework with tabu search, a local refinement method that uses short-term memory to avoid cycling and to encourage exploration of the search space.

The quantum stage is not trying to solve the problem on its own. Instead, it acts as a biased sampler, concentrating the initial population of the classical search in promising regions of the configuration space. This warm-starting philosophy, which has been explored theoretically in recent work on quantum-enhanced optimization, is here put to a rigorous empirical test. The researchers measured time-to-solution in objective-function evaluations, a hardware-agnostic metric that counts how many times the energy of a candidate sequence must be computed, and they benchmarked every system size using one hundred independent replicates, each comprising one hundred randomized seeds. This produced a robust distributional scaling analysis rather than a handful of cherry-picked successes.

The headline result is a scaling exponent of O(1.24^N) for sequence lengths N between 27 and 37. The best-known purely classical heuristic for LABS scales as O(1.34^N), while QAOA achieves O(1.46^N) on this problem, so the quantum-enhanced hybrid improves on both. The advantage over QAOA is compounded by a roughly sixfold reduction in circuit depth, since the counterdiabatic circuits used for warm-starting require substantially fewer entangling gates than comparable QAOA circuits. The authors verified the scaling advantage with a two-stage bootstrap analysis that accounts for variance both across replicates and across seeds, and this analysis projects a crossover point at N greater than roughly 47, beyond which QE-MTS is expected to outperform its purely classical counterpart in absolute runtime as well as in scaling exponent.

The technical details of the quantum stage reveal careful engineering. After trotterizing the digitized evolution, each term in the effective Hamiltonian becomes a generalized Pauli rotation. The two-body interactions decompose into blocks requiring two entangling RZZ gates and four single-qubit rotations, while the four-body interactions that make LABS particularly challenging decompose into blocks requiring ten entangling gates and twenty-eight single-qubit rotations. The first-order counterdiabatic coefficient is obtained analytically by minimizing a trace-based action, yielding a closed-form expression that depends on the structure of the interaction graph. The authors note that a single Trotter step of DCQO costs roughly the same as two layers of QAOA while retaining favorable performance in the low-depth regime, which is exactly where today’s noisy intermediate-scale quantum devices operate.

Because no quantum hardware with thirty-seven high-quality qubits was needed for the study, the team simulated the quantum circuits on classical hardware using CUDA-Q, NVIDIA’s hybrid quantum-classical programming framework with GPU-accelerated state-vector simulation. They tested three AWS GPU instances, including machines built on A100, H200, and B200 accelerators, with the largest GPUs providing enough memory to simulate systems up to thirty-seven qubits. For each sequence length, the DCQO circuits were executed with one hundred thousand measurement shots to generate the initial populations. The classical memetic tabu search component ran in single-threaded mode to ensure accurate counting of objective-function evaluations, and both the baseline and quantum-enhanced versions used identical parameters, including a population size of one hundred, a recombination probability of 0.9, a mutation rate of one over N, and a tournament size of two, so that the only difference between the two methods was the initialization.

The paper also probes the robustness of the result. An appendix describes an alternative initialization strategy in which the initial population is built from the lowest-energy bitstrings obtained across multiple independent DCQO runs, making the procedure more resilient to shot noise. With this setup, the best-performing quantum-enhanced seeds outperform the best classical seeds by up to two orders of magnitude for most sequence lengths, although three isolated system sizes showed no enhancement. The authors also quantify the gap between the two methods using a logarithmic ratio of time-to-solution distributions, showing that the gap narrows steadily with increasing problem size, consistent with the projected crossover. These analyses suggest that the scaling advantage is not an artifact of a particular parameter choice but a structural consequence of seeding the classical search with quantum-generated bias.

The significance of the work lies in its framing of how quantum computers may deliver practical value before fault tolerance arrives. Rather than attempting to run an entire optimization on a quantum device, the hybrid-sequential workflow assigns each paradigm the task it handles best: shallow quantum circuits explore the global structure of the energy landscape and produce biased initial states, while mature classical metaheuristics exploit those states with the full arsenal of local refinement, population diversity, and memory mechanisms. The LABS problem, with its spin-glass phenomenology and its roots in radar and communications engineering, serves as a demanding test case, and the measured improvement from 1.34 to 1.24 in the exponential base is substantial when compounded over large N. If the projected crossover near N equal to 47 holds on future hardware, quantum-enhanced warm starts could become a standard component of industrial optimization pipelines, from portfolio construction to code design, in the near-term era of quantum computing.

Subject of Research: Hybrid quantum-classical optimization of the low-autocorrelation binary sequence problem using quantum-enhanced memetic tabu search

Article Title: Scaling advantage with quantum-enhanced memetic tabu search for LABS

Article References: Scaling advantage with quantum-enhanced memetic tabu search for LABS. (n.d.). https://doi.org/10.1007/s42484-026-00433-1

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00433-1

Keywords: quantum optimization, hybrid quantum-classical algorithms, memetic tabu search, counterdiabatic driving, low-autocorrelation binary sequences, runtime scaling, LABS problem, warm-starting, QAOA, spin-glass optimization, time-to-solution, DCQO

The Quantum Approximate Optimization Algorithm, known as QAOA, has become the workhorse of near-term quantum optimization. It works as a hybrid quantum-classical dance: a quantum processor prepares a candidate state, a classical optimizer tunes the circuit’s angles, and the two repeat until a good solution emerges. The catch is that QAOA’s performance hinges on a parameter called depth, denoted p, which counts how many alternating layers of problem and mixing operations the circuit contains. Deeper circuits generally produce better answers, but they demand more two-qubit gates, more classical optimization effort, and more tolerance of hardware noise. Until now, practitioners had to guess this depth in advance, with no reliable guidance.

Guessing wrong is costly in both directions. A circuit that is too shallow is underparameterized and cannot represent a high-quality solution, particularly as problems grow denser and more constrained. A circuit that is too deep burns scarce quantum resources on layers that add nothing, a serious problem on today’s noisy intermediate-scale quantum devices where every additional two-qubit gate multiplies the chance of error. The research team, led by Rakesh Saini with co-authors Nora Mohamed, Saif Al-Kuwari and Ahmed Farouk, set out to eliminate this guesswork entirely by letting the algorithm discover its own depth.

DDQAOA begins modestly, with a single QAOA layer, and monitors the optimization as it proceeds. The algorithm tracks the expectation value of the problem’s cost function, the quantity that measures how good the current quantum state is. When improvement stalls, the algorithm does not give up; instead it concludes that the current depth has exhausted its expressive capacity and adds one more layer. Two complementary convergence checks guard against false alarms. The first detects a plateau by verifying that the best energy has not improved beyond a small tolerance over a patience window of fifty iterations. The second examines the variance of recent energy values, distinguishing genuine convergence from mere oscillations around a local minimum. Only when one of these conditions is satisfied does the depth increase.

Crucially, when a new layer is added, the algorithm does not start its optimization from scratch. Building on the INTERP parameter-transfer protocol developed by Zhou and colleagues in 2020, DDQAOA interpolates the optimized parameters from the shallower circuit to seed the deeper one. For the transition from one to two layers, the team applies transfer coefficients of 1.2 for the cost angle gamma and 0.8 for the mixer angle beta, values motivated by the structure of adiabatic quantum evolution. For deeper transitions, the method constructs smooth interpolants, switching from linear interpolation to cubic splines once four or more layers are available. This warm-starting places each new optimization inside the basin of attraction of a good solution, dramatically accelerating convergence.

To test their method rigorously, the researchers turned to the Constrained Shortest Path Problem, an NP-hard challenge that asks for the cheapest route between two points in a network while respecting a limit on resource consumption, such as fuel or time. This problem is far more than an academic curiosity: it appears as a building block in air-cargo route planning, flight scheduling, airline crew pairing, and aircraft tail assignment. The team encoded the problem as a Quadratic Unconstrained Binary Optimization formulation, folding the source, target, flow-conservation and resource constraints into penalty terms, and then converted the result into an Ising Hamiltonian whose ground state encodes the optimal path.

The benchmark was substantial: 100 randomly generated problem instances each at the 10-qubit and 16-qubit scales, plus 20 additional instances requiring 22 qubits on complete five-node graphs. Against fixed-depth QAOA baselines at depths 3, 5, 10 and 15, DDQAOA delivered striking results. At 10 and 16 qubits it outperformed every fixed-depth baseline, achieving median approximation ratios of roughly 0.97 and 0.99 respectively, with the smallest variability of any method. At 22 qubits it matched the best deep circuits, statistically indistinguishable from depth-10 QAOA and within 0.1 percent of depth-15, while attaining the highest median success probability of all methods tested.

The resource savings are where the approach truly shines. Because CNOT gates are the dominant source of noise on real quantum hardware, cumulative two-qubit gate usage is the currency of practical quantum optimization. Standard QAOA at depth 15, which achieved results close to DDQAOA, consumed 217 percent, 159.3 percent and 315 percent more CNOT gates at the 10-, 16- and 22-qubit scales respectively. Measured per circuit, DDQAOA used 3.17, 2.59 and 4.15 times fewer cumulative CNOTs than the deepest baseline across the three problem sizes. The algorithm’s gate count grows stepwise, from a single layer’s worth of gates up to the depth-10 equivalent, allocating quantum resources only as the optimization landscape requires.

Perhaps the most scientifically satisfying finding concerns the parameters themselves. In fixed-depth QAOA, the optimized gamma and beta angles typically show no discernible pattern across layers. DDQAOA, by contrast, consistently produced monotonically increasing gamma values and beta values converging toward zero, exactly the structure predicted by adiabatic theory, in which the cost Hamiltonian’s influence grows and the mixer’s fades as the system approaches the ground state. Across 100 diverse problem instances, with the classical optimizer free to deviate after initialization, this adiabatic signature emerged reliably, suggesting the interpolation strategy guides the search toward structured, physically meaningful solution manifolds rather than random corners of parameter space.

The authors are careful to note the limits of the current work. All experiments ran on classical simulators using the PennyLane framework with the Adam optimizer, and the success probabilities, while far above the random-guessing baseline of one over two to the power N, remain small in absolute terms because sampling the exact ground state among exponentially many bitstrings is an inherently stringent criterion. Future work will target larger instances and validation on real quantum hardware, where noise resilience and connectivity constraints will provide the ultimate test. Still, by removing the need to choose circuit depth in advance while matching or beating hand-tuned deep circuits at a fraction of the gate cost, DDQAOA offers a practical, NISQ-aware route to applying quantum optimization to genuinely constrained industrial problems, and a compelling demonstration that sometimes the best way to go deep is to earn each layer.

Subject of Research: A dynamic-depth variant of the quantum approximate optimization algorithm for solving the NP-hard constrained shortest path problem on near-term quantum devices.

Article Title: Dynamic depth quantum approximate optimization algorithm for solving constrained shortest path problem

Article References: Saini, R., Mohamed, N., Al-Kuwari, S., & Farouk, A. (2026). Dynamic depth quantum approximate optimization algorithm for solving constrained shortest path problem. Quantum Machine Intelligence, 8(2), Article 104. https://doi.org/10.1007/s42484-026-00442-0

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00442-0

Keywords: quantum computing, QAOA, DDQAOA, constrained shortest path problem, combinatorial optimization, NISQ devices, circuit depth, parameter transfer, Ising Hamiltonian, QUBO, adiabatic evolution, CNOT gates