<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>8002</REFNUM><AUTHORS><AUTHOR>Gay,S.J.</AUTHOR><AUTHOR>Nagarajan,R.</AUTHOR></AUTHORS><YEAR>2006</YEAR><TITLE>Types and typechecking for Communicating Quantum Processes</TITLE><PLACE_PUBLISHED>Mathematical Structures in Computer Science 16(3) DOI:10.1017/S0960129506005263</PLACE_PUBLISHED><PUBLISHER>Cambridge University Press</PUBLISHER><PAGES>375-406</PAGES><ISBN>0960-1295</ISBN><LABEL>Gay:2006:8002</LABEL><KEYWORDS><KEYWORD>Quantum computing</KEYWORD></KEYWORDS<ABSTRACT>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.</ABSTRACT><URL>http://www.dcs.gla.ac.uk/~simon/publications/CQP.pdf</URL></RECORD></RECORDS></XML>