Affordable Access

Quantum Complexity of Parametric Integration

Authors
  • Wiegand, Carsten
Type
Preprint
Publication Date
Nov 11, 2003
Submission Date
May 19, 2003
Identifiers
arXiv ID: quant-ph/0305103
Source
arXiv
License
Unknown
External links

Abstract

We study parametric integration of functions from the class C^r([0,1]^{d_1+d_2}) to C([0,1]^{d_1}) in the quantum model of computation. We analyze the convergence rate of parametric integration in this model and show that it is always faster than the optimal deterministic rate and in some cases faster than the rate of optimal randomized classical algorithms.

Report this publication

Statistics

Seen <100 times