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.
arXiv comment11 pages, 0 figures, published version
References in corpus (25)
- Quantum Mechanics helps in searching for a needle in a haystack
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computing
- Strengths and Weaknesses of Quantum Computing
- Shortcuts to adiabaticity: concepts, methods, and applications
- Fast optimal frictionless atom cooling in harmonic traps
- Quantum Search by Local Adiabatic Evolution
- Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
- Shortcuts to adiabaticity by counter-diabatic driving
- Bounds for the adiabatic approximation with applications to quantum computation
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Generating shortcuts to adiabaticity in quantum and classical dynamics
- Detection of multipartite entanglement in the vicinity of symmetric Dicke states
- Quantum Algorithms for Element Distinctness
- Adiabatic Quantum Computation and Deutsch's Algorithm
- Time scale for adiabaticity breakdown in driven many-body systems and orthogonality catastrophe
- Performance Evaluation of Adiabatic Quantum Computation via Quantum Speed Limits and Possible Applications to Many-Body Systems
- A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
- Period Finding with Adiabatic Quantum Computation
- The Travelling Salesman Problem and Adiabatic Quantum Computation: An Algorithm
- Finding Small and Large k-Clique Instances on a Quantum Computer
- A Class of Time-Energy Uncertainty Relations for Time-dependent Hamiltonians
- Finding cliques by quantum adiabatic evolution
- A necessary condition for quantum adiabaticity applied to the adiabatic Grover search
- Bounds on quantum adiabaticity in driven many-body systems from generalized orthogonality catastrophe and quantum speed limit