An axiomatization for quantum processes to unifying quantum and classical computing

DOI10.1007/S10773-019-04204-6MaRDI QIDQ2010952zbMATH OpenOpenAlexWikidataFDO

Authors Yong Wang

Publication date 28 November 2019

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.2960

zbMATH Keywords

algebra of communicating processesaxiomatizationprocess algebraquantum processes

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Abstract: 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 $langlep,varrhoangle$, 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.

Recommendations

• Probabilistic process algebra to unifying quantum and classical computing in closed systems
• Communicating quantum processes
• Equational reasoning about quantum protocols
• Verifying quantum communication protocols with ground bisimulation
• Formal verification for KMB09 protocol

Cites work

• A brief history of process algebra
• A calculus of mobile processes. I
• An algebra of quantum processes
• Bisimulation for quantum processes
• Communicating quantum processes
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1412988 (Why is no real title available?)
• On the consistency of Koomen's fair abstraction rule
• Open bisimulation for quantum processes
• Probabilistic bisimulations for quantum processes
• Quantum cryptography: public key distribution and coin tossing
• Relations among quantum processes: bisimilarity and congruence
• Symbolic bisimulations
• Types and typechecking for Communicating Quantum Processes

Cited in

(3)

• Probabilistic process algebra to unifying quantum and classical computing in closed systems
• Entanglement in quantum process algebra
• Formal verification for KMB09 protocol

This page was built for publication: An axiomatization for quantum processes to unifying quantum and classical computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010952)