A note on the switching adiabatic theorem
classification
🧮 math-ph
math.MPquant-ph
keywords
adiabaticswitchingalphahamiltonianrunningtheoremtimeapproximation
read the original abstract
We derive a nearly optimal upper bound on the running time in the adiabatic theorem for a switching family of Hamiltonians. We assume the switching Hamiltonian is in the Gevrey class $G^\alpha$ as a function of time, and we show that the error in adiabatic approximation remains small for running times of order $g^{-2}\,|\ln\,g\,|^{6\alpha}$. Here $g$ denotes the minimal spectral gap between the eigenvalue(s) of interest and the rest of the spectrum of the instantaneous Hamiltonian.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Adiabatic Quantum Phase Estimation
An adiabatic protocol for quantum phase estimation that reaches optimal scaling T = O(1/ε log(1/δ)) by encoding eigenvalues in computational basis populations rather than phases.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.