2008/09/30 by Kia Manouchehri, K Manouchehri, Jingbo Wang +1
Computer Science · Mathematics · Physics and Astronomy · #Artificial intelligence #Cold Atom Physics and Bose-Einstein Condensates #Combinatorics #Computer science #Lattice (music) #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum mechanics #Quantum network #Quantum walk #Random walk #Realization (probability) #Scheme (mathematics) #Statistical physics #Theoretical computer science #Topology (electrical circuits) #Variety (cybernetics) #quant-ph
paper · pdf · doi:10.1103/physreva.80.060304
published as K. Manouchehri and J. B. Wang, Phys. Rev. A 80, 060304(R) (2009) · 12 manuscript pages, 3 figures
openalex publication_date 2009/12/16 · arxiv created 2009/12/17 · arxiv updated 2010/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.