Communicating quantum processes

  title={Communicating quantum processes},
  author={Simon J. Gay and Rajagopal Nagarajan},
  booktitle={ACM-SIGACT Symposium on Principles of Programming Languages},
  • S. GayR. Nagarajan
  • Published in
    ACM-SIGACT Symposium on…
    9 September 2004
  • Computer Science
We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication primitives of the pi-calculus with primitives for measurement and transformation of quantum state; in particular, quantum bits (qubits) can be transmitted from process to process along communication channels. CQP has a static type system which classifies channels, distinguishes between quantum and classical data, and… 

Figures from this paper

Probabilistic bisimulations for quantum processes

Probabilistic bisimilarities between quantum processes

This work proposes a model qCCS which is a natural quantum extension of classical value-passing CCS with the input and output of quantum states, and unitary transformations and measurements on quantum systems.

A probabilistic branching bisimulation for quantum processes

Inspired by classical process algebras, a process algebraic notation is defined, which provides a homogeneous style to formal descriptions of concurrent and distributed computations comprising both quantum and classical parts.

Equational Reasoning About Quantum Protocols

This work adds three new equational axioms to the existing equational theory of CQP, which helps to analyse various quantum protocols by proving that the implementation and specification are equivalent.

Model checking quantum protocols

This thesis describes model checking techniques for protocols arising in quantum information theory and quantum cryptography, and details the syntax, semantics and type system of QMC’s modelling language, the logic QCTL which is used for verification, and the verification algorithms that have been implemented in the tool.

Model Checking for Communicating Quantum Processes

The approach to the verification of quantum systems using a combination of process calculus and model checking is described and a formal translation from CQP to the modelling language used by QMC is defined and it is proved that this preserves the semantics of all supported CZP processes.

Semantics and simulation of communication in quantum programming

CQPL possesses a denotational semantics based on a partial order of superoperators and uses fixed points on a generalised Hilbert space to formalise the exchange of classical and quantum data between an arbitrary number of participants.

Bisimulation for Quantum Processes

Novel notions of strong bisimulation and weak bisimulations for quantum processes are introduced and it is proved that they are congruent with respect to various process algebra combinators including parallel composition even when both classical and quantum communication are present.

Theory and applications of quantum process calculus

The equational theory of CQP is extended and an additional three new axioms are defined in order to analyse quantum protocols comprising quantum secret-sharing, quantum error correction, remote-CNOT and superdense coding to model and analyse quantum information processing (QIP) systems.

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

  • Yong Wang
  • Physics
    International Journal of Theoretical Physics
  • 2019
An axiomatization for quantum processes called qACP is designed, which involves not only quantum information, but also classical information and unifies quantum computing and classical computing.



A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and

Toward a quantum process algebra

This paper aims at defining a high level language allowing the description of classical and quantum programming, and their cooperation, and process algebras are chosen as a basis for this language.

Formal Verification of Quantum Protocols

The example used is the quantum key distribution protocol proposed by Bennett and Brassard, commonly referred to as BB84, and a model of the protocol in the process calculus CCS is presented and some initial analyses using the Concurrency Workbench of the New Century (CWB-NC).

Toward an architecture for quantum programming

A template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives, and easily lends itself to automatic, hardware independent, circuit simplification.

A Lambda Calculus for Quantum Computation

A quantum lambda calculus is developed as an alternative model of quantum computation, which combines some of the benefits of both the quantum Turing machine and the quantum circuit models and it is argued that it is equivalent to the Quantum Turing machine.

Towards a quantum programming language

  • P. Selinger
  • Computer Science
    Mathematical Structures in Computer Science
  • 2004
This paper describes the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

An introduction to quantum computing for non-physicists

Basic principles of quantum mechanics are introduced to explain where the power of quantum computers comes from and why it is difficult to harness and various approaches to exploiting the powerof quantum parallelism are explained.

A categorical semantics of quantum protocols

  • S. AbramskyB. Coecke
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
This paper focuses on quantum information protocols, which exploit quantum-mechanical effects in an essential way and form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation.

Techniques for design and validation of quantum protocols

The quantum key distribution protocol BB84 has been proved to be unconditionally secure against all types of eavesdropping and the PRISM tool is used to compute exactly the probability of successful eavesdropping, and is linked to Mayers' security criteria for BB84.

Quantum Programming

The theory of quantum programming provides tools to write both classical and quantum specifications, develop quantum programs that implement these specifications, and reason about their comparative time and space complexity all in the same framework.