Efficient quantum circuit implementation of quantum walks
- School of Physics, University of Western Australia, 6009 Perth (Australia)
Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the 'glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed and discuss potential applications to quantum search for marked vertices along these graphs.
- OSTI ID:
- 21300843
- Journal Information:
- Physical Review. A, Vol. 79, Issue 5; Other Information: DOI: 10.1103/PhysRevA.79.052335; (c) 2009 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Framework for discrete-time quantum walks and a symmetric walk on a binary tree
Efficient quantum circuits for Szegedy quantum walks