Quantum random-walk search algorithm

Journal Article · Thu May 01 00:00:00 EDT 2003 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.67.052307· OSTI ID:20636356

Shenvi, Neil; Whaley, K Birgitta ^[1]; Kempe, Julia ^[1]

---

1. Department of Chemistry, University of California, Berkeley, California 94720 (United States)

Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O({radical}(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

• OSTI ID: 20636356
• Journal Information: Physical Review. A, Vol. 67, Issue 5; Other Information: DOI: 10.1103/PhysRevA.67.052307; (c) 2003 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
ALGORITHMS
EIGENFUNCTIONS
EIGENVALUES
FLEXIBILITY
GAIN
INFORMATION THEORY
PROBABILITY
QUANTUM MECHANICS
RANDOMNESS