Skip to main content
SpringerLink
Log in
Book cover

International Conference on Large-Scale Scientific Computing

LSSC 2005: Large-Scale Scientific Computing pp 28–39Cite as

Numerical Analysis on a Quantum Computer

  • Conference paper

  • 1900 Accesses

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

Abstract

We give a short introduction to quantum computing and its relation to numerical analysis. We survey recent research on quantum algorithms and quantum complexity theory for two basic numerical problems — high dimensional integration and approximation. Having matching upper and lower complexity bounds for the quantum setting, we are in a position to compare them with those for the classical deterministic and randomized setting, previously obtained in information-based complexity theory. This enables us to assess the possible speedups quantum computation could provide over classical deterministic or randomized algorithms for these numerical problems.

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. Aharonov, D.: Quantum computation — a review. In: Stauffer, D. (ed.) Annual Review of Computational Physics, vol. VI, World Scientific, Singapore (1998), http://arXiv.org/abs/quant-ph/9812037

    Google Scholar 

  2. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by Polynomials. In: Proceedings of 39th IEEE FOCS, 352–361 (1998), http://arXiv.org/abs/quant-ph/9802049

  3. Boyer, M., Brassard, P., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46, 493–505 (1998), http://arXiv.org/abs/quantph/9605034

    Article  Google Scholar 

  4. Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume. AMS Contemporary Mathematics Series 305 (2002), http://arXiv.org/abs/quant-ph/0005055

  5. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond., Ser. A 400, 97–117 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ekert, A., Hayden, P., Inamori, H.: Basic concepts in quantum computation (2000), http://arXiv.org/abs/quant-ph/0011013

  7. Feynman, R.: Simulating physics with computers. Int. J. Theor. 21, 467–488 (1982)

    Article  MathSciNet  Google Scholar 

  8. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proc. 28 Annual ACM Symp. on the Theory of Computing, pp. 212–219. ACM Press, New York (1996), http://arXiv.org/abs/quant-ph/9605043

    Google Scholar 

  9. Gruska, J.: Quantum Computing. McGraw-Hill, New York (1999)

    Google Scholar 

  10. Heinrich, S.: Random approximation in numerical analysis. In: Bierstedt, K.D., Pietsch, W.M.R., Vogt, D. (eds.) Functional Analysis, pp. 123–171. Marcel Dekker, New York (1993)

    Google Scholar 

  11. Heinrich, S.: Quantum summation with an application to integration. J. Complexity 18, 1–50 (2002), http://arXiv.org/abs/quant-ph/0105116

    Article  MATH  MathSciNet  Google Scholar 

  12. Heinrich, S.: Quantum integration in Sobolev classes. J. Complexity 19, 19–42 (2003), http://arXiv.org/abs/quant-ph/0112153

    Article  MATH  MathSciNet  Google Scholar 

  13. Heinrich, S.: Quantum Approximation I. Embeddings of Finite Dimensional Lp Spaces, J. Complexity 20, 5–26 (2004), http://arXiv.org/abs/quantph/0305030

    MATH  MathSciNet  Google Scholar 

  14. Heinrich, S.: Quantum Approximation II. Sobolev Embeddings, J. Complexity 20, 27–45 (2004), http://arXiv.org/abs/quant-ph/0305031

    MATH  MathSciNet  Google Scholar 

  15. Heinrich, S.: The quantum query complexity of elliptic PDE (in preparation)

    Google Scholar 

  16. Heinrich, S., Novak, E.: On a problem in quantum summation. J. Complexity 19, 1–18 (2003), http://arXiv.org/abs/quant-ph/0109038

    Article  MATH  MathSciNet  Google Scholar 

  17. Kacewicz, B.: Randomized and quantum algorithms yield a speed-up for initial-value problems. J. Complexity 20, 821–834 (2004), http://arXiv.org/abs/quant-ph/0311148

    Article  MATH  MathSciNet  Google Scholar 

  18. Kacewicz, B.: Improved bounds on the randomized and quantum complexity of initial-value problems, http://arXiv.org/abs/quant-ph/0405018

  19. Kwas, M.: Complexity of multivariate Feynman-Kac path integration in randomized and quantum settings, http://arXiv.org/abs/quant-ph/0410134

  20. Maiorov, V.E.: Discretization of the problem of diameters. Usp. Mat. Nauk 30(6), 179–180 (1975) (in Russian)

    MATH  MathSciNet  Google Scholar 

  21. Manin, Y.I.: Computable and uncomputable. Sovetskoye Radio, Moscow (1980) (in Russian)

    Google Scholar 

  22. Manin, Y.I.: Classical computing, quantum computing, and Shor’s factoring algorithm (1999), http://arXiv.org/abs/quant-ph/9903008

  23. Nayak, A., Wu, F.: The quantum query complexity of approximating the median and related statistics. In: STOC, May 1999, pp. 384–393 (1999), http://arXiv.org/abs/quantph/ 9804066

    Google Scholar 

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

    MATH  Google Scholar 

  25. Novak, E.: Deterministic and Stochastic Error Bounds in Numerical Analysis. Lecture Notes in Mathematics, vol. 1349. Springer, Berlin (1988)

    MATH  Google Scholar 

  26. Novak, E.: Quantum complexity of integration. J. Complexity 17, 2–16 (2001), http://arXiv.org/abs/quant-ph/0008124

    Article  MATH  MathSciNet  Google Scholar 

  27. Novak, E., Sloan, I.H., Woźniakowski, H.: Tractability of approximation for weighted Korobov spaces on classical and quantum computers. Found. Comput. Math. 4, 121–156 (2004), http://arXiv.org/abs/quant-ph/0206023

    Article  MATH  MathSciNet  Google Scholar 

  28. Papageorgiou, A., Woźniakowski, H.: Classical and quantum complexity of the Sturm-Liouville eigenvalue problem, http://arXiv.org/abs/quant-ph/0502054

  29. Pietsch, A.: Eigenvalues and s-Numbers. Cambridge University Press, Cambridge (1987)

    MATH  Google Scholar 

  30. Pittenger, A.O.: Introduction to Quantum Computing Algorithms. Birkhauser, Boston (1999)

    Google Scholar 

  31. Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 124–134. IEEE Computer Society Press, Los Alamitos (1994), http://arXiv.org/abs/quant-ph/9508027

    Chapter  Google Scholar 

  32. Shor, P.W.: Introduction to quantum algorithms (2000), http://arXiv.org/abs/quant-ph/0005003

  33. Traub, J.F., Woźniakowski, H.: Path integration on a quantum computer. Quantum Information Processing 1 5, 365–388 (2002), http://arXiv.org/abs/quantph/0109113

    Article  Google Scholar 

  34. Traub, J.F., Wasilkowski, G.W., Woźniakowski, H.: Information-Based Complexity. Academic Press, New York (1988)

    MATH  Google Scholar 

  35. Wiegand, C.: Quantum complexity of parametric integration. J. Complexity 20, 75–96 (2004), http://arXiv.org/abs/quant-ph/0305103

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, D-67653, Kaiserslautern, Germany

    Stefan Heinrich

Authors
  1. Stefan Heinrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bonchev, Bl. 25A, 1113, Sofia, Bulgaria

    Ivan Lirkov

  2. Institute for Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bonchev Str. Bl. 25-A, 1113, Sofia, Bulgaria

    Svetozar Margenov

  3. Informatics & Mathematical Modeling, Technical University of Denmark, DK-2800, Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heinrich, S. (2006). Numerical Analysis on a Quantum Computer. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2005. Lecture Notes in Computer Science, vol 3743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11666806_3

Download citation

  • DOI: https://doi.org/10.1007/11666806_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31994-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation