BibTeX
@ARTICLE{Novak01quantumcomplexity,
author = {Erich Novak},
title = { Quantum complexity of integration},
journal = {J. COMPLEXITY},
year = {2001},
pages = {2--16}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical Hölder classes F k,α d on [0, 1] d and define γ by γ = (k + α)/d. The known optimal orders for the complexity of deterministic and (general) randomized methods are and comp(F k,α
