←Created page with ''''Continuous Quantum Computation''' Two major motivations for studying continuous quantum computation are: * Many scientific problems have continuous mathematical...'
'''Continuous Quantum Computation''' Two major motivations for studying continuous quantum computation are:
* Many scientific problems have continuous mathematical formulations. Exaples of such formulations are
** Path integration
** [[Feynman-Kac]] path integration
** [[Schrödinger]] equation
* In their standard monograph Nielsen and Chuang state "Of particular interest is a decisive answer to the problem whether quantum computers are more powerful than classical computers." To answer this question one must know the classical and quantum computationsl complexities
In the section An Example: Path Integration solving a continuous problem on a quantum computer will be discussed. Here the second motivation will be amplified. By computational complexity (complexity for brevity) is meant the '''minimal''' computationsl resources needed to solve a problem
