Quantum walks and their algorithmic applications

Abstract

Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.

11 pages, 3 figures, short survey on applications of quantum walks, v2: added a reference

References in corpus (9)

• A Quantum Random Walk Search Algorithm
• Exponential algorithmic speedup by quantum walk
• Spatial search by quantum walk
• Weak limits for quantum random walks
• Quantum walks on general graphs
• Quantum Random Walks Hit Exponentially Faster
• Quantum walk algorithm for element distinctness
• A New Type of Limit Theorems for the One-Dimensional Quantum Random Walk
• One-dimensional quantum walks with absorbing boundaries

Cited by in corpus (4)

• Scattering model for quantum random walk on the hypercube
• Quantum search algorithms
• Universal quantum computation with unlabeled qubits
• A matrix representation of graphs and its spectrum as a graph invariant