dorsal/arxiv
View SchemaQuantum Complexity of Parametric Integration
| Authors | Carsten Wiegand |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0305103 |
| URL | https://arxiv.org/abs/quant-ph/0305103 |
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.
{
"annotation_id": "9623f858-562b-4de7-9962-3a69d1ec86f2",
"date_created": "2026-03-02T18:01:59.816000Z",
"date_modified": "2026-03-02T18:01:59.816000Z",
"file_hash": "f3ec213c3068a89a265b5f68fa311f6688eef1447e6a1cbbd2c297a0959cb6c2",
"private": false,
"record": {
"abstract": "We study parametric integration of functions from the class\nC^r([0,1]^{d_1+d_2}) to C([0,1]^{d_1}) in the quantum model of computation. We\nanalyze the convergence rate of parametric integration in this model and show\nthat it is always faster than the optimal deterministic rate and in some cases\nfaster than the rate of optimal randomized classical algorithms.",
"arxiv_id": "quant-ph/0305103",
"authors": [
"Carsten Wiegand"
],
"categories": [
"quant-ph"
],
"title": "Quantum Complexity of Parametric Integration",
"url": "https://arxiv.org/abs/quant-ph/0305103"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a9282fd1-26da-4330-a07f-690dc7d7d732",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}