April 2024
Intermediate to advanced
400 pages
21h 1m
English
This chapter introduces a process algebraic model of distributed quantum programs. Their bisimulation semantics is defined. A series of algebraic laws are derived for reasoning about equivalence of two distributed quantum programs.
Process algebra; Quantum processes; Transitional semantics; Bisimulation; Approximate bisimulation; Algebraic laws; Congruence
Distributed systems: A distributed system consists of a collection of physically distributed components that operate upon separate (their own) memories, and communicate and synchronise via message passing through channels between them. The message communications can be roughly classified into the following two categories: