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… 
QUANTUM APPROXIMATION ON ANISOTROPIC SOBOLEV AND HÖLDER-NIKOLSKII CLASSES
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
Tractability of $\mathbb{L}_2$-approximation in hybrid function spaces
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
TLDR
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
TLDR
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.
Quantum Approximation Error on Some Sobolev Classes
  • Peixin Ye
  • Computer Science, Physics
    Third International Conference on Natural Computation (ICNC 2007)
  • 2007
TLDR
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
TLDR
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 36 REFERENCES
Tractability of Multivariate Integration for Periodic Functions
TLDR
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
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
TLDR
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
TLDR
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 Amplitude Amplification and Estimation
Consider a Boolean function $\chi: X \to \{0,1\}$ that partitions set $X$ between its good and bad elements, where $x$ is good if $\chi(x)=1$ and bad otherwise. Consider also a quantum algorithm
Quantum Summation with an Application to Integration
TLDR
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
TLDR
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
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
TLDR
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
TLDR
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.
...
...