Quantum complexity of parametric integration

  • Authors:

  • Carsten Wiegand

  • Affiliations:

  • Fachbereich Informatik, Universität Kaiserslautern, D-67653 Kaiserslautern, Germany

  • Venue:
  • Journal of Complexity
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study parametric integration of functions from the class Cr([0, 1]d1+d2) to C([0, 1]d1) 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.