Verifying quantum communication protocols with ground bisimulation
DOI10.1007/978-3-030-45237-7_2zbMATH Open1473.68115OpenAlexW3016663929MaRDI QIDQ2233434FDOQ2233434
Authors: Xudong Qin, Wenjie Du, Yuxin Deng 
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45237-7_2
Recommendations
Quantum algorithms and complexity in the theory of computing (68Q12) 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)
Cites Work
- Semi-automated verification of security proofs of quantum cryptographic protocols
- Automated Equivalence Checking of Concurrent Quantum Systems
- Quantum cryptography: public key distribution and coin tossing
- Title not available (Why is that?)
- Towards a quantum programming language
- Deciding bisimilarity and similarity for probabilistic processes.
- Polynomial time decision algorithms for probabilistic automata
- Symbolic bisimulations
- A theory of bisimulation for the \(\pi\)-calculus
- Probabilistic bisimulations for quantum processes
- Open bisimulation for quantum processes
- An algebra of quantum processes
- Bisimulation for quantum processes
- Relations among quantum processes: bisimilarity and congruence
- Communicating quantum processes
- Symbolic Bisimulation for Quantum Processes
Cited In (4)
This page was built for publication: Verifying quantum communication protocols with ground bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233434)
