On Coinduction and Quantum Lambda Calculi - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

On Coinduction and Quantum Lambda Calculi

(1) , (2) , (3, 4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
28.pdf (573.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01231782 , version 1 (03-12-2015)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
141 View
66 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More