Decoupling of the QAOA into independent spin-boson systems and high-depth performance on pure and mixed spin glasses

arXiv:2609.40309 · quant-ph · Submitted 2026-09-30 · Read on arXiv

quant-ph

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Decoupling — 14× in this paper · explained in 2 episodes
• Hypergraph — 9× in this paper · explained in 2 episodes
• Quantum Approximate Optimization Algorithm — 6× in this paper
• Combinatorial Optimization — 5× in this paper · explained in 2 episodes
• Consistency — 4× in this paper · explained in 3 episodes
• Overlap Gap Property — 4× in this paper
• Accuracy — 3× in this paper · explained in 1 episode
• Approximate Message Passing — 3× in this paper
• Generalization — 3× in this paper · explained in 13 episodes
• Symmetry Breaking — 3× in this paper · explained in 3 episodes
• Entanglement — 2× in this paper · explained in 3 episodes
• Additive Decomposition — 1× in this paper · explained in 1 episode
• Annual Symposium on Foundations of Computer Science — 1× in this paper
• Benchmark — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Loss Function — 1× in this paper · explained in 2 episodes
• Matrix Product States (MPS) — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Self-consistency — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
• Algorithmic Universality, Low-Degree Polynomials, and Max-Cut in Sparse Random Graphs
• Variational Iterative Rotation Algorithm: Combinatorial Optimization with Classical Kicked Tops
• Absence of quantum advantage for approximate spin glass optimization
• Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity