Convergence rate of quantum algorithm for multivariate approximation


We estimate the convergence rate of quantum algorithm for approximation from some smooth functions in the L<inf>q</inf>([0, 1]<sup>d</sup>) norm for 1 ≤ q ≤ ∞. It turns out that for the Sobolev class B(W<inf>p</inf><sup>r</sup> ([0, 1]<sup>d</sup>)) (r ∈ ℕ<sup>d</sup>), when p < q, the quantum algorithms can bring speedup over classical deterministic and… (More)
DOI: 10.1109/ICNC.2010.5582913


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics