Andris Ambainis
ABSTRACT
We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random walk, which we call the Hadamard walk. Several striking differences between the quantum and classical cases are observed. For example, when unrestricted in either direction, the Hadamard walk has position that is nearly uniformly distributed in the range [-t/\sqrt 2, t/\sqrt 2] after t steps, which is in sharp contrast to the classical random walk, which has distance O(\sqrt t) from the origin with high probability. With an absorbing boundary immediately to the left of the starting position, the probability that the walk exits to the left is 2/&pgr, and with an additional absorbing boundary at location n, the probability that the walk exits to the left actually increases, approaching 1/\sqrt 2 in the limit. In the classical case both values are 1.
- 1.M. Abramowitz and I. Stegun, Handbook of Mathematical Functions. Dover, New York, 1965. Google Scholar
Digital Library
- 2.D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani. Quantum walks on graphs. To appear in Proceedings of the Thirty-third ACM Symposium on Theory of Computing, 2001. Google ScholarDigital Library
- 3.R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Racko. Random walks, universal traversal sequences, and the time complexity of maze problems. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 218-223, 1979.Google ScholarDigital Library
- 4.C. Bender and S. Orszag. Advanced Mathematical Methods for Scientists and Engineers. International Series in Pure and Applied Mathematics. McGraw-Hill, Inc., New York, 1978.Google Scholar
- 5.N. Bleistein and R. Handelsman. Asymptotic Expansions of Integrals. Holt, Rinehart and Winston, New York, 1975.Google Scholar
- 6.A. Childs, E. Farhi, S. Gutmann. An example of the difference between quantum and classical random walks. LANL preprint archive, quant-ph/0103020. Google ScholarDigital Library
- 7.L.-D. Chen and M. E. H. Ismail, On asymptotics of Jacobi polynomials, SIAM J. Math. Anal., 22:1442-1449, 1991. Google ScholarDigital Library
- 8.E. Coffman and G. Lueker. Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, 1991.Google Scholar
- 9.P. Diaconis. Group Representations in Probability and Statistics, volume 11 of Lecture Notes-Monograph Series. Institute of Mathematical Statistics, Hayward, California, 1988.Google Scholar
- 10.M. Dyer, A. Frieze, and R. Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38(1):1-17, January 1991. Google ScholarDigital Library
- 11.H. Dym and H. P. McKean. Fourier Series and Integrals, volume 14 of Probability and Mathematical Statistics. Academic Press, New York, 1972.Google Scholar
- 12.E. Farhi and S. Gutmann. Quantum computation and decision trees. Physical Review A, 58:915-928, 1998.Google ScholarCross Ref
- 13.R. Feynman and A. Hibbs. Quantum Mechanics and Path Integrals. McGraw-Hill, 1965.Google Scholar
- 14.W. Gosper. Decision procedure for indefinite hypergeometric summation. In Proceedings of the National Academy of Sciences of U.S.A., volume 75, pages 40-42, 1978.Google ScholarCross Ref
- 15.R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 2nd edition, 1994. Google ScholarDigital Library
- 16.L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 212-219, Philadelphia, Pennsylvania, 22-24 May 1996. Google ScholarDigital Library
- 17.M. Jerrum and A. Sinclair. Approximating the permanent. SIAM Journal on Computing, 18(6):1149-1178, December 1989. Google ScholarDigital Library
- 18.M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Dorit S. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, chapter 12, pages 482-520. PWS Publishing, Boston, 1996. Google ScholarDigital Library
- 19.M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. To appear in Proceedings of the Thirty-third ACM Symposium on Theory of Computing, 2001. Google ScholarDigital Library
- 20.R. Karp, M. Luby, and A. Marchetti-Spaccamela. A probabilistic analysis of multidimensional bin packing problems. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pages 289-298, 1984. Google ScholarDigital Library
- 21.J. Kemeny and J. Snell. Finite Markov Chains. Springer-Verlag, 1983.Google Scholar
- 22.G. Louchard. The brownian motion: a neglected tool for the complexity analysis of sorted tables manipulation. RAIRO Inform. Th., 17(4), 1983.Google Scholar
- 23.L. Lovasz and R. Kannan. Faster mixing via average conductance. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, 1-4 May 1999. ACM. Google ScholarDigital Library
- 24.D. Meyer. From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics, 85:551-574, 1996. Also available from the Los Alamos Preprint Archive, quant-ph/9604003.Google ScholarCross Ref
- 25.R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995. Google ScholarDigital Library
- 26.A. Nayak and A. Vishwanath. Quantum walk on the line. In preparation. Preliminary version available from the Los Alamos Preprint Archive, quant-ph/0010117.Google Scholar
- 27.C. Papadimitriou. On selecting a satisfying truth assignment. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 163-169, San Juan, Puerto Rico, 1-4 October 1991. IEEE Computer Society. Google ScholarDigital Library
- 28.T. L. Saaty, Modern Nonlinear Equations. Dover Publications, 1981.Google Scholar
- 29.U. Sch.oning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York City, NY, 17-19 October 1999. IEEE Computer Society. Google ScholarDigital Library
- 30.G. Szego, Orthogonal Polynomials, AMS, 4th edition, 1975.Google Scholar
- 31.E. C. Titchmarsh. The Theory of Functions. Oxford University Press, 2nd edition, 1979.Google Scholar
- 32.J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2): 376-391, 2001. Google ScholarDigital Library
- 33.D. Zeilberger. The method of creative telescoping. Journal of Symbolic Computation, 11:195-204, 1991. Google ScholarDigital Library
Index Terms
- One-dimensional quantum walks
Recommendations
Unitary equivalent classes of one-dimensional quantum walks
This study investigates unitary equivalent classes of one-dimensional quantum walks. We prove that one-dimensional quantum walks are unitary equivalent to quantum walks of Ambainis type and that translation-invariant one-dimensional quantum walks are ...
Quantum walks: a comprehensive review
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of ...
Quantum Random Walks in One Dimension
This letter treats the quantum random walk on the line determined by a 2 × 2 unitary matrix U. A combinatorial expression for the mth moment of the quantum random walk is presented by using 4 matrices, P, Q, R and S given by U. The dependence of the mth ...
Comments