%0 Journal Article
%J Physical Review A
%D 2004
%T Spatial search by quantum walk
%A Andrew M. Childs
%A Jeffrey Goldstone
%X Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial dimensions can be searched in time of order sqrt(N) for d>2, and in time of order sqrt(N) poly(log N) for d=2. We consider an alternative search algorithm based on a continuous time quantum walk on a graph. The case of the complete graph gives the continuous time search algorithm of Farhi and Gutmann, and other previously known results can be used to show that sqrt(N) speedup can also be achieved on the hypercube. We show that full sqrt(N) speedup can be achieved on a d-dimensional periodic lattice for d>4. In d=4, the quantum walk search algorithm takes time of order sqrt(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup.
%B Physical Review A
%V 70
%8 2004/8/23
%G eng
%U http://arxiv.org/abs/quant-ph/0306054v2
%N 2
%! Phys. Rev. A
%R 10.1103/PhysRevA.70.022314