Quantum Bisimilarity Is a Congruence Under Physically Admissible Schedulers
Abstract elided by the publisher.
Related papers
- Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities TACAS 2020
- Bigraphs and transitions POPL 2003
- On coinductive equivalences for higher-order probabilistic functional programs POPL 2014
- Familial monads and structural operational semantics POPL 2019
- Quantum Programming Without the Quantum Physics APLAS 2024
- Effectful Normal Form Bisimulation ESOP 2019
- Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic Observers POPL 2024
- Higher-Order Behavioural Conformances via Fibrations POPL 2026