Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,797,359 papers from all fields of science
Search
Sign In
Create Free Account
Quantum walk
Known as:
Quantum Random Walk
, Quantum Random Walks
In quantum computing, quantum walks are the quantum analogue of classical random walks. Analogous to the classical random walk, where the walker's…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Dirac operator
Element distinctness problem
Feynman checkerboard
Grover's algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2012
Review
2012
Quantum walks: a comprehensive review
S. Venegas-Andraca
Quantum Information Processing
2012
Corpus ID: 27676690
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms…
Expand
Highly Cited
2010
Highly Cited
2010
Exploring topological phases with quantum walks
T. Kitagawa
,
M. Rudner
,
E. Berg
,
E. Demler
2010
Corpus ID: 21800060
The quantum walk was originally proposed as a quantum-mechanical analog of the classical random walk, and has since become a…
Expand
Highly Cited
2004
Highly Cited
2004
Coins make quantum walks faster
A. Ambainis
,
J. Kempe
,
Alexander Rivosh
ACM-SIAM Symposium on Discrete Algorithms
2004
Corpus ID: 8139966
We show how to search <i>N</i> items arranged on a √<i>N</i> × √<i>N</i> grid in time <i>O</i>(√<i>N</i> log <i>N</i>), using a…
Expand
Review
2003
Review
2003
Quantum random walks: An introductory overview
J. Kempe
2003
Corpus ID: 17300331
This article aims to provide an introductory survey on quantum random walks. Starting from a physical effect to illustrate the…
Expand
Highly Cited
2003
Highly Cited
2003
Quantum walk algorithm for element distinctness
A. Ambainis
45th Annual IEEE Symposium on Foundations of…
2003
Corpus ID: 6581885
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element…
Expand
Review
2003
Review
2003
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
A. Ambainis
2003
Corpus ID: 10324299
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with…
Expand
Highly Cited
2002
Highly Cited
2002
Quantum random-walk search algorithm
N. Shenvi
,
J. Kempe
,
J. Kempe
,
K. B. Whaley
2002
Corpus ID: 8688989
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times…
Expand
Highly Cited
2002
Highly Cited
2002
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs
,
R. Cleve
,
E. Deotto
,
E. Farhi
,
S. Gutmann
,
D. Spielman
Symposium on the Theory of Computing
2002
Corpus ID: 308884
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a…
Expand
Highly Cited
2001
Highly Cited
2001
One-dimensional quantum walks
A. Ambainis
,
E. Bach
,
A. Nayak
,
A. Vishwanath
,
John Watrous
Symposium on the Theory of Computing
2001
Corpus ID: 15150587
We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a…
Expand
Highly Cited
2000
Highly Cited
2000
Quantum walks on graphs
D. Aharonov
,
A. Ambainis
,
J. Kempe
,
U. Vazirani
Symposium on the Theory of Computing
2000
Corpus ID: 7480465
We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE