Types and typechecking for Communicating Quantum Processes

DOI10.1017/S0960129506005263MaRDI QIDQ5482266zbMATH OpenOpenAlexFDO

Authors Rajagopal Nagarajan, Simon J. Gay

Publication date 28 August 2006

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

Full work available at URL https://doi.org/10.1017/s0960129506005263

Mathematics Subject Classification ID

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

Recommendations

• Communicating quantum processes
• Equational reasoning about quantum protocols
• Verifying quantum communication protocols with ground bisimulation
• A lambda calculus for quantum computation with classical control
• An algebra of quantum processes

Cited in

(14)

• 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
• Encodability criteria for quantum based systems
• Equational reasoning about quantum protocols
• Model-checking linear-time properties of quantum systems
• Techniques for Formal Modelling and Analysis of Quantum Systems
• Formalization \textit{of} quantum protocols using Coq
• Deadlock detection in linear recursive programs
• Communicating quantum processes
• Adding concurrency to quantum dynamic logic
• Quantum loop programs

Describes a project that uses

Uses Software

• Lilac
• PRISM

This page was built for publication: Types and typechecking for Communicating Quantum Processes

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