Game semantics for quantum data. (English) Zbl 1347.68212
Coecke, Bob (ed.) et al., Proceedings of the 5th international workshop on quantum physics and logic and the 4th workshop on developments in computational models (QPL/DCM 2008), Reykjavik, Iceland, July 12–13, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 270, No. 1, 41-57 (2011).
Summary: This paper presents a game semantics for a simply-typed \(\lambda\)-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode any quantum circuit. The language uses a notion of extended variable, similar to that seen in functional languages with pattern matching, but adapted to the needs of dealing with tensor products. The game semantics is constructed from classical game semantics using quantum interventions as questions and measurements results as answers. A soundness result for the semantics is given.
For the entire collection see [Zbl 1281.03004].
For the entire collection see [Zbl 1281.03004].
MSC:
| 68Q55 | Semantics in the theory of computing |
| 68N18 | Functional programming and lambda calculus |
| 81P68 | Quantum computation |
Software:
QPLReferences:
| [1] | Abramsky, S. and B. Coecke, A categorical semantics of quantum protocol, in: Proceedings of the 19th IEEE conference on Logic in Computer Science: LICS 2004 (2004), pp. 415-425.; Abramsky, S. and B. Coecke, A categorical semantics of quantum protocol, in: Proceedings of the 19th IEEE conference on Logic in Computer Science: LICS 2004 (2004), pp. 415-425. |
| [2] | Coecke, B.; Pavlovic, D., Quantum measurements without sums (2006) |
| [3] | Danos, V. and R. Harmer, Probabilistic game semantics, in: ACM Transactions On Computational Logic, Special Issue for LICS’00, Association For Computing Machinery (2002), pp. 359-382.; Danos, V. and R. Harmer, Probabilistic game semantics, in: ACM Transactions On Computational Logic, Special Issue for LICS’00, Association For Computing Machinery (2002), pp. 359-382. · Zbl 1365.68310 |
| [4] | Delbecque, Y. and P. Panangaden, Game semantics for quantum stores, in: A. Bauer and M. Mislove, editors, Mathematical Foundations of Programming Semantics (2008), pp. 119-139.; Delbecque, Y. and P. Panangaden, Game semantics for quantum stores, in: A. Bauer and M. Mislove, editors, Mathematical Foundations of Programming Semantics (2008), pp. 119-139. · Zbl 1286.81044 |
| [5] | Gell-Mann, M.; Hartle, J., Classical equations for quantum systems, Physical Review D, 47, 3345-3382 (1993) |
| [6] | Gleason, A. M., Measures on the closed subspaces of a Hilbert space, Journal of Mathematics and Mechanics, 885-893 (1957) · Zbl 0078.28803 |
| [7] | Griffiths, R., Consistent histories and quantum reasoning, Physical Review A, 54, 2759-2774 (1996) |
| [8] | Harmer, R., “Games and Full Abstraction for Nondeterministic Languages,” Ph.D. thesis, Imperial College (1999).; Harmer, R., “Games and Full Abstraction for Nondeterministic Languages,” Ph.D. thesis, Imperial College (1999). |
| [9] | Jacobs, B., Semantics of weakening and contraction, Annals of Pure and Applied Logic, 73-106 (1994) · Zbl 0814.03007 |
| [10] | Omnès, R., The Interpretation of Quantum Mechanics (1994), Princeton Univ. Press · Zbl 0848.46047 |
| [11] | Peres, A., Classical interventions in quantum systems. I. The measuring process, Physical Review A, 61 (2000) |
| [12] | Selinger, P., Towards a semantics for higher-order quantum computation, Proceedings of the 2nd International Workshop On Quantum Programming Languages, Turku, Finland. (2004), pp. 127-143.; Selinger, P., Towards a semantics for higher-order quantum computation, Proceedings of the 2nd International Workshop On Quantum Programming Languages, Turku, Finland. (2004), pp. 127-143. |
| [13] | Selinger, P., Dagger compact closed categories and completely positive maps, Proceedings of the 3rd International Workshop on Quantum Programming Languages. Proceedings of the 3rd International Workshop on Quantum Programming Languages, Electronic Notes in Theoretical Computer Science, 170, 139-163 (2007) · Zbl 1277.18008 |
| [14] | Selinger, P.; Valiron, B., A lambda calculus for quantum computation with classical control, Mathematical Structures in Computer Science, 16, 527-552 (2006) · Zbl 1122.68033 |
| [15] | Selinger, P. and B. Valiron, On a fully abstract model for a quantum linear functional language, in: Proceedings of the 4th International Workshop on Quantum i Programming Languages, Oxford, July 17-19, 2006.; Selinger, P. and B. Valiron, On a fully abstract model for a quantum linear functional language, in: Proceedings of the 4th International Workshop on Quantum i Programming Languages, Oxford, July 17-19, 2006. · Zbl 1279.68046 |
| [16] | Valiron, B., “A functional programming language for quantum computation with classical control,” Master’s thesis, Department of Mathematics, University of Ottawa (2004).; Valiron, B., “A functional programming language for quantum computation with classical control,” Master’s thesis, Department of Mathematics, University of Ottawa (2004). |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
