Game semantics for quantum programming
- Submitting institution
-
University of Cambridge
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1939
- Type
- D - Journal article
- DOI
-
10.1145/3290345
- Title of journal
- Proceedings of the ACM on Programming Languages
- Article number
- 32
- First page
- 1
- Volume
- 3
- Issue
- POPL
- ISSN
- 2475-1421
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The first game semantics for the full quantum lambda calculus of Selinger et al; earlier games models were not able to handle quantum entanglement adequately. Via its intensional full-abstraction, Clairambault and de Visme were subsequently able to solve an open problem, full abstraction for the quantum lambda calculus w.r.t. Selinger's model based on Hilbert spaces. The work is central to de Visme's PhD thesis at ENS Lyon. The work led to Winskel's keynote address at Reversible Computation 2019, Lausanne, and through this to ongoing collaborations with the computer science, physics and maths centres at Copenhagen University.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -