Fault-tolerant cost of shallow QAOA on near-symmetric optimization problems

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

quant-ph

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Benchmark — 6× in this paper · explained in 2 episodes
• Distillation — 3× in this paper · explained in 2 episodes
• Hamming Distance — 3× in this paper · explained in 2 episodes
• Quantum Approximate Optimization Algorithm — 3× in this paper
• Accuracy — 1× in this paper · explained in 1 episode
• Adiabatic Evolution — 1× in this paper · explained in 2 episodes
• Aperture — 1× in this paper · explained in 1 episode
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Formal Methods — 1× in this paper · explained in 3 episodes
• Query Complexity — 1× in this paper · explained in 2 episodes
• Symmetry Breaking — 1× in this paper · explained in 3 episodes

Sources

• Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
• A Quantum Algorithm for Finding the Minimum
• More efficient Clifford+T synthesis for small-angle rotations and application to Trotterization
• Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
• Assessing requirements to scale to practical quantum advantage
• Magic state cultivation: growing T states as cheap as CNOT gates
• Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
• Low overhead quantum computation using lattice surgery

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