arXiv Analytics

Sign in

arXiv:1107.3795 [quant-ph]AbstractReferencesReviewsResources

Where to quantum walk

Viv Kendon

Published 2011-07-19Version 1

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always employed the quantum walk in the form of a program running on a quantum computer. Recent results showing that quantum walks are "universal for quantum computation" relate entirely to algorithms, and do not imply that a physical quantum walk could provide a new architecture for quantum computers. Nonetheless, quantum walks used to model transport phenomena in spin chains and biomolecules broaden their scope well beyond algorithms, and reopen the question of when a physical implementation might provide useful computational outputs. In this article we determine the conditions under which a physical quantum walk experiment could provide useful results beyond the reach of classical computation.

Comments: 13 pages, 3 figures, feedback welcome
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0305053 (Published 2003-05-09)
Introduction to Quantum Computers and Quantum Algorithms
arXiv:quant-ph/0310165 (Published 2003-10-28, updated 2004-03-02)
Acceleration of quantum algorithms using three-qubit gates
arXiv:1209.3917 [quant-ph] (Published 2012-09-18, updated 2013-10-10)
The Topology of Quantum Algorithms