Bisimulation for quantum processes

DOI10.1145/1926385.1926446zbMath1284.68425arXiv1007.2584OpenAlexW2949594786WikidataQ130924122 ScholiaQ130924122MaRDI QIDQ5408571

Ming Sheng Ying, Runyao Duan, Yuan Feng

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

bisimulationcongruencequantum computingquantum communicationquantum process algebra

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (17)

A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls ⋮ Encodability criteria for quantum based systems ⋮ Model-Checking Linear-Time Properties of Quantum Systems ⋮ On well-founded and recursive coalgebras ⋮ Quantum process algebra with priorities ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Termination of nondeterministic quantum programs ⋮ Semi-automated verification of security proofs of quantum cryptographic protocols ⋮ Verifying quantum communication protocols with ground bisimulation ⋮ Symbolic Bisimulation for Quantum Processes ⋮ Techniques for Formal Modelling and Analysis of Quantum Systems ⋮ An axiomatization for quantum processes to unifying quantum and classical computing ⋮ Probabilistic process algebra to unifying quantum and classical computing in closed systems ⋮ Entanglement in quantum process algebra ⋮ Formal verification for KMB09 protocol ⋮ Equational Reasoning About Quantum Protocols

This page was built for publication: Bisimulation for quantum processes