pith. sign in

arxiv: 1204.2318 · v3 · pith:ENFXI2NOnew · submitted 2012-04-11 · 🧮 math-ph · math.MP· quant-ph

A note on the switching adiabatic theorem

classification 🧮 math-ph math.MPquant-ph
keywords adiabaticswitchingalphahamiltonianrunningtheoremtimeapproximation
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Adiabatic Quantum Phase Estimation

    quant-ph 2026-05 unverdicted novelty 6.0

    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.