Theoretical Computer Science
A calculus of mobile processes, I
Information and Computation
A syntactic approach to type soundness
Information and Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
An introduction to quantum computing for non-physicists
ACM Computing Surveys (CSUR)
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
A Lambda Calculus for Quantum Computation
SIAM Journal on Computing
Towards a quantum programming language
Mathematical Structures in Computer Science
A Categorical Semantics of Quantum Protocols
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Relations among quantum processes: bisimilarity and congruence
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
An algebra of quantum processes
ACM Transactions on Computational Logic (TOCL)
Reachability and termination analysis of concurrent quantum programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Quantum process calculus for linear optical quantum computing
RC'13 Proceedings of the 5th international conference on Reversible Computation
| Hi-index | 0.00 |
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.