Analysis of absorbing times of quantum walks

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 68, Issue 1, 2003, Pages

  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

ALGORITHMS; COMPUTER SIMULATION; MARKOV PROCESSES; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; VECTORS;

ABSORBING PROBABILITY; HADAMARD WALKS; QUANTUM COMPUTATION; QUANTUM WALKS;

QUANTUM THEORY;

EID: 0141684709     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. M. Jerrum and A. Sinclair, SIAM J. Comput. 18, 1149 (1989).
2. M. Jerrum, A. Sinclair, and E. Vigoda, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2001), pp. 712-721.
3. M. E. Dyer, A. M. Frieze, and R. Kannan, J. ACM 38, 1 (1991).
4. U. Schöning, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, New York, 1999), pp. 410-414.
5. T. Hofmeister, U. Schöning, R. Schuler, and O. Watanabe, in STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, edited by H. Alt and A. Ferreira, Lecture Notes in Computer Science Vol. 2285 (Springer-Verlag, Berlin, 2002), pp. 192-202.
6. J. H. Watrous, J. Comput. Syst. Sci. 62, 376 (2001).
7. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. H. Watrous, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2001), pp. 37-49.
8. D. Aharonov, A. Ambainis, J. Kempe, and U. V. Vazirani, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (ACM, New York, 2001), pp. 50-59.
9. C. Moore and A. Russell, in Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, edited by J. D. P. Rolim and S. P. Vadhan, Lecture Notes in Computer Science Vol. 2483 (Springer-Verlag, Berlin, 2002), pp. 164-178.
10. E. H. Farhi and S. Gutmann, Phys. Rev. A 58, 915 (1998).
11. A. M. Childs, E. H. Farhi, and S. Gutmann, Quantum Inf. Proc. 1, 35 (2002).
12. A. M. Childs, R. E. Cleve, E. Deotto, E. H. Farhi, S. Gutmann, and D. A. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, New York, in press).
13. D. A. Meyer, J. Stat. Phys. 85, 551 (1996).
14. T. Yamasaki, Master's thesis, Department of Information Science, The University of Tokyo (2002).
15. E. Bach, S. Coppersmith, M. P. Goldschen, R. Joynt, and J. H. Watrous, e-print quant-ph/0207008.
16. L. K. Grover, in Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (ACM, New York, 1996), pp. 212-219.
17. J. Kempe, in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, edited by S. Arora, K. Jansen, J. D. P. Rolim, and A. Sahai, Lecture Notes in Computer Science (Springer-Verlag, Berlin, in press).