Types and typechecking for Communicating Quantum Processes

نویسندگان

  • Simon J. Gay
  • Rajagopal Nagarajan
چکیده

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 controls the use of quantum state. We formally define the syntax, operational semantics and type system of CQP, prove that the semantics preserves typing, and prove that typing guarantees that each qubit is owned by a unique process within a system. We also define a typechecking algorithm and prove that it is sound and complete with respect to the type system. We illustrate CQP by defining models of several quantum communication systems, and outline our plans for using CQP as the foundation for formal analysis and verification of combined quantum and classical systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Typechecking B

The typechecking system of the formal method B is discussed. An inconsistency in the public definition of the B method, attributable to a flaw in the typechecking system, is uncovered: the typechecking method expects the types of variables to be given in one membership predicate, such as a, b, c ∈ A × B × C, instead of with several membership predicates joined by conjunction, like a ∈ A∧b ∈ B∧c...

متن کامل

The Quantum Statistical Mechanical Theory of Transport Processes

A new derivation of the quantum Boltzmann transport equation for the Fermion system from the quantum time evolution equation for the wigner distribution function is presented. The method exhibits the origin of the time - irreversibility of the Boltzmann equation. In the present work, the spin dependent and indistinguishibility of particles are also considered.

متن کامل

XML Typechecking

SYNONYMS None DEFINITION In general, typechecking refers to the problem where, given a program P , an input type σ, and an output type τ , one must decide whether P is type-safe, that is, whether it produces only outputs of type τ when run on inputs of type σ. In the XML context, typechecking problems mainly arise in two forms: • • XML-to-XML transformations, where P transforms XML documents co...

متن کامل

Typechecking Safe Process Synchronization

Session types describe the interactions between two parties within multi-party communications. They constitute a communication protocol in the sense that the order and type of interactions between two parties are specified. For their part, correspondence assertions provide a mechanism for synchronization. When session types and correspondence assertions are combined, they are able to describe s...

متن کامل

An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing

We establish an axiomatization for quantum processes, which is a quantum generalization of process algebra ACP (Algebra of Communicating Processes). We use the framework of a quantum process configuration 〈p, %〉, but we treat it as two relative independent part: the structural part p and the quantum part %, because the establishment of a sound and complete theory is dependent on the structural ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2006