An axiomatization for quantum processes to unifying quantum and classical computing
From MaRDI portal
Publication:2010952
DOI10.1007/s10773-019-04204-6zbMath1468.81032arXiv1311.2960OpenAlexW2963914113WikidataQ127459391 ScholiaQ127459391MaRDI QIDQ2010952
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
Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Symbolic bisimulations
- On the consistency of Koomen's fair abstraction rule
- A calculus of mobile processes. I
- A brief history of process algebra
- Probabilistic bisimulations for quantum processes
- Open Bisimulation for Quantum Processes
- An algebra of quantum processes
- 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: An axiomatization for quantum processes to unifying quantum and classical computing