One-dimensional quantum walks

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 37-49

  Ambainis, A ^a   Bach, E ^a   Nayak, A ^a   Vishwanath, A ^a   Watrous, J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBABILITY; QUANTUM THEORY;

QUANTUM WALKS;

COMPUTER SCIENCE;

EID: 0034832939     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380757     Document Type: Conference Paper

References (33)

1. Quantum walks on graphs
2. Random walks, universal traversal sequences, and the time complexity of maze problems
3. Advanced mathematical methods for scientists and engineers
4. On asymptotics of Jacobi polynomials
5. A random polynomial-time algorithm for approximating the volume of convex bodies
6. Quantum computation and decision trees
7. Decision procedure for indefinite hypergeometric summation
8. A fast quantum mechanical algorithm for database search
9. Approximating the permanent
10. The Markov chain Monte Carlo method: An approach to approximate counting and integration
11. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
12. A probabilistic analysis of multidimensional bin packing problems
13. The brownian motion: A neglected tool for the complexity analysis of sorted tables manipulation
14. Faster mixing via average conductance
15. Prom quantum cellular automata to quantum lattice gases
16. On selecting a satisfying truth assignment
17. A probabilistic algorithm for k-SAT and constraint satisfaction problems
18. Quantum simulations of classical random walks and undirected graph connectivity
19. The method of creative telescoping