Types and typechecking for Communicating Quantum Processes

DOI10.1017/S0960129506005263zbMath1122.68059OpenAlexW2152081604MaRDI QIDQ5482266

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) Quantum computation (81P68) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Model-Checking Linear-Time Properties of Quantum Systems ⋮ Quantum process algebra with priorities ⋮ Unnamed Item ⋮ Techniques for Formal Modelling and Analysis of Quantum Systems ⋮ Deadlock Detection in Linear Recursive Programs ⋮ 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 ⋮ Quantum loop programs ⋮ Equational Reasoning About Quantum Protocols

Uses Software

• PRISM
• Lilac

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