Truly Concurrent Process Algebra to Unifying Quantum and Classical Computing
arXiv:1811.01070
Abstract
Truly concurrent process algebras are generalizations to the traditional process algebras for true concurrency, CTC to CCS, APTC to ACP, 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 comment141 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
References in corpus (6)
- Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulses implementations
- Incoherent and Coherent Eavesdropping in the 6-state Protocol of Quantum Cryptography
- Quantum Key Distribution Protocol with Private-Public Key
- Algebraic Laws for True Concurrency
- An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing
- A Calculus of Truly Concurrent Mobile Processes