Skip to Main content Skip to Navigation
Conference papers

On Coinduction and Quantum Lambda Calculi

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Ugo Dal Lago Connect in order to contact the contributor
Submitted on : Thursday, December 3, 2015 - 10:15:39 AM
Last modification on : Tuesday, October 19, 2021 - 11:01:54 AM
Long-term archiving on: : Friday, April 28, 2017 - 1:54:16 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License




Yuxin Deng, Yuan Feng, Ugo Dal Lago. On Coinduction and Quantum Lambda Calculi. Proceedings of CONCUR 2015, 2015, Madrid, Spain. ⟨10.4230/LIPIcs.CONCUR.2015.427⟩. ⟨hal-01231782⟩



Record views


Files downloads