An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration $\langle p, \varrho\rangle$, but we treat it as two relative independent part: the structural part $p$ and the quantum part $\varrho$, because the establishment of a sound and complete theory is dependent on the structural properties of the structural part $p$. We let the quantum part $\varrho$ be the outcomes of execution of $p$ to examine and observe the function of the basic theory of quantum mechanics. We establish not only a strong bisimularity for quantum processes, but also a weak bisimularity to model the silent step and abstract internal computations in quantum processes. The relationship between quantum bisimularity and classical bisimularity is established, which makes an axiomatization of quantum processes possible. An axiomatization for quantum processes called qACP is designed, which involves not only quantum information, but also classical information and unifies quantum computing and classical computing. qACP can be used easily and widely for verification of most quantum communication protocols.

[1]  Rajagopal Nagarajan,et al.  Types and Typechecking for Communicating Quantum Processes Nagarajan Is Supported by Epsrc Grant Gr/s34090 and the Eu Sixth Framework Programme (project Secoqc: Development of a Global Network for Secure Communication Based on Quantum Cryptography) , 2022 .

[2]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[3]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[4]  Jos C. M. Baeten,et al.  A brief history of process algebra , 2005, Theor. Comput. Sci..

[5]  Yuan Feng,et al.  An algebra of quantum processes , 2007, TOCL.

[6]  Philippe Jorrand,et al.  Toward a quantum process algebra , 2004, CF '04.

[7]  Marie Lalire,et al.  Relations among quantum processes: bisimilarity and congruence , 2006, Mathematical Structures in Computer Science.

[8]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Yuan Feng,et al.  Probabilistic bisimulations for quantum processes , 2007, Inf. Comput..

[10]  Yuan Feng,et al.  Symbolic Bisimulation for Quantum Processes , 2012, TOCL.

[11]  Yuan Feng,et al.  Open Bisimulation for Quantum Processes , 2012, IFIP TCS.

[12]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[13]  Philippe Jorrand,et al.  From Quantum Physics to Programming Languages: A Process Algebraic Approach , 2004, UPP.

[14]  Rajagopal Nagarajan,et al.  Communicating quantum processes , 2004, POPL '05.

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[16]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[17]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[18]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[19]  Yuan Feng,et al.  Bisimulation for quantum processes , 2010, POPL '11.

[20]  Gilles Brassard,et al.  Quantum cryptography: Public key distribution and coin tossing , 2014, Theor. Comput. Sci..

[21]  Philippe Jorrand,et al.  A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics , 2004, ArXiv.

[22]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[23]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.