Physics – Quantum Physics
Scientific paper
2005-12-27
Physics
Quantum Physics
45 pages, submitted to the Journal of Complexity
Scientific paper
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)}.
No associations
LandOfFree
The Quantum Query Complexity of Elliptic PDE does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Quantum Query Complexity of Elliptic PDE, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Quantum Query Complexity of Elliptic PDE will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-291256