Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Types and typechecking for communicating quantum processes

Tools
- Tools
+ Tools

Gay, Simon J. and Nagarajan, Rajagopal (2006) Types and typechecking for communicating quantum processes. In: 2nd International Workshop on Quantum Programming Languages (QPL 2004), Turku, FINLAND, JUL 12-13, 2004. Published in: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 16 (3). pp. 375-406.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1017/S0960129506005263

Abstract

We define a language CQP (Communicating Quantum Processes) for modelling systems that combine quantum and classical communication and computation. CQP combines the communication primitives of the pi-calculus with primitives for measurement and transformation of the 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 states. 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.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE
Publisher: CAMBRIDGE UNIV PRESS
ISSN: 0960-1295
Date: June 2006
Volume: 16
Number: 3
Number of Pages: 32
Page Range: pp. 375-406
Identification Number: 10.1017/S0960129506005263
Publication Status: Published
Title of Event: 2nd International Workshop on Quantum Programming Languages (QPL 2004)
Location of Event: Turku, FINLAND
Date(s) of Event: JUL 12-13, 2004
URI: http://wrap.warwick.ac.uk/id/eprint/33254

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us