February 1, 2004
Author(s)
D Ciampini, M B. d'Arcy, J M. Grossman, Kristian Helmerson, Paul D. Lett, William D. Phillips, A Vaziri, S L. Rolston
Classical random walks have many applications in computer science. Quantum random walks (QRWs) [1] have been suggested as the potential basis for quantum computing algorithms. Such algorithms have been reported, some of which offer an exponential speed-up