2024/08/27 by Lorenzo Ceragioli, Fabio Gadducci, Ceragioli, Lorenzo +5 · 1 citation
Computer Science · #68Q85 (Primary) 81P68 (Secondary) #D.3.1 #F.3.2 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Quantum Computing Algorithms and Architecture
paper · pdf · doi:10.48550/arxiv.2408.15087
openalex publication_date 2024/08/27 · openalex created_date 2024/09/21 · openalex updated_date 2026/07/28
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.