Gap Sensitivity and Bottleneck Migration in Sparse Constraint-Preserving Quantum Annealing

arXiv:2610.11262 · quant-ph · Submitted 2026-10-08 · Read on arXiv

quant-ph

Submitted: 2026-10-08

Updated: 2026-10-08

Terminology

• Abstention — 10× in this paper · explained in 1 episode
• Benchmark — 3× in this paper · explained in 2 episodes
• Aggregation — 2× in this paper · explained in 1 episode
• Degeneracy — 2× in this paper · explained in 3 episodes
• Adiabatic Evolution — 1× in this paper · explained in 2 episodes
• Benchmarking — 1× in this paper · explained in 3 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Frustration — 1× in this paper · explained in 2 episodes
• Spectral Gap — 1× in this paper · explained in 5 episodes

Sources

• Quantum Computation by Adiabatic Evolution
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Schedule path optimization for quantum annealing and adiabatic quantum computing
• Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing

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