Discrete Quantum Walks Hit Exponentially Faster

  • Julia Kempe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2764)

Abstract

This paper addresses the question: what processes take polynomial time on a quantum computer that require exponential time classically? We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum walks. We provide the basic framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We outline a possible application to sequential packet routing.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AA+01]
    Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proc. 33th STOC, pp. 50–59. ACM Press, New York (2001)Google Scholar
  2. [AB+01]
    Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proc. 33th STOC, pp. 60–69. ACM, New York (2001)Google Scholar
  3. [AF01]
    Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs, Unpublished, preprint available at http://statwww.berkeley.edu/users/aldous/RWG/book.html (2001)
  4. [BB+97]
    Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. Siam Journal on Computing 26(1510) (1997)Google Scholar
  5. [CC+02]
    Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by quantum walk. In: Proc. 35th STOC (2003) (to appear)Google Scholar
  6. [CFG02]
    Childs, A., Farhi, E., Gutmann, S.: An example of the difference between quantum and classical random walks. Quantum Information Processing 1(35) (2002)Google Scholar
  7. [DFK91]
    Dyer, M., Frieze, A., Kannan, R.: A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM 38(1), 1–17 (1991)CrossRefMathSciNetMATHGoogle Scholar
  8. [FG98]
    Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A. 58, 915–928 (1998)CrossRefMathSciNetGoogle Scholar
  9. [Gro96]
    Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. 28th STOC, Philadelphia, Pennsylvania, pp. 212–219. ACM, New York (1996)Google Scholar
  10. [GS+01]
    Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. Siam Journal on Computing 26(1510) (1997)Google Scholar
  11. [HRT00]
    Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. In: Proc. 32nd STOC, pp. 627–635 (2000)Google Scholar
  12. [JS89]
    Jerrum, M., Sinclair, A.: Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation 82(1), 93–133 (1989)CrossRefMathSciNetMATHGoogle Scholar
  13. [Mey96]
    Meyer, D.: From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85, 551–574 (1996)CrossRefMATHGoogle Scholar
  14. [MR95]
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)MATHGoogle Scholar
  15. [MR02]
    Moore, C., Russell, A.: Quantum walks on the hypercube. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 164–178. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. [NC00]
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)MATHGoogle Scholar
  17. [Pap94]
    Papadimitriou, C.: RANDOM 2002. Addison Wesley, Reading (1994)Google Scholar
  18. [Sch99]
    Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proc. 40th FOCS, pp. 410–414. IEEE, Los Alamitos (1999)Google Scholar
  19. [Sho97]
    Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comp. 26(5), 1484–1509 (1997)CrossRefMathSciNetMATHGoogle Scholar
  20. [Sim97]
    Simon, D.: On the power of quantum computation. SIAM J. Comp. 26(5), 1474–1483 (1997)CrossRefMATHGoogle Scholar
  21. [SKW03]
    Shenvi, N., Kempe, J., Whaley, K.B.: A quantum random walk search algorithm. Phys. Rev. A 67(5), 52307 (2003)CrossRefGoogle Scholar
  22. [Wat01]
    Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences 62(2), 376–391 (2001)CrossRefMathSciNetMATHGoogle Scholar
  23. [Yam01]
    Yamasaki, T.: personal communication (2001)Google Scholar
  24. [YKI02]
    Yamasaki, T., Kobayashi, H., Imai, H.: An analysis of absorbing times of quantum walks. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 315–330. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Julia Kempe
    • 1
    • 2
  1. 1.CNRS-LRI, UMR 8623Université de Paris-SudOrsayFrance
  2. 2.Computer Science Division and Dept. of ChemistryUniversity of CaliforniaBerkeleyUSA

Personalised recommendations