An extension of Gleason's theorem for quantum computation

International Journal of Theoretical Physics

Volumn 43, Issue 7-8, 2004, Pages 1827-1840

  Edalat, Abbas ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Gleason's theorem; Halting problem; Interval expected value; Quantum logic; Quantum programming language

Indexed keywords

EID: 24144498675     PISSN: 00207748     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:IJTP.0000048823.93080.7e     Document Type: Article

References (17)

1. Abramsky, S. and Coecke, B. (2003). Physical traces: Quantum versus classical information processing. Electronic Notes in Theoretical Computer Science 69, 2003.
2. Abramsky, S. and Jung, A. (1994). Domain theory. In Handbook of Logic in Computer Science, Vol. 3, S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, eds., Clarendon Press, Oxford, UK.
3. Coecke, B. and Martin, K. (2002). A partial order of classical and quantum states. Programming Research Group RR0207, Oxford University.
4. Cooke, R., Kean, M., and Moran, W. (1985). An elemantary proof of gleason's theorem. Mathematical Proceedings of the Cambridge Philosophical Society 98, 117-128. Girard, J. Y. (October, 2003). Between logic and quantic: A tract manuscript.
5. Gleason, A. M. (1957). Measures on the closed subspaces of a Hilbert space. Journal of Mathematics and Mechanics 6, 885-894, 1957.
6. Jorrand, P. and Lalire, M. Towards a quantum process algebra quant-ph/0312067.
7. Kozen, D. (1981). Semantics of probabilistic programs. Journal of Computer Systems Srience 22, 328-350.
8. Redd, M. and Simon, B. (1980). Functional Analysis, In Methods of Modern Mathematical Physics, Vol. 1, Academic Press, San Diego, CA.
9. Sanders, J. W. and Zuliani, P. (2000). Quantum computing. In Mathematics of Program Construction, Vol. 1837, lecture Notes in Computer Science, Springer, New York, pp. 80-99.
10. Selinger, P. (2003). Toward a quantum programming language. Available from http://quasar.mathstat.uottawa.ca/~selinger/papers.html, Mathematical Structures in Computer Science.
11. Thirring, W. (1979). Quantum Mechanics of Atoms and Molecules, Vol. 3, A Course in Mathematical Physics, Springer, New York.
12. Turing, A. (1936). On computable numbers with an application to the Entscheidungs problem. Proceedings of London Mathematical Society 42, 230-265.
13. Turing, A. (1937). On computable numbers with an application to the Entscheidungsproblem. Proceedings of London Mathematical Society 43, 544-546.
14. van Tonder, A. (December, 2003). A lambda calculus for quantum computation quant- ph/0307150, Siam Journal of Computing.
15. van Tonder, A. (December, 2003). Quantum computation, categorical semantics and linear logic. quant-ph/0312174.
16. Varasarajan, V. S. (1970). Geometry of Quantum Theory, Vol. 1, Van Nostrand Reinhold Company.
17. von Neumann, J. (1955). Mathematical Foundations of Quantum Mechanics, Princeton University Press, Princeton, NJ.