Denotational semantics for stabiliser quantum programs
Robert I. Booth, Cole Comfort
TL;DR
This work delivers a denotational semantics framework for stabiliser quantum programs by leveraging a symplectic, affine-relational representation, enabling efficient reasoning about stabiliser maps, measurements, and classical control. By embedding mixed stabiliser dynamics through the CPM construction and affine coisotropic relations, it connects stabiliser codes, encoding, error detection and coarse-graining to a compositional, tractable algebraic setting. The authors introduce SPL, a small imperative language with fully abstract semantics in the Rel-based category, and extend it to arbitrary classical operations, illustrating practical verification potential and paving the way for fault-tolerant compilation pipelines. The approach provides polynomial-time observational equivalence in the symplectic setting and offers a modular path toward higher-level languages and diagrammatic formalisms (e.g., ZX-calculus) for stabiliser QEC.
Abstract
The stabiliser fragment of quantum theory is a foundational building block for quantum error correction and the fault-tolerant compilation of quantum programs. In this article, we develop a sound, universal and complete denotational semantics for stabiliser operations which include measurement, classically-controlled Pauli operators, and affine classical operations, in which quantum error-correcting codes are first-class objects. The operations are interpreted as certain affine relations over finite fields. This offers a conceptually motivated and computationally-tractable alternative to the standard operator-algebraic semantics of quantum programs (whose time complexity grows exponentially as the state space increases in size). We demonstrate the power of the resulting semantics by describing a small, proof-of-concept assembly language for stabiliser programs with fully-abstract denotational semantics.
