Physics – Quantum Physics
Scientific paper
2007-12-07
Physics
Quantum Physics
32 pages, 2 figures
Scientific paper
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two major motivations for studying quantum algorithms and complexity for continuous problems. 1. Are quantum computers more powerful than classical computers for important scientific problems? How much more powerful? 2. Many important scientific and engineering problems have continuous formulations. To answer the first question we must know the classical computational complexity of the problem. Knowing the classical complexity of a continuous problem we obtain the quantum computation speedup if we know the quantum complexity. If we know an upper bound on the quantum complexity through the cost of a particular quantum algorithm then we can obtain a lower bound on the quantum speedup. Regarding the second motivation, in this article we'll report on high-dimensional integration, path integration, Feynman path integration, the smallest eigenvalue of a differential equation, approximation, partial differential equations, ordinary differential equations and gradient estimation. We'll also briefly report on the simulation of quantum systems on a quantum computer.
Papageorgiou Anargyros
Traub Joseph F.
No associations
LandOfFree
Quantum Algorithms and Complexity for Continuous 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 Quantum Algorithms and Complexity for Continuous Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Algorithms and Complexity for Continuous Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-121149