Pith. sign in

REVIEW 1 cited by

Communicating Quantum Processes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0409052 v1 pith:SJ5WZLLF submitted 2004-09-09 quant-ph

classification quant-ph
keywords quantumcommunicationclassicalprocesssystemsystemschannelscommunicating
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Complete Quantum Relational Hoare Logics from Optimal Transport Duality

    cs.LO 2025-01 accept novelty 8.0 of 10

    A sound and complete quantum relational Hoare logic (qOTL) for almost-surely terminating programs with bounded postconditions is obtained by adding a duality rule based on quantum optimal transport.

Pith tools