Skip to main content
Log in

Optimal query error of quantum approximation on some Sobolev classes

  • Published:
Science in China Series A: Mathematics Aims and scope Submit manuscript

Abstract

We study the approximation of the imbedding of functions from anisotropic and generalized Sobolev classes into L q ([0, 1]d) space in the quantum model of computation. Based on the quantum algorithms for approximation of finite imbedding from L N p to L N q , we develop quantum algorithms for approximating the imbedding from anisotropic Sobolev classes B(W r p ([0, 1]d)) to L q ([0, 1]d) space for all 1 ⩽ q,p ⩽ ∞ and prove their optimality. Our results show that for p < q the quantum model of computation can bring a speedup roughly up to a squaring of the rate in the classical deterministic and randomized settings.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Novak E. Quantum complexity of integration. J Complexity, 17: 2–16 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Novak E, Sloan I H, Woźniakowski H. Tractability of approximation for weighted Korobov spaces on classical and quantum computer. Found Comput Math, 4: 121–156 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Heinrich S. Quantum approximation I. Imbeddings of finite-dimensional L p spaces. J Complexity, 20: 5–26 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Heinrich S. Quantum approximation II. Sobolev imbeddings. J Complexity, 20: 27–45 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Temlyakov V N. Approximation of Periodic Functions. New York: Nova Science, 1993

    MATH  Google Scholar 

  6. Heinrich S. Quantum integration in Sobolev classes. J Complexity, 19: 19–42 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Grover L. A framework for fast quantum mechanical algorithms. In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing. New York: ACM Press, 1998, 53–62

    Google Scholar 

  8. Shor P W. Introduction to Quantum Computing Algorithms. Boston: Birkhäuser, 1999

    Google Scholar 

  9. Nikolskii S M. Approximation of Functions of Several Variables and Imbedding Theorems. Berlin: Springer-Verlag, 1975

    Google Scholar 

  10. Novak E. Deterministic and stochastic error bound in numerical analysis. Lecture Notes in Maths, Vol. 1349. Berlin: Springer-Verlag, 1988

    Google Scholar 

  11. Dahmen W, DeVore R, Scherer K. Multi-dimensional spline approximation. SIAM J Numer Anal, 17: 380–402 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  12. Heinrich S, Novak E. On a problem in quantum summation. J Complexity, 18: 1–18 (2003)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to PeiXin Ye.

Additional information

This work was supported by the National Natural Science Foundation of China (Grant Nos. 10501026, 60675010, 10626029 and 60572113) and the China Postdoctoral Science Foundation (Grant No. 20070420708)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Song, Z., Ye, P. Optimal query error of quantum approximation on some Sobolev classes. Sci. China Ser. A-Math. 51, 1664–1678 (2008). https://doi.org/10.1007/s11425-008-0077-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-008-0077-0

Keywords

MSC(2000)

Navigation