Verifying quantum communication protocols with ground bisimulation

DOI10.1007/978-3-030-45237-7_2zbMath1473.68115OpenAlexW3016663929MaRDI QIDQ2233434

Xudong Qin, Wenjie Du, Yu-xin Deng

Publication date: 18 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-45237-7_2

zbMATH Keywords

verificationbisimulationquantum communication protocolsquantum process algebra

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Semi-automated verification of security proofs of quantum cryptographic protocols
• Polynomial time decision algorithms for probabilistic automata
• Symbolic bisimulations
• A theory of bisimulation for the \(\pi\)-calculus
• Deciding bisimilarity and similarity for probabilistic processes.
• Probabilistic bisimulations for quantum processes
• Open Bisimulation for Quantum Processes
• An algebra of quantum processes
• Automated Equivalence Checking of Concurrent Quantum Systems
• Towards a quantum programming language
• Symbolic Bisimulation for Quantum Processes
• Communicating quantum processes
• Bisimulation for quantum processes
• Relations among quantum processes: bisimilarity and congruence

This page was built for publication: Verifying quantum communication protocols with ground bisimulation