|
| related topics |
| {algorithm, log, probability} |
| {let, theorem, proof} |
| {qubit, qubits, gate} |
| {measurement, state, measurements} |
| {cos, sin, state} |
|
On a Problem in Quantum Summation
Stefan Heinrich, Erich Novak
abstract: We consider the computation of the mean of sequences in the quantum model of
computation. We determine the query complexity in the case of sequences which
satisfy a $p$-summability condition for $1\le p<2$. This settles a problem left
open in Heinrich (2001).
- oai_identifier:
- oai:arXiv.org:quant-ph/0109038
- categories:
- quant-ph
- comments:
- 21 pages, paper submitted to the Journal of Complexity
- arxiv_id:
- quant-ph/0109038
- created:
- 2001-09-07
Full article ▸
|
|
| related documents |
| 0210141v2 |
| 0011052v2 |
| 0305031v1 |
| 0008095v3 |
| 0306042v1 |
| 0609220v1 |
| 0302022v1 |
| 0606077v1 |
| 0609166v1 |
| 0603206v1 |
| 0309057v1 |
| 0303074v1 |
| 9706003v4 |
| 0305005v1 |
| 0208130v1 |
| 0609160v1 |
| 0207108v1 |
| 0508156v3 |
| 0411027v1 |
| 0206169v2 |
| 0403071v1 |
| 0406226v1 |
| 0312164v1 |
| 0304013v1 |
| 0208112v1 |
|