Quantum walks on graphs

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 50-59

  Aharonov, D ^a   Ambainis, A ^a   Kempe, J ^a   Vazirani, U ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MARKOV PROCESSES; QUANTUM THEORY;

QUANTUM WALKS;

COMPUTER SCIENCE;

EID: 0034819347     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380758     Document Type: Conference Paper

References (11)

1. Quantum circuits with mixed states
2. One-dimensional quantum walks
3. Lifting Markov chains to speed up mixing
4. Quantum computation and decision trees
5. A fast quantum mechanical algorithm for database search
6. Mixing times
7. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
8. Approximate counting, generation, and rapidly mixing Markov chains