Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1610.02500 · International Journal of Theoretical Physics

Probabilistic Process Algebra to Unifying Quantum and Classical Computing in Closed Systems

Yong Wang

Published Sep 5, 2019• 2 citations
arXivHTMLPDF
DOI
10.1007/s10773-019-04216-2

Related papers

Verification of Distributed Quantum Protocols

Yong Wang

Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $π_{tc}$ 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.

arXiv:2110.11416•Oct 4, 2021•1 citation

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

Yong Wang

arXiv:1311.2960•International Journal of Theoretical Physics•Jul 23, 2019•10 citations

Quantum Process Algebra

Elsevier eBooks•Jan 1, 2025•0 citations

Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

Yong Wang

Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $π_{tc}$ to $π$ calculus, APPTC to probabilistic process algebra. Now, it is the time to utilize truly concurrent process algebras APTC and APPTC to model quantum computing and unify quantum and classical computing. In this book, we introduce the preliminaries, the utilization of APTC to unify quantum and classical computing and its usage in verification of quantum communication protocols, the utilization of APPTC to unifying quantum and classical computing and its usage in verification of quantum communication protocols.

arXiv:1811.01070•Nov 2, 2018•1 citation

Probabilistic Logics in Quantum Computation

Héctor Freytes, Antonio Ledda, Giuseppe Sergioli +1 more

Springer eBooks•Jan 1, 2013•4 citations

Reversible Quantum Process Algebra with Guards

Yong Wang

Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, $π_{tc}$ 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 probabilistic process algebra APPTC to model quantum computing and unify quantum and classical computing.

arXiv:1507.03344•Jul 13, 2015•0 citations
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, πtcπ_{tc}πtc​ 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.
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, πtcπ_{tc}πtc​ to πππ calculus, APPTC to probabilistic process algebra. Now, it is the time to utilize truly concurrent process algebras APTC and APPTC to model quantum computing and unify quantum and classical computing. In this book, we introduce the preliminaries, the utilization of APTC to unify quantum and classical computing and its usage in verification of quantum communication protocols, the utilization of APPTC to unifying quantum and classical computing and its usage in verification of quantum communication protocols.
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, πtcπ_{tc}πtc​ 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 probabilistic process algebra APPTC to model quantum computing and unify quantum and classical computing.