Improved Error Bounds for the Adiabatic Approximation

Abstract

Since the discovery of adiabatic quantum computing, a need has arisen for rigorously proven bounds for the error in the adiabatic approximation. We present in this paper, a rigorous and elementary derivation of upper and lower bounds on the error incurred from using the adiabatic approximation for quantum systems. Our bounds are often asymptotically tight in the limit of slow evolution for fixed Hamiltonians, and are used to provide sufficient conditions for the application of the adiabatic approximation. We show that our sufficiency criteria exclude the Marzlin--Sanders counterexample from the class of Hamiltonians that obey the adiabatic approximation. Finally, we demonstrate the existence of classes of Hamiltonians that resemble the Marzlin--Sanders counterexample Hamiltonian, but also obey the adiabatic approximation.

References in corpus (6)

• Bounds for the adiabatic approximation with applications to quantum computation
• Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
• Accuracy vs run time in adiabatic quantum search
• Validity of the Adiabatic Approximation
• Engineering Entanglement: The Fast-Approach Phase Gate
• Entangling identical bosons in optical tweezers via exchange interaction

Cited by in corpus (26)

• Adiabatic Quantum Computing
• Quantum Chemistry in the Age of Quantum Computing
• Elucidating Reaction Mechanisms on Quantum Computers
• Perspectives of quantum annealing: Methods and implementations
• The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
• Modernizing Quantum Annealing using Local Searches
• Improved Error-Scaling for Adiabatic Quantum State Transfer
• Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
• An energetic perspective on rapid quenches in quantum annealing
• Quantum Computational Phase Transition in Combinatorial Problems
• Schedule path optimization for quantum annealing and adiabatic quantum computing
• Self-healing of Trotter error in digital adiabatic state preparation
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Degenerate Adiabatic Perturbation Theory: Foundations and Applications
• Observation of coherent oscillation in single-passage Landau-Zener transitions
• On The Power Of Coherently Controlled Quantum Adiabatic Evolutions
• Error Reduction in Quantum Annealing using Boundary Cancellation: Only the End Matters
• Randomized gap and amplitude estimation
• Success of digital adiabatic simulation with large Trotter step
• Quantum adiabatic evolution with energy-degeneracy levels
• Optimizing adiabaticity in quantum mechanics
• Practicality of quantum adiabatic algorithm for chemistry applications
• Hierarchical Theory of Quantum Adiabatic Evolution
• Quantum adiabatic theorem for unbounded Hamiltonians with a cutoff and its application to superconducting circuits
• Error-run-time trade-off in the adiabatic approximation beyond scaling relations
• Boosting quantum annealing performance through direct polynomial unconstrained binary optimization