Types and typechecking for communicating quantum processes

被引:21
作者
Gay, Simon J. [1 ]
Nagarajan, Rajagopal
机构
[1] Univ Glasgow, Dept Comp Sci, Glasgow G12 8QQ, Lanark, Scotland
[2] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England
关键词
D O I
10.1017/S0960129506005263
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:375 / 406
页数:32
相关论文
共 21 条
[1]  
Bennett C.H., 1984, P IEEE INT C COMP SY, P175, DOI DOI 10.1016/J.TCS.2014.05.025
[2]   TELEPORTING AN UNKNOWN QUANTUM STATE VIA DUAL CLASSICAL AND EINSTEIN-PODOLSKY-ROSEN CHANNELS [J].
BENNETT, CH ;
BRASSARD, G ;
CREPEAU, C ;
JOZSA, R ;
PERES, A ;
WOOTTERS, WK .
PHYSICAL REVIEW LETTERS, 1993, 70 (13) :1895-1899
[3]   Algebraic theory of probabilistic and nondeterministic processes [J].
Cazorla, D ;
Cuartero, F ;
Valero, V ;
Pelayo, FL ;
Pardo, JJ .
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2003, 55 (1-2) :57-103
[4]   Long distance quantum teleportation in a quantum relay configuration [J].
de Riedmatten, H ;
Marcikic, I ;
Tittel, W ;
Zbinden, H ;
Collins, D ;
Gisin, N .
PHYSICAL REVIEW LETTERS, 2004, 92 (04) :4
[5]   LINEAR LOGIC [J].
GIRARD, JY .
THEORETICAL COMPUTER SCIENCE, 1987, 50 (01) :1-102
[6]   Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations [J].
Gottesman, D ;
Chuang, IL .
NATURE, 1999, 402 (6760) :390-393
[7]   Linearity and the pi-calculus [J].
Kobayashi, N ;
Pierce, BC ;
Turner, DN .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1999, 21 (05) :914-947
[8]   Is quantum bit commitment really possible? [J].
Lo, HK ;
Chau, HF .
PHYSICAL REVIEW LETTERS, 1997, 78 (17) :3410-3413
[9]   Unconditional security in quantum cryptography [J].
Mayers, D .
JOURNAL OF THE ACM, 2001, 48 (03) :351-406
[10]   Unconditionally secure quantum bit commitment is impossible [J].
Mayers, D .
PHYSICAL REVIEW LETTERS, 1997, 78 (17) :3414-3417