Abstract
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing prob- ability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard walks on the line and sym- metric walks on the hypercube from the viewpoint of absorbing proba- bility and time. Our results may be suggestive in constructing efficient quantum algorithms for combinatorial problems such as SAT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
E. Bach, S. Coppersmith, M. P. Goldschen, R. Joynt, and J. Watrous. One-dimensional quantum walks with absorbing boundaries. Los Alamos e-print archive, quant-ph/0207008, 2002.
A. M. Childs, E. Farhi, and S. Gutmann. An example of the difference between quantum and classical random walks. Los Alamos e-print archive, quant-ph/0103020, 2001.
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.
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.
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.
M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6):1149–1178, 1989.
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.
J. Kempe. Quantum random walks hit exponentially faster. Los Alamos e-print archive, quant-ph/0205083, 2002.
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.
U. Schöning. 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.
J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2):376–391, 2001.
T. Yamasaki. Quantum walks and two-way quantum one-counter automata. Master’s thesis, Department of Information Science, The University of Tokyo, March 2002.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamasaki, T., Kobayashi, H., Imai, H. (2002). An Analysis of Absorbing Times of Quantum Walks. In: Unconventional Models of Computation. UMC 2002. Lecture Notes in Computer Science, vol 2509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45833-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-45833-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44311-7
Online ISBN: 978-3-540-45833-3
eBook Packages: Springer Book Archive