# Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers

@article{Novak2004TractabilityOA, title={Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers}, author={Erich Novak and Ian H. Sloan and Henryk Wozniakowski}, journal={Foundations of Computational Mathematics}, year={2004}, volume={4}, pages={121-156} }

Abstract
We study the approximation problem (or problem of optimal recovery in the
$L_2$-norm) for weighted Korobov spaces with smoothness
parameter $\a$. The weights $\gamma_j$ of the Korobov spaces moderate
the behavior of periodic functions with respect to successive variables.
The nonnegative smoothness parameter $\a$ measures the decay
of Fourier coefficients. For $\a=0$, the Korobov space is the
$L_2$ space, whereas for positive $\a$, the Korobov space
is a space of periodic functions…

## 56 Citations

### QUANTUM APPROXIMATION ON ANISOTROPIC SOBOLEV AND HÖLDER-NIKOLSKII CLASSES

- Mathematics
- 2012

We estimate the quantum query error of approximation to functions from the anisotropic Sobolev class ${\cal B}(W_p^{\bf r}([0,1]^d))$ and the H o lder-Nikolskii class ${\cal B}(H_p^{\bf r}([0,1]^d))$…

### L∞-Approximation in Korobov spaces with exponential weights

- Mathematics, Computer ScienceJ. Complex.
- 2017

### Tractability of $\mathbb{L}_2$-approximation in hybrid function spaces

- Mathematics
- 2017

We consider multivariate $\mathbb{L}_2$-approximation in reproducing kernel Hilbert spaces which are tensor products of weighted Walsh spaces and weighted Korobov spaces. We study the minimal…

### $\boldsymbol{L}_{\infty}$-approximation in Korobov spaces with Exponential Weights

- Mathematics, Computer Science
- 2016

The notions of $\kappa$-EC-weak, EC-polynomial and EC-strong polynomial tractability, where EC stands for "exponential convergence", are defined.

### Complexity for the approximation of Sobolev imbeddings in the quantum computation model

- Computer ScienceProceedings of the 30th Chinese Control Conference
- 2011

A new and elegant reduction approach is derived that quantum algorithms bring speed-up over the classical deterministic and randomized ones and this conjecture was confirmed in the situation s = 0.

### Multivariate L∞ approximation in the worst case setting over reproducing kernel Hilbert spaces

- Mathematics, Computer ScienceJ. Approx. Theory
- 2008

### Quantum Approximation Error on Some Sobolev Classes

- Computer Science, PhysicsThird International Conference on Natural Computation (ICNC 2007)
- 2007

The results show that for p < q the quantum model of computation can bring a speedup of roughly squaring the rate of classical deterministic and randomized settings.

### Optimal query error of quantum approximation on some Sobolev classes

- Computer Science, Mathematics
- 2008

The 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.

## References

SHOWING 1-10 OF 33 REFERENCES

### Tractability of Multivariate Integration for Periodic Functions

- MathematicsJ. Complex.
- 2001

It is shown that tractability and strong tractability in the worst case setting hold under the same assumptions on the weights of the Korobov space as for the restricted classes of quadrature rules.

### Tractability of Multivariate Integration for Weighted Korobov Classes

- Mathematics, Computer ScienceJ. Complex.
- 2001

We study the worst-case error of multivariate integration in weighted Korobov classes of periodic functions of d coordinates. This class is defined in terms of weights ?j which moderate the behavior…

### Intractability Results for Integration and Discrepancy

- MathematicsJ. Complex.
- 2001

This paper proves intractability of integration (and discrepancy) if limsupd?dj=1?j/lnd=∞, as long as the weights satisfy the condition mentioned above, and introduces the notion of a decomposable kernel.

### Integration and approximation in arbitrary dimensions

- Mathematics, Computer ScienceAdv. Comput. Math.
- 2000

It is proved that integration is strongly tractable for some weighted Korobov and Sobolev spaces as well as for the Hilbert space whose reproducing kernel corresponds to the covariance function of the isotropic Wiener measure.

### Quantum Summation with an Application to Integration

- Computer ScienceJ. Complex.
- 2002

Developing quantum algorithms for computing the mean of sequences that satisfy a p-summability condition and for integration of functions from Lebesgue spaces Lp(0, 1]d, and proving lower bounds showing that the proposed algorithms are, in many cases, optimal within the setting of quantum computing.

### Path Integration on a Quantum Computer

- Computer ScienceQuantum Inf. Process.
- 2002

A lower bound is obtained for the minimal number of quantum queries which shows that this bound cannot be significantly improved, and it is proved that path integration on a quantum computer is tractable.

### Optimal Summation and Integration by Deterministic, Randomized, and Quantum Algorithms

- Mathematics
- 2002

We survey old and new results about optimal algorithms for summation of finite sequences and for integration of functions from Holder or Sobolev spaces. First we discuss optimal deterministic and…

### Quantum lower bounds by polynomials

- Computer ScienceProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

This work examines the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}/sup N/ in the black-box model and gives asymptotically tight characterizations of T for all symmetric f in the exact, zero-error, and bounded-error settings.

### Complexity of Linear Problems with a Fixed Output Basis

- Mathematics, Computer ScienceJ. Complex.
- 2000

This work uses an information-based complexity approach to study the complexity of approximation of linear operators, and shows examples of linear problems where a significant output data compression is possible by the use of a nonlinear algorithm, and this non linear algorithm is much better than all linear algorithms.

### Weighted Tensor Product Algorithms for Linear Multivariate Problems

- Mathematics, Computer ScienceJ. Complex.
- 1999

It is shown that these multivariate problems defined over weighted tensor product Hilbert spaces of functions f of d variables are sometimes tractable even with a worst-case assurance.