Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910579325665280 |
|---|---|
| author | Ceragioli, Lorenzo Gadducci, Fabio Lomurno, Giuseppe Tedeschi, Gabriele |
| author_facet | Ceragioli, Lorenzo Gadducci, Fabio Lomurno, Giuseppe Tedeschi, Gabriele |
| contents | The development of quantum algorithms and protocols calls for adequate modelling and verification techniques, which requires abstracting and focusing on the basic features of quantum concurrent systems, like CCS and CSP have done for their classical counterparts. So far, an equivalence relation is still missing that is a congruence for parallel composition and adheres to the limited discriminating power implied by quantum theory. In fact, defining an adequate bisimilarity for quantum-capable, concurrent systems proved a difficult task, because unconstrained non-determinism allows to spuriously discriminate indistinguishable quantum systems. We investigate this problem by enriching a linear quantum extension of CCS with simple physically admissible schedulers. We show that our approach suffices for deriving a well-behaved bisimilarity that satisfies the aforementioned desiderata. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_15087 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers Ceragioli, Lorenzo Gadducci, Fabio Lomurno, Giuseppe Tedeschi, Gabriele Logic in Computer Science 68Q85 (Primary) 81P68 (Secondary) D.3.1; F.3.2 The development of quantum algorithms and protocols calls for adequate modelling and verification techniques, which requires abstracting and focusing on the basic features of quantum concurrent systems, like CCS and CSP have done for their classical counterparts. So far, an equivalence relation is still missing that is a congruence for parallel composition and adheres to the limited discriminating power implied by quantum theory. In fact, defining an adequate bisimilarity for quantum-capable, concurrent systems proved a difficult task, because unconstrained non-determinism allows to spuriously discriminate indistinguishable quantum systems. We investigate this problem by enriching a linear quantum extension of CCS with simple physically admissible schedulers. We show that our approach suffices for deriving a well-behaved bisimilarity that satisfies the aforementioned desiderata. |
| title | Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers |
| topic | Logic in Computer Science 68Q85 (Primary) 81P68 (Secondary) D.3.1; F.3.2 |
| url | https://arxiv.org/abs/2408.15087 |