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

DOI10.1007/S10773-019-04216-2MaRDI QIDQ2010969zbMATH 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/1610.02500

zbMATH Keywords

axiomatizationprobabilistic process algebraquantum processesalgebra of communicating processes

Mathematics Subject Classification ID

Quantum computation (81P68) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) General topics in the theory of algorithms (68W01)

Abstract: We have unified quantum and classical computing in open quantum systems called qACP which is a quantum generalization of process algebra ACP. But, an axiomatization for quantum and classical processes with an assumption of closed quantum systems is still missing. For closed quantum systems, unitary operator, quantum measurement and quantum entanglement are three basic components for quantum computing. This leads to probability unavoidable. Along the solution of qACP to unify quantum and classical computing in open quantum systems, we unify quantum and classical computing with an assumption of closed systems under the framework of ACP-like probabilistic process algebra. This unification make it can be used widely in verification for quantum and classical computing mixed systems, such as most quantum communication protocols.

Recommendations

• An axiomatization for quantum processes to unifying quantum and classical computing
• A common algebraic description for probabilistic and quantum computations
• Mathematical Foundations of Computer Science 2004
• Probabilistic bisimulations for quantum processes
• A unified approach to quantum computation and classical reversible computation
• Probabilistic programmable quantum processors
• Quantum computations and non-classical Markov processes
• Computation in finitary stochastic and quantum processes
• Probability in quantum computation and quantum computational logics: a survey
• Entanglement in quantum process algebra

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 1701760 (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?)
• A brief history of process algebra
• An algebra of quantum processes
• Bisimulation for quantum processes
• Communicating quantum processes
• Open bisimulation for quantum processes
• Probabilistic bisimulations for quantum processes
• Quantum cryptography based on Bell’s theorem
• Quantum cryptography: public key distribution and coin tossing
• Relations among quantum processes: bisimilarity and congruence
• Symbolic bisimulations
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Types and typechecking for Communicating Quantum Processes

Cited in

(2)

• Mathematical Foundations of Computer Science 2004
• An axiomatization for quantum processes to unifying quantum and classical computing

This page was built for publication: Probabilistic process algebra to unifying quantum and classical computing in closed systems

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