Reversible Quantum Process Algebra
Yong Wang

TL;DR
This paper introduces reversible truly concurrent process algebras, APRTC and APPTC, to model quantum computing and unify it with classical computing, advancing the theoretical framework for quantum processes.
Contribution
It extends reversible and probabilistic process algebras to quantum computing, providing a unified algebraic framework for quantum and classical processes.
Findings
Modeling of quantum computing using APRTC and APPTC
Unification of quantum and classical computing processes
Advancement in reversible process algebra theory
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. And we also did some work on reversible process algebra and probabilistic truly concurrent process algebra. In this book, we utilize reversible truly concurrent process algebras APRTC and APPTC to model quantum computing and unify quantum and classical computing.
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 Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
