The new method, called SymLQA, is described in a paper published in Quantum Information Processing by Wenjie Sun, Zhigang Wang, and colleagues at the University of Electronic Science and Technology of China, Tsinghua University, and partner institutions. Rather than attacking the higher-order terms head-on, the researchers exploit a structural property of the problems they target: planar face-flux optimization. These problems arise naturally in lattice gauge models, where spins live on the edges of a graph and the physically meaningful quantities are fluxes around closed loops, or faces. In such settings, the seemingly complicated HUBO energy function hides a much simpler structure that only becomes visible when the graph is treated as a geometric object rather than a bag of coupled variables.

The first step of the SymLQA pipeline is a careful topological extraction. Using a rotation system, a standard combinatorial device that records the cyclic order of edges around each vertex, together with half-edge traversal, the algorithm identifies all the bounded faces of an embedded planar graph. This is the computational equivalent of tracing every enclosed region of a map drawn on a flat sheet. The implementation is rigorous enough that it satisfies Euler’s identity, the classic relation among vertices, edges, and faces, on every embedding tested, and it successfully extracts irregular faces containing up to sixteen boundary edges. That robustness matters because real-world planar instances are rarely neat square grids; they are irregular, lopsided, and full of awkward boundary shapes.

Once the faces are known, the transformation at the heart of SymLQA begins. Each face is assigned a new binary variable defined as the product of the edge spins along its boundary, a quantity the authors call a classical face-flux variable. This move mirrors a deep idea from lattice gauge theory, where fluxes around plaquettes, rather than the underlying link variables, often carry the essential physics. In the face-flux variables, the original edge-spin HUBO, with its face fields and face-flux interaction terms, becomes a sparse objective containing only one-body and two-body terms. Crucially, this reduction requires no auxiliary variables at all, which distinguishes it from the usual penalty-based encodings that inflate problem size and introduce fragile constraint weights.

The reduction would be of limited use if solutions in the new variables could not be translated back. SymLQA handles this with a reconstruction step based on arithmetic over the finite field GF(2), the two-element field where addition is equivalent to exclusive-or. For connected open planar embeddings, the GF(2) reconstruction maps every assignment of the dual, or face, variables back to a consistent assignment of the original edge spins, and the mapping preserves the objective value exactly. The consequence is mathematically clean: the minimum of the primal problem and the minimum of the dual problem coincide. The annealer can therefore search the transformed, quadratic landscape with the full confidence that whatever optimum it finds corresponds to a genuine optimum of the original hard problem.

To find out whether this elegant reformulation actually pays off in practice, the team benchmarked SymLQA against three formidable baselines: a momentum-based native local quantum annealing applied directly to the HUBO, a gauged variant of local quantum annealing, and classical simulated annealing on the primal formulation. The test bed consisted of independently generated certified frustrated-loop instances, a family of benchmark problems whose ground states are known in advance, which allows success or failure to be verified without ambiguity. Frustrated loops are notoriously treacherous for annealers because competing interactions create rugged energy landscapes riddled with local minima, making them a demanding and honest yardstick for any new solver.

The results are striking. On regular grids up to 32 by 32 and on irregular planar grids, SymLQA reached the known ground state in every tested run, maintaining a perfect success probability. The baselines told a very different story: their success probabilities fell rapidly as the instances grew, a familiar signature of gradients drowning in higher-order terms and of generic thermal dynamics failing to navigate the landscape. SymLQA’s advantage was not confined to a single coupling regime either. Across four independently sampled coupling regimes, the method retained unit success probability, suggesting that the improvement stems from the structural reformulation itself rather than from a lucky interaction between the algorithm and one particular class of random instances.

The speedup numbers are equally dramatic. At a grid size of 12 by 12, SymLQA achieved a batch time to solution at the 99 percent confidence level, abbreviated TTS99, of just 0.137 seconds. Native local quantum annealing needed 22.35 seconds to reach the same reliability, roughly 160 times slower, while primal simulated annealing required 8.85 seconds, about 65 times slower. Time to solution is a standard metric in the annealing community because it combines the probability of finding the optimum with the cost of each run, rewarding algorithms that are both accurate and consistently repeatable. A two-order-of-magnitude gap on this metric is not an incremental gain; it is the kind of separation that changes which problems are considered practically solvable.

What makes SymLQA especially interesting is that it is, at its core, a classical pipeline. The face extraction, the flux-variable transformation, and the GF(2) reconstruction are all classical preprocessing and postprocessing steps wrapped around an annealing solver. This positions the work squarely within the growing field of quantum-inspired optimization, where insights from physics and from quantum hardware motivate classical algorithms that can run on ordinary computers today. The connection to quantum Z2 lattice gauge formulations of HUBO problems, explored in recent work by other groups, shows that gauge-theoretic structure is emerging as a general resource for taming higher-order optimization, and SymLQA demonstrates how to exploit that structure with full topological awareness on planar graphs.

The implications extend beyond a single benchmark family. Planar optimization structures appear in routing and network design, in grid-based physical models, and in any setting where constraints or costs are naturally associated with regions rather than individual links. By converting edge-spin HUBO models with polynomially suppressed gradients into sparse Ising objectives with clean one- and two-body terms, SymLQA makes an entire problem class friendly to the growing ecosystem of Ising machines, digital annealers, and quantum annealers. The work also carries a broader lesson for the field: before throwing more hardware or more sophisticated dynamics at a hard optimization problem, it can pay enormously to ask whether the problem’s hidden topology already contains the key to simplifying it. In this case, a map’s faces turned out to be the secret ingredient that turned an intractable-feeling search into one solved, reliably, in a fraction of a second.

Subject of Research: Topology-aware local quantum annealing for planar face-flux HUBO optimization problems

Article Title: SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems

Article References: Sun, W., Wang, Z., Hu, J., Yu, L., Chen, G., Wang, L., Liu, H., & Li, X. (2026). SymLQA: topology-aware local quantum annealing for planar face-flux HUBO problems. Quantum Information Processing, 25(10), Article 323. https://doi.org/10.1007/s11128-026-05345-4

Image Credits: AI Generated

DOI: 10.1007/s11128-026-05345-4

Keywords: quantum annealing, HUBO, Ising model, lattice gauge theory, combinatorial optimization, planar graphs, face-flux variables, simulated annealing, topology, GF(2) reconstruction, time to solution, spin glass

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