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

DOI10.1007/s10773-019-04216-2zbMath1428.81062arXiv1610.02500OpenAlexW2972093044WikidataQ127286487 ScholiaQ127286487MaRDI QIDQ2010969

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Symbolic bisimulations
• A brief history of process algebra
• Probabilistic bisimulations for quantum processes
• Open Bisimulation for Quantum Processes
• An algebra of quantum processes
• Quantum cryptography based on Bell’s theorem
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Communicating quantum processes
• Bisimulation for quantum processes
• Types and typechecking for Communicating Quantum Processes
• Relations among quantum processes: bisimilarity and congruence

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