Communicating quantum processes
From MaRDI portal
Publication:5276142
DOI10.1145/1040305.1040318zbMath1369.68207arXivquant-ph/0409052MaRDI QIDQ5276142
Rajagopal Nagarajan, Simon J. Gay
Publication date: 14 July 2017
Published in: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0409052
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Unnamed Item, Techniques for Formal Modelling and Analysis of Quantum Systems, Symbolic Bisimulation for Quantum Processes, Quantum process algebra with priorities, Distributed quantum programming, 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, On well-founded and recursive coalgebras, Verifying quantum communication protocols with ground bisimulation, Termination of nondeterministic quantum programs, Probabilistic bisimulations for quantum processes, Equational Reasoning About Quantum Protocols, A Process Algebra for Reasoning About Quantum Security, Distributed Measurement-based Quantum Computation, Simulating and Compiling Code for the Sequential Quantum Random Access Machine, Quantum Patterns and Types for Entanglement and Separability, Classical Knowledge for Quantum Cryptographic Reasoning, Quantum Arrows in Haskell, Model-Checking Linear-Time Properties of Quantum Systems
