|
| related topics |
| {let, theorem, proof} |
| {algorithm, log, probability} |
| {equation, function, exp} |
| {information, entropy, channel} |
| {operator, operators, space} |
| {error, code, errors} |
| {measurement, state, measurements} |
|
The Quantum Query Complexity of Elliptic PDE
Stefan Heinrich
abstract: The complexity of the following numerical problem is studied in the quantum
model of computation: Consider a general elliptic partial differential equation
of order 2m in a smooth, bounded domain Q\subset \R^d with smooth coefficients
and homogeneous boundary conditions. We seek to approximate the solution on a
smooth submanifold M\subseteq Q of dimension 0\le d_1 \le d. With the right
hand side belonging to C^r(Q), and the error being measured in the L_\infty(M)
norm, we prove that the n-th minimal quantum error is (up to logarithmic
factors) of order n^{-min((r+2m)/d_1,r/d+1)}. For comparison, in the classical
deterministic setting the n-th minimal error is known to be of order n^{-r/d},
for all d_1, while in the classical randomized setting it is (up to logarithmic
factors) n^{-min((r+2m)/d_1,r/d+1/2)}.
- oai_identifier:
- oai:arXiv.org:quant-ph/0512241
- categories:
- quant-ph
- comments:
- 45 pages, submitted to the Journal of Complexity
- arxiv_id:
- quant-ph/0512241
- created:
- 2005-12-27
Full article ▸
|
|
| related documents |
| 0308142v2 |
| 0410120v1 |
| 0405081v1 |
| 9704044v1 |
| 0605239v4 |
| 0410229v1 |
| 0503159v2 |
| 0503221v2 |
| 0212096v1 |
| 0307139v1 |
| 0701143v2 |
| 0605090v1 |
| 0610235v2 |
| 0702212v1 |
| 0206023v2 |
| 0701037v2 |
| 0603206v1 |
| 0604091v1 |
| 0303055v1 |
| 0606077v1 |
| 0607148v3 |
| 0501104v4 |
| 0703069v1 |
| 0605041v4 |
| 0703061v1 |
|