Where to quantum walk

Abstract

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.

13 pages, 3 figures, feedback welcome

References in corpus (15)

• Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
• Universal computation by quantum walk
• Quantum walks of correlated particles
• Exponential algorithmic speedup by quantum walk
• Quantum Walk in Position Space with Single Optically Trapped Atoms
• Realization of quantum walks with negligible decoherence in waveguide lattices
• Massive Parallel Quantum Computer Simulator
• Quantum Random Walks Hit Exponentially Faster
• Quantum walks with infinite hitting times
• Quantum walks on quotient graphs
• Recurrence properties of unbiased coined quantum walks on infinite $d$-dimensional lattices
• Counting Statistics of Many-Particle Quantum Walks
• Quantum walk based search algorithms
• Bound Molecules in an Interacting Quantum Walk
• One-dimensional quantum walks with absorbing boundaries