Quantum Complexity of Parametric Integration

Simple item page
dc.creatorWiegand, Carsten
dc.date2003-05-19
dc.date2003-11-11
dc.date.accessioned2026-07-07T06:06:47Z
dc.date.available2026-07-07T06:06:47Z
dc.descriptionWe 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.
dc.descriptionPaper submitted to the Journal of Complexity, 28 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0305103
dc.identifierhttp://arxiv.org/abs/quant-ph/0305103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91101
dc.subjectQuantum Physics
dc.titleQuantum Complexity of Parametric Integration
dc.typetext

Files

Collections

arXiv