Skip to main content
SpringerLink
Log in

Discrete Quantum Walks Hit Exponentially Faster

  • Conference paper
Book cover Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (RANDOM 2003, APPROX 2003)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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. 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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A. 58, 915–928 (1998)

    Article  MathSciNet  Google Scholar 

  9. 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. 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. 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. Jerrum, M., Sinclair, A.: Approximate counting, uniform generation and rapidly mixing Markov chains. Information and Computation 82(1), 93–133 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Meyer, D.: From quantum cellular automata to quantum lattice gases. J. Stat. Phys. 85, 551–574 (1996)

    Article  MATH  Google Scholar 

  14. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  17. Papadimitriou, C.: RANDOM 2002. Addison Wesley, Reading (1994)

    Google Scholar 

  18. 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. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comp. 26(5), 1484–1509 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  20. Simon, D.: On the power of quantum computation. SIAM J. Comp. 26(5), 1474–1483 (1997)

    Article  MATH  Google Scholar 

  21. Shenvi, N., Kempe, J., Whaley, K.B.: A quantum random walk search algorithm. Phys. Rev. A 67(5), 52307 (2003)

    Article  Google Scholar 

  22. Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences 62(2), 376–391 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  23. Yamasaki, T.: personal communication (2001)

    Google Scholar 

  24. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS-LRI, UMR 8623, Université de Paris-Sud, 91405, Orsay, France

    Julia Kempe

  2. Computer Science Division and Dept. of Chemistry, University of California, Berkeley, CA, 94709, USA

    Julia Kempe

Authors
  1. Julia Kempe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Princeton University, 35 Olden Street, 08540, Princeton, NJ

    Sanjeev Arora

  2. Institute for Computer Science, University of Kiel, Olshausenstrasse 40, 24118, Kiel, Germany

    Klaus Jansen

  3. Battelle Bâtiment A, Centre Universitaire d’Informatique, Route de Drize 7, 1227, Carouge, Geneva, Switzerland

    José D. P. Rolim

  4. University of California, Los Angeles

    Amit Sahai

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kempe, J. (2003). Discrete Quantum Walks Hit Exponentially Faster. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45198-3_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40770-6

  • Online ISBN: 978-3-540-45198-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation