One-dimensional quantum walks

@inproceedings{Ambainis2001OnedimensionalQW,
  title={One-dimensional quantum walks},
  author={A. Ambainis and E. Bach and A. Nayak and A. Vishwanath and J. Watrous},
  booktitle={STOC '01},
  year={2001}
}
We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random walk, which we call the <italic>Hadamard walk</italic>. Several striking differences between the quantum and classical cases are observed. For example, when unrestricted in either direction, the Hadamard walk has position that is nearly uniformly distributed in the range <italic>[-t/\sqrt 2, t/\sqrt 2]</italic> after <italic>t… Expand
Asymptotic evolution of quantum walks with random coin
Coined quantum walks on percolation graphs
Properties of long quantum walks in one and two dimensions
  • Hao Luo, P. Xue
  • Physics, Computer Science
  • Quantum Inf. Process.
  • 2015
One-dimensional Hadamard Quantum Walk on a Cycle with Rotational Implementation
A discrete-time quantum walk taking continuous steps
Continuous-Time Quantum Walk on the Line
Invariance in Quantum Walks
A random walk approach to quantum algorithms
  • V. Kendon
  • Mathematics, Physics
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2006
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Quantum computation and decision trees
From quantum cellular automata to quantum lattice gases
Finite Markov chains
On asymptotics of Jacobi polynomials
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
Advanced Mathematical Methods for Scientists and Engineers