pith. sign in

arxiv: 1612.06012 · v2 · pith:5TL24C46new · submitted 2016-12-19 · 🪐 quant-ph

Realizable Quantum Adiabatic Search

classification 🪐 quant-ph
keywords quantumsearchadiabaticalgorithmdimensionsgroverrealizablealgorithms
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.