Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms

Details Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms

2005-10-06

arxiv.org/abs/quant-ph/0510045v2

Journal of Complexity 22 (2006), 676-690

Physics

Quantum Physics

16 pages, minor presentation changes

Scientific paper

We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These algorithms yield new upper complexity bounds, which differ from known lower bounds by only an arbitrarily small positive parameter in the exponent, and a logarithmic factor. In both the randomized and quantum settings, initial-value problems turn out to be essentially as difficult as scalar integration.

Affiliated with

Also associated with

No associations

Rating

Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms 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 Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-324320