Reversible Quantum Process Algebra with Guards

TL;DR

This paper introduces a reversible quantum process algebra framework that unifies quantum and classical computing using advanced algebraic models for true concurrency and probabilistic processes.

Contribution

It extends reversible and probabilistic process algebras to model quantum computing, providing a unified algebraic approach for quantum and classical systems.

Findings

Unified quantum and classical computing models

Extended process algebra frameworks for quantum systems

Demonstrated modeling capabilities for quantum processes

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. 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.