An axiomatization for quantum processes to unifying quantum and classical computing

DOI10.1007/S10773-019-04204-6zbMATH Open1468.81032arXiv1311.2960OpenAlexW2963914113WikidataQ127459391 ScholiaQ127459391MaRDI QIDQ2010952FDOQ2010952

Yong Wang

Publication date: 28 November 2019

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

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.

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

zbMATH Keywords

process algebraaxiomatizationquantum processesalgebra of communicating processes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Quantum cryptography: public key distribution and coin tossing
• Title not available (Why is that?)
• Title not available (Why is that?)
• A calculus of mobile processes. I
• Title not available (Why is that?)
• On the consistency of Koomen's fair abstraction rule
• Symbolic bisimulations
• A brief history of process algebra
• Probabilistic bisimulations for quantum processes
• Open Bisimulation for Quantum Processes
• An algebra of quantum processes
• Bisimulation for quantum processes
• Relations among quantum processes: bisimilarity and congruence
• Communicating quantum processes
• Types and typechecking for Communicating Quantum Processes

Cited In (1)

• Probabilistic process algebra to unifying quantum and classical computing in closed systems

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)