Efficient quantum circuit implementation of quantum walks

B. L. Douglas, J. B. Wang

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)


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.

Original languageEnglish
Article number052335
Pages (from-to)1-5
Number of pages5
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Issue number5
Publication statusPublished - 1 May 2009
Externally publishedYes

Bibliographical note

Erratum can be found in Physical Review A - Atomic, Molecular, and Optical Physics, Volume 80(5), 059901, http://dx.doi.org/10.1103/PhysRevA.80.059901


Dive into the research topics of 'Efficient quantum circuit implementation of quantum walks'. Together they form a unique fingerprint.

Cite this