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.
On coinduction and quantum lambda calculi / Deng, Yuxin; Feng, Yuan; Dal Lago, Ugo. - ELETTRONICO. - 42:(2015), pp. 427-440. (Intervento presentato al convegno 26th International Conference on Concurrency Theory, CONCUR 2015 tenutosi a Spagna nel 2015) [10.4230/LIPIcs.CONCUR.2015.427].
On coinduction and quantum lambda calculi
DAL LAGO, UGO
2015
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.File | Dimensione | Formato | |
---|---|---|---|
concur2015.pdf
accesso aperto
Tipo:
Versione (PDF) editoriale
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione
573.78 kB
Formato
Adobe PDF
|
573.78 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.