The quantum query complexity of elliptic PDE (Q855898)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The quantum query complexity of elliptic PDE |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quantum query complexity of elliptic PDE |
scientific article |
Statements
The quantum query complexity of elliptic PDE (English)
0 references
7 December 2006
0 references
For an elliptic partial differential equation (PDE) \(Lu = f\) on a bounded domain \(\Omega\) with homogeneous boundary conditions, suppose that one knows the Green's function \(k(x, y)\) such that \(u(x) = \int_\Omega f(y) k(x, y)\, dy\). The author obtains estimates of the complexity of computing such integrals using a Monte Carlo quadrature method on a quantum computer.
0 references
Monte Carlo quadrature
0 references
weakly singular integrals
0 references
quantum algorithm
0 references
elliptic partial differential
0 references
Green's function
0 references
0.8979987
0 references
0 references
0.8945353
0 references
0.8925412
0 references
0.88374674
0 references
0.8789701
0 references
0.8732558
0 references
0.87312144
0 references
0.8725377
0 references
