Tractability of approximation for weighted Korobov spaces on classical and quantum computers

From MaRDI portal
Publication:1885382

DOI10.1007/s10208-002-0074-6zbMath1072.81014arXivquant-ph/0206023OpenAlexW2036017515WikidataQ57636032 ScholiaQ57636032MaRDI QIDQ1885382

Ian H. Sloan, Erich Novak, Henryk Woźniakowski

Publication date: 28 October 2004

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0206023




Related Items

\(\mathbb{L}_\infty\)-approximation in Korobov spaces with exponential weightsApproximation in Hermite spaces of smooth functionsSpline methods using integration lattices and digital netsLattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case settingNon-linear approximation of functions with mixed smoothness by sets of finite pseudo-dimensionTractability of \(\mathbb{L}_2\)-approximation in hybrid function spacesEC-\((t_1,t_2)\)-tractability of approximation in weighted Korobov spaces in the worst case settingA fast algorithm for approximating the ground state energy on a quantum computerAn exact order of discrepancy of the Smolyak grid and some general conclusions in the theory of numerical integrationIan Sloan and Lattice RulesApplications of Smolyak quadrature formulas to the numerical integration of Fourier coefficients and in function recovery problemsApproximation of analytic functions in Korobov spacesThe complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methodsMultivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spacesFast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weightsLattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernelsTractability of approximation in the weighted Korobov space in the worst-case setting -- a complete pictureLattice rule algorithms for multivariate approximation in the average case settingOn the representation of smooth functions on the sphere using finitely many bitsOptimal query error of quantum approximation on some Sobolev classesThe information-based complexity of approximation problem by adaptive Monte Carlo methodsOn the power of standard information for multivariate approximation in the worst case settingLower bound for quantum phase estimationStrang Splitting in Combination with Rank-1 and Rank-r Lattices for the Time-Dependent Schrödinger EquationLattice algorithms for multivariate approximation in periodic spaces with general weight parametersOn the approximation of smooth functions using generalized digital netsThe power of standard information for multivariate approximation in the randomized setting