Continuous quantum computation: Difference between revisions

Revision as of 19:58, 7 March 2007

Revision as of 20:00, 7 March 2007

Line 25:

*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.

*Jaksch, P. and Papageorgiou, A. (2003), Eigenvector approximation leading to exponential speedup of quantum eigenvalue calculation, Phys. Rev. Lett., 91, 257902. Also http://arXiv.org/quant-ph/0308016.

Line 40 ⟶ 41:

[[Category:Computer science|Continuous Quantum Computation]]

[[Category:Information-Based Complexity |Continuous Quantum Computation]]

[[Category:Quantum information science|Continuous Quantum Computation]]

[[Category:Scientific Computing|Continuous Quantum Computation]]

[[Category:Algorithms |Continuous Quantum Computation]]