A universal adiabatic quantum query algorithm
arXiv:1409.3558
Abstract
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or Hamiltonian-based) quantum computation, due to a known equivalence between these two query complexity models. In this work, we revisit this result by providing a direct proof in the continuous-time model. One originality of our proof is that it draws new connections between the adversary bound, a modern technique of theoretical computer science, and early theorems of quantum mechanics. Indeed, the proof of the lower bound is based on Ehrenfest's theorem, while the upper bound relies on the adiabatic theorem, as it goes by constructing a universal adiabatic quantum query algorithm. Another originality is that we use for the first time in the context of quantum computation a version of the adiabatic theorem that does not require a spectral gap.
arXiv comment22 pages, compared to v1, includes a rigorous proof of the correctness of the algorithm based on a version of the adiabatic theorem that does not require a spectral gap
References in corpus (11)
- Spatial search by quantum walk
- Quantum Search by Local Adiabatic Evolution
- On the relationship between continuous- and discrete-time quantum walk
- Negative weights make adversaries stronger
- Spatial search and the Dirac equation
- Quantum query complexity of state conversion
- Hamiltonian Oracles
- Quantum search on graphene lattices
- Cryptographic Distinguishability Measures for Quantum Mechanical States
- An Analog Analogue of a Digital Quantum Computation
- Quantum lower bounds by quantum arguments