Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science in China Series A Mathematics

Optimal query error of quantum approximation on some Sobolev classes

Zhanjie Song, Peixin Ye

Published Aug 6, 2008• 2 citations
Publisher
DOI
10.1007/s11425-008-0077-0

Related papers

Quantum Integration Error for Some Sobolev Classes

Peixin Ye, Hu Xiaofei

Lecture notes in computer science•Jan 1, 2006•2 citations

Lower bound for quantum integration error on anisotropic Sobolev classes

Peixin Ye

Acta Mathematica Sinica English Series•Feb 12, 2010•1 citation

Optimal error bound of restricted Monte Carlo integration on anisotropic Sobolev classes

Gao, Wenhua, Ye +3 more

Progress in Natural Science Materials International•Jan 1, 2006•3 citations

Monte Carlo Approximation and Integration for Sobolev Classes

Yuan Xiuhua, Peixin Ye

Communications in computer and information science•Jan 1, 2011•0 citations

Lower Bound for Quantum Integration Error on Some Sobolev Classes

Peixin Ye

We study the approximation of the integration of multivariate functions in the quantum model of computation. Using a new reduction approach we obtain a lower bound of the n-th minimal query error on anisotropic Sobolev classes B(Wpr([0, 1]d)), (r isin R+d). Then combining our previous results we determine the optimal bound of nth minimal query error for anisotropic Holder-Nikolskii class B(Hinfinr([0, 1]d)), (r isin R+d) and Sobolev class B(Wpr([0, 1]d)) (r isin Nd). The results show the quantum algorithms give speed up over classical algorithms.

International Conference on Natural Computation (ICNC)•Jan 1, 2008•0 citations

Quantum approximation II. Sobolev embeddings

Stefan Heinrich

arXiv:quant-ph/0305031•Journal of Complexity•Nov 15, 2003•42 citations
We study the approximation of the integration of multivariate functions in the quantum model of computation. Using a new reduction approach we obtain a lower bound of the n-th minimal query error on anisotropic Sobolev classes B(Wpr([0, 1]d)), (r isin R+d). Then combining our previous results we determine the optimal bound of nth minimal query error for anisotropic Holder-Nikolskii class B(Hinfinr([0, 1]d)), (r isin R+d) and Sobolev class B(Wpr([0, 1]d)) (r isin Nd). The results show the quantum algorithms give speed up over classical algorithms.