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

DOI10.1007/S10773-019-04216-2zbMATH Open1428.81062arXiv1610.02500OpenAlexW2972093044WikidataQ127286487 ScholiaQ127286487MaRDI QIDQ2010969FDOQ2010969

Yong Wang

Publication date: 28 November 2019

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

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.

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

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

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)

Cites Work

• Quantum cryptography based on Bell’s theorem
• 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?)
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)

• Mathematical Foundations of Computer Science 2004

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)