Competitive scaling of small-subsystem-optimization heuristics for LABS

cond-mat.stat-mech, quant-ph

Submitted: 2026-10-09

Updated: 2026-10-14

Comments: 9 pages, 5 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Sources

• Scaling advantage with quantum-enhanced memetic tabu search for LABS
• A competitive NISQ and qubit-efficient solver for the LABS problem
• A Quantum Approximate Optimization Algorithm
• Divide-and-conquer embedding for QUBO quantum annealing

Related papers

• Decoherence-controlled collective criticality in a two-dimensional quantum Stag Hunt
• Measurement-induced phase transitions in disordered fermions
• Quantum Thermalization beyond Non-Integrability and Quantum Scars in a Multispecies Bose-Josephson Junction
• Markov length can diverge in systems whose universal physics is spatially Markovian
• Protected domains and cooperative invasion on weighted networks
• Quantum many-body operator cascade as a route to chaos