# Quantum walk

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Theory of Computing
- 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

- Theory of Computing
- 2008

We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuousâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- STOC
- 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

- SODA
- 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

- STOC
- 2003

We construct a black box graph traversal problem that can be solved exponentially faster on a quantum computer than on aâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting timesâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- RANDOM
- 2002

Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting thatâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Quantum Information Processing
- 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

- STOC
- 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

- STOC
- 2001

We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze aâ€¦Â (More)

Is this relevant?