English

Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing

Logic in Computer Science 2021-10-26 v6

Abstract

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

Keywords

Cite

@article{arxiv.1811.01070,
  title  = {Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing},
  author = {Yong Wang},
  journal= {arXiv preprint arXiv:1811.01070},
  year   = {2021}
}

Comments

141 pages, 23 figures, 57 tables. arXiv admin note: substantial text overlap with arXiv:1611.09035, arXiv:1610.02500, arXiv:1810.00868, arXiv:1311.2960, arXiv:1501.05260, arXiv:1404.0665, arXiv:1507.03344

R2 v1 2026-06-23T05:02:40.051Z