Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Computer Science

SOFSEM 2008: SOFSEM 2008: Theory and Practice of Computer Science pp 1–4Cite as

Quantum Random Walks – New Method for Designing Quantum Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4910))

Abstract

Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on ”glued trees” graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. Journal of ACM 51(4), 595–605 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ambainis, A.: Quantum walks and their algorithmic applications. International Journal of Quantum Information 1, 507–518 (2003)

    Article  MATH  Google Scholar 

  3. Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of FOCS 2004, pp. 22–31 (2004)

    Google Scholar 

  4. Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range. Theory of Computing 1, 37–46 (2005)

    Article  MathSciNet  Google Scholar 

  5. Ambainis, A., Childs, A., Reichardt, B., Spalek, R., Zhang, S.: Any AND-OR formula of size N can be evaluated in time N 1/2 + o(1) on a quantum computer. In: Proceedings of FOCS 2007, pp. 363–372 (2007)

    Google Scholar 

  6. Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of SODA 2005, pp. 1099–1108 (2005)

    Google Scholar 

  7. Barnum, H., Saks, M.: A lower bound on the quantum complexity of read once functions. Journal of Computer and System Sciences 69, 244–258 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Boneh, D., Lipton, R.: Quantum cryptanalysis of hidden linear functions (extended abstract). In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 424–437. Springer, Heidelberg (1995)

    Google Scholar 

  9. Buhrman, H., Špalek, R.: Quantum verification of matrix products. In: Proceedings of SODA 2006, pp. 880–889 (2006)

    Google Scholar 

  10. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information Science. AMS Contemporary Mathematics Series, vol. 305, pp. 53–74 (2002)

    Google Scholar 

  11. Brassard, G., Hoyer, P., Tapp, A.: Quantum cryptanalysis of hash and claw-free functions. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 163–169. Springer, Heidelberg (1998)

    Google Scholar 

  12. Brassard, G., Høyer, P., Tapp, A.: Quantum counting. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 820–831. Springer, Heidelberg (1998)

    Google Scholar 

  13. Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by quantum walk. In: Proceedings of STOC 2003, pp. 59–68 (2003)

    Google Scholar 

  14. Childs, A.M., Goldstone, J.: Spatial search and the Dirac equation. Physical Review A 70, 42312 (2004)

    Article  MathSciNet  Google Scholar 

  15. Farhi, E., Goldstone, J., Gutman, S., Sipser, M.: A quantum adiabatic algorithm applied to random instances of an NP-complete problem. Science 292, 472–476 (2001)

    Article  MathSciNet  Google Scholar 

  16. Farhi, E., Goldstone, J., Gutman, S.: A Quantum Algorithm for the Hamiltonian NAND Tree. arXiv preprint quant-ph/0702144

    Google Scholar 

  17. Freivalds, R.: Fast probabilistic algorithms. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 57–69. Springer, Heidelberg (1979)

    Google Scholar 

  18. Grover, L.: A fast quantum mechanical algorithm for database search. In: Grover, L. (ed.) Proceedings of STOC 1996, pp. 212–219 (1996)

    Google Scholar 

  19. Hallgren, S.: Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem. Journal of the ACM 54, 1 (2007)

    Article  MathSciNet  Google Scholar 

  20. Jozsa, R.: Quantum factoring, discrete logarithms, and the hidden subgroup problem. IEEE Multimedia 3, 34–43 (1996)

    Google Scholar 

  21. Kempe, J.: Quantum random walks - an introductory overview. Contemporary Physics 44(4), 307–327 (2003)

    Article  MathSciNet  Google Scholar 

  22. Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. Algorithmica 48(3), 221–232 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  23. Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proceedings of STOC 2007, pp. 575–584 (2007)

    Google Scholar 

  24. Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM Journal on Computing 37(2), 413–424 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Nayak, A., Wu, F.: The quantum query complexity of approximating the median and related statistics. In: Proceedings of STOC 1999, pp. 384–393 (1999)

    Google Scholar 

  26. Shor, P.: Algorithms for Quantum Computation: Discrete Logarithms and Factoring. In: Proceedings of FOCS 1994, pp. 124–134 (1994)

    Google Scholar 

  27. Szegedy, M.: Quantum speed-up of Markov chain based algorithms. In: Proceedings of FOCS 2004, pp. 32–41 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Latvia, Raina bulv. 19, Riga, LV-1586, Latvia

    Andris Ambainis

Authors
  1. Andris Ambainis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Viliam Geffert Juhani Karhumäki Alberto Bertoni Bart Preneel Pavol Návrat Mária Bieliková

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambainis, A. (2008). Quantum Random Walks – New Method for Designing Quantum Algorithms. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77566-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77566-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77565-2

  • Online ISBN: 978-3-540-77566-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation