Verification of Distributed Quantum Protocols
Yong Wang

TL;DR
This paper discusses the use of truly concurrent process algebras with localities to model and verify distributed quantum communication protocols, aiming to unify quantum and classical computing frameworks.
Contribution
It introduces a framework combining truly concurrent process algebras with localities for modeling and verifying distributed quantum protocols, advancing quantum-classical unification.
Findings
Framework effectively models quantum communication protocols
Enables verification of protocol distribution properties
Bridges quantum and classical computing models
Abstract
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, to calculus, APPTC to probabilistic process algebra, APTC with localities to process algebra with localities. In quantum process algebras, there are several well-known work, and we ever did some work to unify quantum and classical computing under the framework of ACP \cite{ACP} and probabilistic process algebra. Now, it is the time to utilize truly concurrent process algebras with localities to model quantum computing and unify quantum and classical computing in this book. Since this work is with localities, it is suitable to verify the distribution of quantum communication protocols.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture · Formal Methods in Verification
