Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

TL;DR

This paper proposes using truly concurrent process algebras, APTC and APPTC, to model and unify quantum and classical computing, enabling verification of quantum communication protocols.

Contribution

It introduces the application of APTC and APPTC to unify quantum and classical computing and demonstrates their use in protocol verification.

Findings

APTC and APPTC effectively model quantum-classical systems.

Verification of quantum communication protocols is facilitated.

A unified framework for quantum and classical computing is established.

Abstract

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