Bounds for the adiabatic approximation with applications to quantum computation
arXiv:quant-ph/0603175 · doi:10.1063/1.2798382
Abstract
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
15 pages, one figure. Two comments added in Secs. 2 and 5
Cited by in corpus (9)
- Quantum Adiabatic Brachistochrone
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Towards Fault Tolerant Adiabatic Quantum Computation
- Preservation of Positivity by Dynamical Coarse-Graining
- Adiabatic Preparation of Topological Order
- Adiabatic preparation without Quantum Phase Transitions
- Generalized Geometrical Phase in the Case of Continuous Spectra
- The adiabatic theorem in the presence of noise
- Transport of interface states in the Heisenberg chain