Skip to main content

Quantum Integration Error on Some Classes of Multivariate Functions

  • Conference paper
  • 967 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 2))

Abstract

We study the approximation of the integration of multivariate functions classes in the quantum model of computation. We first obtain a lower bound of the n-th minimal query error for integration on anisotropic Sobolev-Slobodezkii classes. Then combining our previous results we determine the optimal bound of n-th minimal query error for anisotropic Hölder-Nikolskii class and Sobolev class. The results show that for these two type of classes the quantum algorithms give significant speed up over classical deterministic and randomized algorithms.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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. Fang, G.S., Ye, P.X.: Integration Error for Multivariate Functions from Anisotropic Classes. J. Complexity 19, 610–627 (2003)

    Article  Google Scholar 

  2. Grover, L.: A framework for Fast Quantum Mechanical Algorithms. In: Proceedings of the 30th Annual ACM Symposium on the theory of Computing, pp. 53–62. ACM Press, New York (1998)

    Google Scholar 

  3. Heinrich, S.: Random Approximation in Numerical Analysis. In: Bierstedt, K.D., Pietsch, A., Ruess, W.M., Vogt, D. (eds.) Function Analysis, pp. 123–171. Marcel Dekker, New York (1993)

    Google Scholar 

  4. Heinrich, S., Novak, E.: On a Problem in Quantum Summation. J. Complexity 18, 1–18 (2003)

    Article  Google Scholar 

  5. Heinrich, S.: Quantum Integration in Sobolev Classes. J. Complexity 19, 19–42 (2003)

    Article  MATH  Google Scholar 

  6. Hu, X.F., Ye, P.X.: Quantum Complexity of the Integration Problem for Anisotropic Classes. J. Comput. Math. 23(3), 233–246 (2005)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  8. Nikolskii, S.M.: Approximation of Functions of several Variables and Imbedding Theorems. Springer, Heidelberg (1975)

    Google Scholar 

  9. Novak, E.: Quantum Complexity of Integration. J. Complexity 17, 2–16 (2001)

    Article  MATH  Google Scholar 

  10. Shor, P.W.: Introduction to Quantum Computing Algorithms. Birkhauser, Bonston (1999)

    Google Scholar 

  11. Temlyakov, V.N.: pproximation of Periodic Functions. Nova Science, New York (1993)

    Google Scholar 

  12. Xin, Y.P., Xiaofei, H.: Quantum Integration Error for some Sobolev Classes. In: Jiao, L., Wang, L., Gao, X., Liu, J., Wu, F. (eds.) ICNC 2006. LNCS, vol. 4222, pp. 10–19. Springer, Heidelberg (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

De-Shuang Huang Laurent Heutte Marco Loog

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ye, P., He, Q. (2007). Quantum Integration Error on Some Classes of Multivariate Functions. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Contemporary Intelligent Computing Techniques. ICIC 2007. Communications in Computer and Information Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74282-1_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74282-1_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74281-4

  • Online ISBN: 978-3-540-74282-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics