An Example of the Difference Between Quantum and Classical Random Walks

Authors:
Andrew M. Childs;Edward Farhi;Sam Gutmann
Affiliations:
Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;Department of Mathematics, Northeastern University, Boston, Massachusetts 02115
Venue:
Quantum Information Processing
Year:
2002

Citing 1
Cited 26

One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum walks on graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Exponential algorithmic speedup by a quantum walk

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
One-Dimensional Continuous-Time Quantum Walks

Quantum Information Processing
One-dimensional quantum walks with absorbing boundaries

Journal of Computer and System Sciences
Coins make quantum walks faster

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The Quantum Complexity of Markov Chain Monte Carlo

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Graph matching using the interference of continuous-time quantum walks

Pattern Recognition
Graph matching using the interference of discrete-time quantum walks

Image and Vision Computing
Coined quantum walks lift the cospectrality of graphs and trees

Pattern Recognition
Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory

Quantum Information Processing
Graph embedding using quantum commute times

GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Quantum walks: a Markovian perspective

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the von neumann entropy of certain quantum walks subject to decoherence†

Mathematical Structures in Computer Science
Tree search and quantum computation

Quantum Information Processing
Limit theorems and absorption problems for quantum random walks in one dimension

Quantum Information & Computation
On mixing in continuous-time quantum walks on some circulant graphs

Quantum Information & Computation
Mixing and decoherence in continuous-time quantum walks on cycles

Quantum Information & Computation
Graph embedding using a quasi-quantum analogue of the hitting times of continuous time quantum walks

Quantum Information & Computation
Complete characterization of mixing time for the continuous quantum walk on the hypercube with markovian decoherence model

Quantum Information & Computation
Towards unitary representations for graph matching

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Coined quantum walks lift the cospectrality of graphs and trees

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
On the efficiency of quantum algorithms for Hamiltonian simulation

Quantum Information Processing
Asymptotic distributions of quantum walks on the line with two entangled coins

Quantum Information Processing
Quantum walks: a comprehensive review

Quantum Information Processing
Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case.PACS: 03.67.Hk