An Elementary Proof of the Quantum Adiabatic Theorem
arXiv:quant-ph/0411152
Abstract
We provide an elementary proof of the quantum adiabatic theorem.
12 pages, 2 figures
References in corpus (4)
Cited by in corpus (24)
- Adiabatic Quantum Computing
- Role of Non-stoquastic Catalysts in Quantum Adiabatic Optimization
- An introduction to quantum annealing
- A new perturbative approach to the adiabatic approximation
- Generalized Shortcuts to Adiabaticity and Enhanced Robustness Against Decoherence
- Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
- Effects of dissipation in an adiabatic quantum search algorithm
- Perturbative Analysis of Possible Failures in the Traditional Adiabatic Conditions
- Local Hamiltonians in Quantum Computation
- Using Quantum Annealers to Calculate Ground State Properties of Molecules
- Knapsack Problem variants of QAOA for battery revenue optimisation
- Achieving fair sampling in quantum annealing
- Success of digital adiabatic simulation with large Trotter step
- Fast quantum algorithms for traversing paths of eigenstates
- Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
- Avoid First Order Quantum Phase Transition by Changing Problem Hamiltonians
- Quantum Adiabatic Theorem Revisited
- Multiobjective Optimization in a Quantum Adiabatic Computer
- Accuracy of the quantum adiabatic theorem in its original form
- Time evolution and adiabatic approximation in -symmetric quantum mechanics
- Hypercomputation: Towards an extension of the classical notion of Computability?
- Stable Adiabatic Times For A Continuous Evolution Of Markov Chains
- Adiabatic Quantum Computation
- Adiabatic Dynamics and Shortcuts to Adiabaticity: Fundamentals and Applications