APLAS 2024
Tue 22 - Fri 25 October 2024 Kyoto
Tue 22 Oct 2024 14:30 - 15:00 at Yamauchi Hall - Quantum Chair(s): Jacques Garrigue

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.

Tue 22 Oct

Displayed time zone: Osaka, Sapporo, Tokyo change

14:00 - 15:30
QuantumResearch Papers at Yamauchi Hall
Chair(s): Jacques Garrigue Nagoya University
14:00
30m
Talk
Quantum Programming Without the Quantum Physics
Research Papers
Jun Inoue National Institute of Advanced Industrial Science and Technology, Japan
14:30
30m
Talk
Quantum Bisimilarity is a Congruence under Physically Admissible Schedulers
Research Papers
Lorenzo Ceragioli IMT Lucca, Italy, Fabio Gadducci University of Pisa, Giuseppe Lomurno University of Pisa, Italy, Gabriele Tedeschi University of Pisa, Italy
15:00
30m
Talk
Type-Based Verification of Connectivity Constraints in Lattice Surgery
Research Papers
Ryo Wakizaka Kyoto University, Atsushi Igarashi Kyoto University, Yasunari Suzuki NTT Computer and Data Science Laboratories