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

SpringerBriefs in mathematical physics

Error Bounds for Smooth Correlations

Emil V. Prodan

Published Jan 1, 2017• 1 citation
Publisher
DOI
10.1007/978-3-319-55023-7_6

Related papers

One-Shot Distributed Source Simulation: As Quantum as It Can Get

Ian George, Min-Hsiu Hsieh, Eric Chitambar

Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some target correlation. Wyner’s seminal result showed that asymptotically the rate of uniform shared randomness needed for this task is given by a mutual information induced measure, now referred to as Wyner’s common information. This asymptotic result was extended by Hayashi in the quantum setting to separable states, the largest class of states for which this task can be performed to vanishing error. In this work we characterize this task in a near-tight manner in the one-shot setting using the smooth entropy framework. We do this by introducing one-shot operational quantities and correlation measures that characterize them. We establish asymptotic equipartition properties for our correlation measures thereby recovering the previous vanishing-error asymptotic results. In doing so, we consider technical points in one-shot network information theory and provide methods for cardinality bounds in the smooth entropy calculus. We also introduce entangled state versions of the distributed source simulation task and determine bounds in this setting via quantum embezzling. This provides a strong characterization of this network task in the one-shot, quantum regime.

arXiv:2301.04301•IEEE Transactions on Information Theory•Oct 23, 2025•10 citations

Error Bounds for Expectation Values

Norman W. Bazley, David W. Fox

Reviews of Modern Physics•Jul 1, 1963•50 citations

Error estimates on averages of correlated data

Henrik Flyvbjerg

Springer eBooks•Apr 6, 2008•721 citations

Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands

Josef Dick

We study a random sampling technique to approximate integrals ∫[0, 1]s f(x) dx by averaging the function at some sampling points. We focus on cases where the integrand is smooth, which is a problem which occurs in statistics. The convergence rate of the approximation error depends on the smoothness of the function f and the sampling technique. For instance, Monte Carlo (MC) sampling yields a convergence of the root mean square error (RMSE) of order N−1/2 (where N is the number of samples) for functions f with finite variance. Randomized QMC (RQMC), a combination of MC and quasi-Monte Carlo (QMC), achieves a RMSE of order N−3/2+ε under the stronger assumption that the integrand has bounded variation. A combination of RQMC with local antithetic sampling achieves a convergence of the RMSE of order N−3/2−1/s+ε (where s ≥ 1 is the dimension) for functions with mixed partial derivatives up to order two. Additional smoothness of the integrand does not improve the rate of convergence of these algorithms in general. On the other hand, it is known that without additional smoothness of the integrand it is not possible to improve the convergence rate. This paper introduces a new RQMC algorithm, for which we prove that it achieves a convergence of the root mean square error (RMSE) of order N−α−1/2+ε provided the integrand satisfies the strong assumption that it has square integrable partial mixed derivatives up to order α > 1 in each variable. Known lower bounds on the RMSE show that this rate of convergence cannot be improved in general for integrands with this smoothness. We provide numerical examples for which the RMSE converges approximately with order N−5/2 and N−7/2, in accordance with the theoretical upper bound.

arXiv:1007.0842•The Annals of Statistics•May 4, 2011•48 citations

A theorem in dynamics of correlations

Françoise Hénin

Physica•Sep 1, 1971•19 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
Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some target correlation. Wyner’s seminal result showed that asymptotically the rate of uniform shared randomness needed for this task is given by a mutual information induced measure, now referred to as Wyner’s common information. This asymptotic result was extended by Hayashi in the quantum setting to separable states, the largest class of states for which this task can be performed to vanishing error. In this work we characterize this task in a near-tight manner in the one-shot setting using the smooth entropy framework. We do this by introducing one-shot operational quantities and correlation measures that characterize them. We establish asymptotic equipartition properties for our correlation measures thereby recovering the previous vanishing-error asymptotic results. In doing so, we consider technical points in one-shot network information theory and provide methods for cardinality bounds in the smooth entropy calculus. We also introduce entangled state versions of the distributed source simulation task and determine bounds in this setting via quantum embezzling. This provides a strong characterization of this network task in the one-shot, quantum regime.
We study a random sampling technique to approximate integrals ∫[0, 1]s f(x) dx by averaging the function at some sampling points. We focus on cases where the integrand is smooth, which is a problem which occurs in statistics. The convergence rate of the approximation error depends on the smoothness of the function f and the sampling technique. For instance, Monte Carlo (MC) sampling yields a convergence of the root mean square error (RMSE) of order N−1/2 (where N is the number of samples) for functions f with finite variance. Randomized QMC (RQMC), a combination of MC and quasi-Monte Carlo (QMC), achieves a RMSE of order N−3/2+ε under the stronger assumption that the integrand has bounded variation. A combination of RQMC with local antithetic sampling achieves a convergence of the RMSE of order N−3/2−1/s+ε (where s ≥ 1 is the dimension) for functions with mixed partial derivatives up to order two. Additional smoothness of the integrand does not improve the rate of convergence of these algorithms in general. On the other hand, it is known that without additional smoothness of the integrand it is not possible to improve the convergence rate. This paper introduces a new RQMC algorithm, for which we prove that it achieves a convergence of the root mean square error (RMSE) of order N−α−1/2+ε provided the integrand satisfies the strong assumption that it has square integrable partial mixed derivatives up to order α > 1 in each variable. Known lower bounds on the RMSE show that this rate of convergence cannot be improved in general for integrands with this smoothness. We provide numerical examples for which the RMSE converges approximately with order N−5/2 and N−7/2, in accordance with the theoretical upper bound.
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.