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:1501.05260

Reversible Quantum Process Algebra

Yong Wang

Published Jan 17, 2015• 1 citation
arXivHTMLPDF

Abstract

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 APPTC to model quantum computing and unify quantum and classical computing.

DOI
10.48550/arxiv.1501.05260

Related papers

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

Security Analyses of Quantum Communication 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.In this book, we utilize truly concurrent process algebras APTC and APPTC to model quantum computing and unify quantum and classical computing.

arXiv:1404.0665•Mar 17, 2014•1 citation

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

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 Algebra of Reversible Quantum Computing

Guiping Dai, Yong Wang

We extend the algebra of reversible computation to support quantum computing. Since the algebra is based on true concurrency, it is reversible for quantum computing and it has a sound and complete theory.

International Conference on Information Science and Control Engineering•Dec 1, 2020•0 citations

A probabilistic branching bisimulation for quantum processes

Marie Lalire

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and distributed quantum computations, as well as quantum communication protocols, quantum to quantum communications which move qubits physically from one place to another must also be taken into account. Inspired by classical process algebras, which provide a framework for modeling cooperating computations, a process algebraic notation is defined, which provides a homogeneous style to formal descriptions of concurrent and distributed computations comprising both quantum and classical parts.Based upon an operational semantics which makes sure that quantum objects, operations and communications operate according to the postulates of quantum mechanics, a probabilistic branching bisimulation is defined among processes considered as having the same behavior.

arXiv:quant-ph/0508116•Aug 16, 2005•6 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. 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.
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.
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.In this book, we utilize truly concurrent process algebras APTC and APPTC to model quantum computing and unify quantum and classical computing.
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, 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.
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and distributed quantum computations, as well as quantum communication protocols, quantum to quantum communications which move qubits physically from one place to another must also be taken into account. Inspired by classical process algebras, which provide a framework for modeling cooperating computations, a process algebraic notation is defined, which provides a homogeneous style to formal descriptions of concurrent and distributed computations comprising both quantum and classical parts.Based upon an operational semantics which makes sure that quantum objects, operations and communications operate according to the postulates of quantum mechanics, a probabilistic branching bisimulation is defined among processes considered as having the same behavior.