Bounding Run-Times of Local Adiabatic Algorithms

Abstract

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic unordered search of van Dam et al. (How powerful is adiabatic quantum computation? Proc. IEEE FOCS, pp. 279-287, 2001) and Roland and Cerf (Physical Review A 65, 042308, 2002) when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in $\log N$, where $N$ is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.

11 pages

References in corpus (8)

• 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
• Quantum Search by Local Adiabatic Evolution
• Robustness of adiabatic quantum computation
• General error estimate for adiabatic quantum computing
• Exponential complexity of an adiabatic algorithm for an NP-complete problem
• The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
• How to Make the Quantum Adiabatic Algorithm Fail