Game Semantics for Quantum Stores

Authors:
Yannick Delbecque;Prakash Panagaden
Affiliations:
School of Computer Science, McGill University, Montreal, Canada;School of Computer Science, McGill University, Montreal, Canada
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 3
Cited 0

Probabilistic game semantics

ACM Transactions on Computational Logic (TOCL)
Towards a quantum programming language

Mathematical Structures in Computer Science
A lambda calculus for quantum computation with classical control

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a game semantics for a simply-typed @l-calculus equipped with quantum stores. The quantum stores are equipped with quantum operations as commands which give the language enough expressiveness to encode any quantum circuits. 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. These tensored variables are used to refer to quantum stores and to keep track of the size of the states which they contain. The game semantics is constructed from classical game semantics using intervention operators to encode the effects of the commands. A soundess result for the semantics is given.