Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CRC Press eBooks

The Adiabatic Approximation

Şakir Erkoç

Published Jul 28, 2006• 0 citations
Publisher
DOI
10.1201/9781584887331-17

Related papers

Adiabatic Approximation

Princeton University Press eBooks•Feb 9, 2021•2 citations

A. Adiabatic Approximation

C. C. Chancey, M. C.M. O’Brien

Princeton University Press eBooks•Dec 31, 1998•0 citations

Sudden and Adiabatic Approximations

K. T. Hecht

Graduate texts in contemporary physics•Jan 1, 2000•4 citations

Sudden and Adiabatic Approximation

Kanmani Palanikumar

•Nov 3, 2026•0 citations

Examination of the adiabatic approximation in open systems

D. M. Tong, X. X. Yi, X.J. Fan +2 more

Physics Letters A•Nov 30, 2007•6 citations

Improved error bounds for the adiabatic approximation

Donny Cheung, Peter Høyer, Nathan Wiebe

The discovery of adiabatic quantum computing has revealed a need 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 that can be used to assess the runtime of adiabatic algorithms. 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.

arXiv:1103.4174•Journal of Physics A Mathematical and Theoretical•Sep 20, 2011•40 citations
The discovery of adiabatic quantum computing has revealed a need 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 that can be used to assess the runtime of adiabatic algorithms. 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.