REVIEW 2 cited by
A Process Algebraic Approach to Concurrent and Distributed Quantum Computation: Operational Semantics
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
read the original abstract
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate. Moreover, to model concurrent and distributed quantum computations, as well as quantum communication protocols, quantum to quantum communications which move qubits physically from one place to another must also be taken into account. Inspired by classical process algebras, which provide a framework for modeling cooperating computations, a process algebraic notation is defined, named QPAlg for Quantum Process Algebra, which provides a homogeneous style to formal descriptions of concurrent and distributed computations comprising both quantum and classical parts. On the quantum side, QPAlg provides quantum variables, operations on quantum variables (unitary operators and measurement observables), as well as new forms of communications involving the quantum world. The operational semantics makes sure that these quantum objects, operations and communications operate according to the postulates of quantum mechanics.
Forward citations
Cited by 2 Pith papers
-
Complete Quantum Relational Hoare Logics from Optimal Transport Duality
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.
-
Distributed Semantics for Distributed Quantum Computing
DH-CCS achieves spatial compositionality for quantum process calculi by representing states with named Deutsch-Hayden descriptors that split and merge without losing entanglement.
Discussion (0). Continue with ORCID to comment.