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

Journal of Complexity

Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square

Tino Ullrich

Published Sep 27, 2013• 14 citations
Publisher
DOI
10.1016/j.jco.2013.09.001

Related papers

Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball

Jiansong Li, Heping Wang

arXiv:2201.06709•Journal of Complexity•Jul 5, 2022•5 citations

Exact cubature for a class of functions of maximum effective dimension

Shu Tezuka, Anargyros Papageorgiou

Journal of Complexity•Jun 14, 2006•2 citations

Adaptive Quasi-Monte Carlo Methods for Cubature

Fred J. Hickernell, Lluís Antoni Jiménez Rugama, Da Li

arXiv:1702.01491•Springer eBooks•Jan 1, 2018•14 citations

Lower and upper bounds for the error of optimal cubature in Besov spaces of mixed smoothness

Ðinh Dũng, Tino Ullrich

We prove lower bounds for the error of optimal cubature formulas for $d$-variate functions from Besov spaces of mixed smoothness $B^{\alpha}_{p,\theta}({\mathbb G}^d)$ in the case $0 1/p$, and upper bounds for QMC methods on the Fibonacci lattice for two-variate periodic functions from $B^{\alpha}_{p,\theta}({\mathbb G}^2)$ in the case $1\leq p \leq \infty$, $0 1/p$, where ${\mathbb G}^d$ is either the $d$-dimensional torus ${\mathbb T}^d$ or the $d$-dimensional cube $[0,1]^d$. In combination these results yield the correct asymptotic of the error of optimal cubature formulas for functions from $B^{\alpha}_{p,\theta}({\mathbb G}^2)$ and indicate that a corresponding results is most likely also true in case $d>2$. This is compared to the obtained correct asymptotic of optimal cubature formulas on Smolyak grids which results in the observation that any cubature formula on Smolyak grids is never optimal for the general setting.

arXiv:1311.1563•Nov 7, 2013•0 citations

Quantum integration in Besov spaces with mixed smoothness

Bernd Käßemodel, Tino Ullrich

We study the complexity of high-dimensional integration of periodic functions from Besov spaces $S^r_{p,q}B(\mathbb{T}^d)$ with mixed smoothness in the quantum model of computation. We construct new quantum algorithms based on the multivariate Faber-Schauder decomposition of such functions and analyze their convergence rates. We show a gain of one convergence order compared to the well-known deterministic rates of convergence. We additionally obtain lower bounds showing the optimality of our results up to logarithms.

arXiv:2610.17204•Oct 12, 2026•0 citations

Optimal confidence for Monte Carlo integration of smooth functions

Robert J. Kunsch, Daniel Rudolf

arXiv:1809.09890•Advances in Computational Mathematics•Nov 29, 2019•16 citations
We prove lower bounds for the error of optimal cubature formulas for ddd-variate functions from Besov spaces of mixed smoothness Bp,θα(Gd)B^{\alpha}_{p,\theta}({\mathbb G}^d)Bp,θα​(Gd) in the case 01/p0 1/p01/p, and upper bounds for QMC methods on the Fibonacci lattice for two-variate periodic functions from Bp,θα(G2)B^{\alpha}_{p,\theta}({\mathbb G}^2)Bp,θα​(G2) in the case 1≤p≤∞1\leq p \leq \infty1≤p≤∞, 01/p0 1/p01/p, where Gd{\mathbb G}^dGd is either the ddd-dimensional torus Td{\mathbb T}^dTd or the ddd-dimensional cube [0,1]d[0,1]^d[0,1]d. In combination these results yield the correct asymptotic of the error of optimal cubature formulas for functions from Bp,θα(G2)B^{\alpha}_{p,\theta}({\mathbb G}^2)Bp,θα​(G2) and indicate that a corresponding results is most likely also true in case d>2d>2d>2. This is compared to the obtained correct asymptotic of optimal cubature formulas on Smolyak grids which results in the observation that any cubature formula on Smolyak grids is never optimal for the general setting.
We study the complexity of high-dimensional integration of periodic functions from Besov spaces Sp,qrB(Td)S^r_{p,q}B(\mathbb{T}^d)Sp,qr​B(Td) with mixed smoothness in the quantum model of computation. We construct new quantum algorithms based on the multivariate Faber-Schauder decomposition of such functions and analyze their convergence rates. We show a gain of one convergence order compared to the well-known deterministic rates of convergence. We additionally obtain lower bounds showing the optimality of our results up to logarithms.