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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We describe a general method to obtain quantum speedups of classical algorithms which are based on the technique of backtracking… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We propose a new method for designing quantum search algorithms forfinding a "marked" element in the state space of a classical… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
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… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Abstract. This letter treats the quantum random walk on the line determined by a 2 × 2 unitary matrix U . A combinatorial… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a… (More)
Is this relevant?