Chapter 10: Distributed quantum programs
Abstract
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.
Keywords
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:
- • Asynchronous ...
Get Foundations of Quantum Programming, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
