Relations among quantum processes: bisimilarity and congruence

DOI10.1017/S096012950600524XMaRDI QIDQ5482268zbMATH OpenOpenAlexFDO

Authors Marie Lalire

Publication date 28 August 2006

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0603274

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Quantum computation (81P68)

Abstract: Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and distributed quantum computations and quantum communication protocols, communications over quantum channels which move qubits physically from one place to another must also be taken into account. Inspired by classical process algebras, which provide a framework for modeling cooperating computations, a process algebraic notation is defined. This notation provides a homogeneous style to formal descriptions of concurrent and distributed computations comprising both quantum and classical parts. Based upon an operational semantics which makes sure that quantum objects, operations and communications operate according to the postulates of quantum mechanics, an equivalence is defined among process states considered as having the same behavior. This equivalence is a probabilistic branching bisimulation. From this relation, an equivalence on processes is defined. However, it is not a congruence because it is not preserved by parallel composition.

Recommendations

• Probabilistic bisimulations for quantum processes
• An algebra of quantum processes
• Open bisimulation for quantum processes
• Bisimulations for probabilistic and quantum processes (invited paper)
• Bisimulation for quantum processes

Cited in

(21)

• Quantum process algebra with priorities
• 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
• On well-founded and recursive coalgebras
• Verifying quantum communication protocols with ground bisimulation
• Probabilistic bisimulations for quantum processes
• Open bisimulation for quantum processes
• An algebra of quantum processes
• Model-checking linear-time properties of quantum systems
• Semi-automated verification of security proofs of quantum cryptographic protocols
• Techniques for Formal Modelling and Analysis of Quantum Systems
• Observational equivalence using schedulers for quantum processes
• Bisimulations for probabilistic and quantum processes (invited paper)
• Formalization \textit{of} quantum protocols using Coq
• Symbolic bisimulation for quantum processes
• Branching bisimulation semantics for quantum processes
• Effect semantics for quantum process calculi
• Reconciling quantum theory and process equivalence via physically admissible schedulers
• Quantum fuzzy inference for knowledge base design in robust intelligent controllers

Describes a project that uses

Uses Software

• LOTOS

This page was built for publication: Relations among quantum processes: bisimilarity and congruence

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