Quantum Random Walks
Classical random walks are a major
component of many classical algorithms.
computers can carry out quantum random walks, and it is
yet known whether such quantum walks can speed up
classical computation methods. We have
looked at some properties of
quantum random walks,
particularly their absorption at boundaries.
E. Bach, M. Goldschen, S. Coppersmith, R. Joynt, and
J. Watrous, Journal of Computer and System Sciences
69, 562 (2004)
One-dimensional quantum walks with