Spatial search by quantum walk
- Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)
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 {radical}(N) for d>2, and in time of order {radical}(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 {radical}(N) speedup can also be achieved on the hypercube. We show that full {radical}(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 {radical}(N) poly(log N), and in d<4, the algorithm does not provide substantial speedup.
- OSTI ID:
- 20645859
- Journal Information:
- Physical Review. A, Vol. 70, Issue 2; Other Information: DOI: 10.1103/PhysRevA.70.022314; (c) 2004 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Search on a hypercubic lattice using a quantum random walk. I. d>2
Quantum random-walk search algorithm