LIPIcs.CONCUR.2015.427.pdf
- Filesize: 0.56 MB
- 14 pages
Document
On Coinduction and Quantum Lambda Calculi
Authors
-
Part of:
Volume:
26th International Conference on Concurrency Theory (CONCUR 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Concurrency Theory (CONCUR) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-08-26
Cite AsGet BibTex
Yuxin Deng, Yuan Feng, and Ugo Dal Lago. On Coinduction and Quantum Lambda Calculi. In 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 42, pp. 427-440, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.CONCUR.2015.427
https://doi.org/10.4230/LIPIcs.CONCUR.2015.427
Abstract
In the ubiquitous presence of linear resources in quantum computation, program equivalence in linear contexts, where programs are used or executed once, is more important than in the classical setting. We introduce a linear contextual equivalence and two notions of bisimilarity, a state-based and a distribution-based, as proof techniques for reasoning about higher-order quantum programs. Both notions of bisimilarity are sound with respect to the linear contextual equivalence, but only the distribution-based one turns out to be complete. The completeness proof relies on a characterisation of the bisimilarity as a testing equivalence.
Keywords
- Quantum lambda calculi
- contextual equivalence
- bisimulation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads