Quantum random walks without walking
Abstract
Quantum random walks have received much interest due to their nonintuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable and not limited to special connectivity criteria. We present a scheme for walking on arbitrarily complex graphs, which can be realized using a variety of quantum systems such as a Bose-Einstein condensate trapped inside an optical lattice. This scheme is particularly elegant since the walker is not required to physically step between the nodes; only flipping coins is sufficient.
- Publication:
-
Physical Review A
- Pub Date:
- December 2009
- DOI:
- 10.1103/PhysRevA.80.060304
- arXiv:
- arXiv:0809.0034
- Bibcode:
- 2009PhRvA..80f0304M
- Keywords:
-
- 03.67.Lx;
- 03.75.Gg;
- 05.40.Fb;
- Quantum computation;
- Entanglement and decoherence in Bose-Einstein condensates;
- Random walks and Levy flights;
- Quantum Physics
- E-Print:
- 12 manuscript pages, 3 figures