Branching bisimulation semantics for quantum processes

DOI10.1016/j.ipl.2024.106492zbMATH Open1541.68262MaRDI QIDQ6551718

Hao Wu, Huan Long, Qizhe Yang

Publication date: 7 June 2024

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

verificationformal semanticsbranching bisimulationquantum process algebra

Mathematics Subject Classification ID

Quantum computation (81P68) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial time decision algorithms for probabilistic automata
• Raiders of the lost equivalence: probabilistic branching bisimilarity
• Model independent approach to probabilistic models
• Theory of interaction
• A proof system for communicating processes with value-passing
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• A theory of communicating processes with value passing
• Branching bisimilarity is an equivalence indeed!
• Verifying quantum communication protocols with ground bisimulation
• Probabilistic bisimulations for quantum processes
• Open Bisimulation for Quantum Processes
• An algebra of quantum processes
• Quantum Computation and Quantum Information
• Branching time and abstraction in bisimulation semantics
• Symbolic Bisimulation for Quantum Processes
• Communicating quantum processes
• A single quantum cannot be cloned
• Bisimulation for quantum processes
• Relations among quantum processes: bisimilarity and congruence
• Probabilistic weak bisimulation and axiomatization for probabilistic models
• Uniform random process model revisited

This page was built for publication: Branching bisimulation semantics for quantum processes