Realizable Quantum Adiabatic Search
arXiv:1612.06012 · doi:10.1209/0295-5075/118/30003
Abstract
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a mechanism to carry out a quantum adiabatic variant of Grover's search algorithm using a single bosonic particle placed in an optical lattice. By studying the scaling of the gap and relevant matrix element in various spatial dimensions, we show that a quantum speedup can already be gained in three dimensions. We argue that the suggested scheme is realizable with present-day experimental capabilities.
6 pages, 4 figures
References in corpus (10)
- Quantum phase transition from a superfluid to a Mott insulator in a gas of ultracold atoms
- Spatial search by quantum walk
- Bounds for the adiabatic approximation with applications to quantum computation
- Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
- Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
- Condensate fraction in a 2D Bose gas measured across the Mott-insulator transition
- The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
- Connectivity is a Poor Indicator of Fast Quantum Search
- Phases of a 2D Bose Gas in an Optical Lattice
- Strongly Interacting Atom Lasers in Three Dimensional Optical Lattices