Randomized and Quantum Algorithms Yield a Speed-Up for Initial-Value Problems

Details Randomized and Quantum Algorithms Yield a Speed-Up for Initial-Value Problems Randomized and Quantum Algorithms Yield a Speed-Up for Initial-Value Problems

2003-11-21

arxiv.org/abs/quant-ph/0311148v1

Journal of Complexity 20 (2004) 821-834

Physics

Quantum Physics

LaTeX v. 2.09, 13 pages

Scientific paper

Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers with respect to deterministic and randomized algorithms on a classical computer. In this paper we deal with the randomized and quantum complexity of initial-value problems. For this nonlinear problem, we show that both randomized and quantum algorithms yield a speed-up over deterministic algorithms. Upper bounds on the complexity in the randomized and quantum settings are shown by constructing algorithms with a suitable cost, where the construction is based on integral information. Lower bounds result from the respective bounds for the integration problem.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112991