An analysis of absorbing times of quantum walks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2509, Issue , 2002, Pages 315-329

  Yamasaki, Tomohiro ^a   Kobayashi, Hirotada ^a,b   Imai, Hiroshi ^a,b  

^a UNIVERSITY OF TOKYO   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; QUANTUM COMPUTERS; QUANTUM THEORY;

ALGORITHMIC TOOLS; COMBINATORIAL PROBLEM; HADAMARD; HYPERCUBE; QUANTUM ALGORITHMS; QUANTUM WALK;

ALGORITHMS;

EID: 84958761644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45833-6_26     Document Type: Conference Paper

References (14)

1. D. Aharonov, A. Ambainis, J. Kempe, and U. V. Vazirani. Quantum walks on graphs. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 50–59, 2001.
2. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 37–49, 2001.
3. E. Bach, S. Coppersmith, M. P. Goldschen, R. Joynt, and J. Watrous: Onedimensional quantum walks with absorbing boundaries. Los Alamos e-print archive, quant-ph/0207008, 2002.
4. A. M. Childs, E. Farhi, and S. Gutmann. An example of the difference between quantum and classical random walks. Los Alamos e-print archive, quantph/ 0103020, 2001.
5. M. E. Dyer, A. M. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38(1):1–17, 1991.
6. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pages 212–219, 1996.
7. T. Hofmeister, U. Schöning, R. Schuler, and O. Watanabe. A probabilistic 3-SAT algorithm further improved. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, volume 2285 of Lecture Notes in Computer Science, pages 192–202, 2002.
8. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6):1149–1178, 1989.
9. M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pages 712–721, 2001.
10. J. Kempe. Quantum random walks hit exponentially faster. Los Alamos e-print archive, quant-ph/0205083, 2002.
11. C. Moore and A. Russell. Quantum walks on the hypercube. In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science, 2002. To appear.
12. U. Schoning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 410–414, 1999.
13. J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2):376–391, 2001.
14. T. Yamasaki: Quantum walks and two-way quantum one-counter automata. Master’s thesis, Department of Information Science, The University of Tokyo, March 2002.