Lower bounds for adiabatic quantum algorithms by quantum speed limits
arXiv:2207.01604 · doi:10.1103/physrevresearch.5.033175
Abstract
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial state. After examining adiabatic versions of certain keystone circuit-based quantum algorithms, this technique is applied to adiabatic quantum algorithms with undetermined speedup. In particular, we analytically obtain lower bounds on adiabatic algorithms for finding k-clique in random graphs. Additionally, for a particular class of Hamiltonian, it is straightforward to prove the equivalence between our framework and the conventional approach based on spectral gap analysis.
11 pages, 0 figures, published version
References in corpus (5)
- Bounds for the adiabatic approximation with applications to quantum computation
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Performance Evaluation of Adiabatic Quantum Computation via Quantum Speed Limits and Possible Applications to Many-Body Systems
- Finding Small and Large k-Clique Instances on a Quantum Computer
- Bounds on quantum adiabaticity in driven many-body systems from generalized orthogonality catastrophe and quantum speed limit