Continuous quantum computation: Difference between revisions

Revision as of 16:10, 22 August 2009

Revision as of 01:32, 20 December 2010

Line 1:

{{ArticleMultiple issues|orphan =February 2009|essay =August 2009|notability =August 2009|context =August 2009}}

Two major motivations for studying '''continuous quantum computation''' are:

Line 6:

** [[Path Integral Formulation|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 computational complexities

Line 26:

*Bessen, A. J. (2005), A lower bound for phase estimation, Physical Review A, 71(4), 042313. Also http://arXiv.org/quant-ph/0412008.

*Heinrich, S. (2002), Quantum Summation with an Application to Integration, J. Complexity, 18(1), 1–50. Also http://arXiv.org/quant-ph/0105116.

*Heinrich, S. (2003), Quantum integration in Sobolev spaces, J. Complexity, 19, 19–42.

*Heinrich, S. (2004), Quantum Approximation I. Embeddings of Finite Dimensional <math>L_p</math> Spaces, J. Complexity, 20, 5–26. Also http://arXiv.org/quant-ph/0305030.

*Heinrich, S. (2004), Quantum Approximation II. Sobolev Embeddings, J. Complexity, 20, 27–45. Also http://arXiv.org/quant-ph/0305031.