Skip to main content
SpringerLink
Log in

Introduction to Recent Quantum Algorithms

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2136))

Abstract

We discuss some of the recent progress in quantum algorithmics. We review most of the primary techniques used in proving upper and lower bounds and illustrate how to apply the techniques to a variety of problems, including the threshold function, parity, searching and sorting. We also give a set of open questions and possible future research directions. Our aim is to give a basic overview and we include suggestions to further reading.

Supported in part by Canada’s NSERC and the Pacific Institute for the Mathematical Sciences.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alonso, L., Reingold, E. M., Schott, R.: Determining the majority. Information Processing Letters47 (1993) 253–255

    Article  MATH  MathSciNet  Google Scholar 

  2. Ambainis, A.: A better lower bound for quantum algorithms searching an ordered list. Proc. of 40th IEEE Symposium on Foundations of Computer Science (1999) 352–357

    Google Scholar 

  3. Ambainis, A.: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences (to appear)

    Google Scholar 

  4. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM (to appear)

    Google Scholar 

  5. Bennett, C. H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computation. SIAM Journal on Computing26 (1997) 1510–1523

    Article  MATH  MathSciNet  Google Scholar 

  6. Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing26 (1997) 1411–1473

    Article  MATH  MathSciNet  Google Scholar 

  7. Berthiaume, A.: Quantum computation. In: Hemaspaandra, L., Selman, A.L. (eds.): Complexity Theory Retrospective II. Springer-Verlag (1997) Chapter 2, 23–50

    Google Scholar 

  8. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte Der Physik46 (1998) 493–505

    Article  Google Scholar 

  9. Brassard, G., Høyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem. Proc. of 5th Israeli Symposium on Theory of Computing and Systems (1997) 12–23

    Google Scholar 

  10. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. quant-ph/0005055, 2000

    Google Scholar 

  11. Brassard, G., Høyer, P., Tapp, A.: Quantum algorithm for the collision problem. ACM SIGACT News (Cryptology Column)28 (1997) 14–19

    Article  Google Scholar 

  12. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. Proc. of 30th ACM Symposium on Theory of Computing (1998) 63–68

    Google Scholar 

  13. Buhrman, H., Cleve, R., de olf, R., Zalka, Ch.: Bounds for small-error and zero-error quantum algorithms. Proc. of 40th IEEE Symposium on Foundations of Computer Science (1999) 358–368

    Google Scholar 

  14. Buhrman, H., Dürr, C., Heiligman, M., Høyer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum algorithms for element distinctness. Proc. of 16th IEEE Computational Complexity (2001) (to appear)

    Google Scholar 

  15. Buhrman, H., De olf, R.: A lower bound for quantum search of an ordered list. Information Processing Letters70 (1999) 205–209

    Article  MATH  MathSciNet  Google Scholar 

  16. Buhrman, H., De Wolf, R.: Complexity measures and decision tree complexity: A survey. Theoretical Computer Science (to appear)

    Google Scholar 

  17. Cleve, R.: An introduction to quantum complexity theory. In: Macchiavello, C., Palma, G. M., Zeilinger, A. (eds.): Collected Papers on Quantum Computation and Quantum Information Theory. World Scientific (2000) 103–127

    Google Scholar 

  18. Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proceedings of the Royal Society of LondonA454 (1998) 339–354

    MathSciNet  Google Scholar 

  19. van Dam, W.: Quantum oracle interrogation: Getting all information for almost half the price. Proc. of 39th IEEE Symposium on Foundations of Computer Science (1998) 362–367

    Google Scholar 

  20. Deutsch, D.: Quantum computational networks. Proceedings of the Royal Society of LondonA425 (1989) 73–90

    MathSciNet  Google Scholar 

  21. Deutsch, D., Jozsa, R.: Rapid solutions of problems by quantum computation. Proceedings of the Royal Society of LondonA439 (1992) 553–558

    MathSciNet  Google Scholar 

  22. Dürr, Ch., Høyer, P.: A quantum algorithm for finding the minimum. quant-ph/9607014, 1996

    Google Scholar 

  23. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: A limit on the speed of quantum computation in determining parity. Physical Review Letters81 (1998) 5442–5444

    Article  Google Scholar 

  24. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: A limit on the speed of quantum computation for insertion into an ordered list. quant-ph/9812057, 1998

    Google Scholar 

  25. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Invariant quantum algorithms for insertion into an ordered list. quant-ph/9901059, 1999

    Google Scholar 

  26. Fortnow, L., Rogers, J.: Complexity limitations on quantum computation. Journal of Computer and System Sciences59 (1999) 240–252

    Article  MATH  MathSciNet  Google Scholar 

  27. Grover, L. K.: A fast quantum mechanical algorithm for estimating the median. quant-ph/9607024, 1996

    Google Scholar 

  28. Grover, L. K.: Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters79 (1997) 325–328

    Article  Google Scholar 

  29. Hayes, T., Kutin, S., van Melkebeek, D.: On the quantum complexity of majority. Technical Report TR-98-11, Department of Computer Science, University of Chicago (1998)

    Google Scholar 

  30. Høyer, P.: Unpublished, 1998-2000

    Google Scholar 

  31. Høyer, P., Neerbek, J., Shi, Y.: Quantum complexities of ordered searching, sorting, and element distinctness. Proc. of 28th International Colloquium on Automata, Languages and Programming (2001) (to appear)

    Google Scholar 

  32. Ivanyos, G., Magniez, F., Santha, M.: Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Proc. of 13th ACM Symposium on Parallel Algorithms and Architectures (2001) (to appear)

    Google Scholar 

  33. Nayak, A., Wu, F.: The quantum query complexity of approximating the median and related statistics. Proc. of 31st ACM Symposium on Theory of Computing (1999) 384–393

    Google Scholar 

  34. Nielsen, M. A., Chuang, I. L.: Quantum computation and quantum information. Cambridge University Press (2000)

    Google Scholar 

  35. Novak, E.: Quantum complexity of integration. Journal of Complexity17 (2001) 2–16

    Article  MATH  MathSciNet  Google Scholar 

  36. Ramesh, H., Vinay, V.: String matching in O(√n + √m) quantum time. quant-ph/0011049, 2000

    Google Scholar 

  37. Reiffel, E. G., Polak, W.: An introduction to quantum computing for non-physicists. ACM Computing Surveys32 (2000) 300–335

    Article  Google Scholar 

  38. Shor, P. W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing26 (1997) 1484–1509

    Article  MATH  MathSciNet  Google Scholar 

  39. Simon, D. R.: On the power of quantum computation. SIAM Journal on Computing26 (1997) 1474–1483

    Article  MATH  MathSciNet  Google Scholar 

  40. Tapp, A., private communication (1997)

    Google Scholar 

  41. Vazirani, U.: On the power of quantum computation. Philosophical Transactions of the Royal Society of LondonA356 (1998) 1759–1768

    Google Scholar 

  42. Zalka, Ch.: Grover’s quantum searching algorithm is optimal. Physical Review A60 (1999) 2746–2751

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive, N.W. Calgary, Alberta, Canada, T2N 1N4

    Peter Høyer

Authors
  1. Peter Høyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Høyer, P. (2001). Introduction to Recent Quantum Algorithms. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation