On a Fully Abstract Model for a Quantum Linear Functional Language

Authors:
Peter Selinger;Benoît Valiron
Affiliations:
Dalhousie University, Halifax, Nova Scotia, Canada;University of Ottawa, Ottawa, Ontario, Canada
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 3
Cited 3

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

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

On Quantum and Probabilistic Linear Lambda-calculi (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Events, causality and symmetry

VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Applying quantitative semantics to higher-order quantum computing

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the linear fragment of the programing language for quantum computation with classical control described in [Selinger, P. and B. Valiron, A lambda calculus for quantum computation with classical control, in: P. Urzyczyn, editor, Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications (TLCA 2005), Lecture Notes in Computer Science 3461 (2005), pp. 354-368]. We sketch the language, and discuss equivalence of terms. We also describe a fully abstract denotational semantics based on completely positive maps.