---
title: "Interacting Quantum Observables: Categorical Algebra and Diagrammatics"
authors: ["Bob Coecke", "Ross Duncan"]
year: 2011
venue: "New J. Phys."
arxiv: "0906.4725"
doi: "10.1088/1367-2630/13/4/043016"
source: "https://arxiv.org/abs/0906.4725"
topics: [curiosity]
seed_rank: 1145
seed_batch: "curiosity-2026-08-23"
reviewed: "2026-08-23"
pool: "maths-foundations"
relevance_score: 10
lineage: zx-calculus
cites:
  - title: "Quantum Picturalism"
    url: "https://arxiv.org/abs/0908.1787"
    year: 2010
    arxiv: "0908.1787"
    doi: "10.1080/00107510903257624"
  - title: "Completeness of the ZX-Calculus"
    url: "https://arxiv.org/abs/1903.06035"
    year: 2020
    arxiv: "1903.06035"
    doi: "10.23638/LMCS-16(2:11)2020"
  - title: "The logic of entanglement"
    url: "https://arxiv.org/abs/quant-ph/0402014"
    year: 2004
    arxiv: "quant-ph/0402014"
    doi: null
  - title: "Completeness and the ZX-calculus"
    url: "https://arxiv.org/abs/1602.08954"
    year: 2016
    arxiv: "1602.08954"
    doi: null
see:
  - "018-physics-topology-logic-and-computation-a-rosetta-stone"
  - "951-an-introduction-to-string-diagrams-for-computer-scientists"
  - "1027-a-critical-pair-enumeration-algorithm-for-string-diagram-rewriting"
  - "1124-a-categorification-of-the-jones-polynomial"
---

# Interacting Quantum Observables: Categorical Algebra and Diagrammatics

## One-sentence takeaway

Complementarity of the Z and X observables is a pair of spiders — special commutative dagger Frobenius algebras that interact as a scaled bialgebra — so multi-qubit Hilbert-space algebra becomes a rewrite system of diagrams.

## Why it's lovely

Why you might love this: two complementary observables, the whole of qubit QM's "which basis", collapse to a pair of coloured dots with a fusion law. The Hilbert space disappears; what remains is a string-diagram rewrite system whose generators are the spiders of ZX. Teleportation, the CNOT, and the no-cloning theorem become pictures you can push around. This is the founding paper of the ZX-calculus, not a completeness sequel and not the 2010 survey.

## Problem

The standard formalism of quantum computation is arrays of complex amplitudes. Derivations that should be structural — complementarity, phase kickback, measurement-based patterns — drown in matrix multiplication. What is the algebraic content of two complementary observables, stated so that the corresponding graphical calculus is universal for multi-qubit systems?

## Design

Each observable is a special commutative dagger Frobenius algebra on a Hilbert space (a spider: any connected diagram of dots of one colour equals the unique spider with the same arity). The associated phase group is the abelian group of phase gates for that observable. Strong complementarity of Z and X is a scaled bialgebra law between the two spiders. The resulting ZX-calculus is the graphical language of dagger symmetric monoidal categories generated by this data; only connectivity of the diagram matters.

## Evidence

The paper axiomatises complementarity inside dagger compact closed categories, proves the spider theorem, identifies the phase group, and shows that Z/X on qubits satisfy the strong (scaled bialgebra) form. Worked examples recover teleportation and a family of quantum algorithms as diagram rewrites. Journal version: *New J. Phys.* 13 (2011) 043016, DOI `10.1088/1367-2630/13/4/043016`. Completeness for stabilizer, Clifford+T, and universal qubit QM came later (Backens; Jeandel–Perdrix–Vilmart) and is cited, not minted.

## Limitations

Qubit ZX; qutrit, mixed-state, and delayed-stabilizer calculi are sequels. The 2009/2011 axiomatisation is not yet complete for all of qubit QM — that is a feature of the founding paper, not a defect of the idea. Not a T-count optimiser and not a lecture-note survey.

## Implications for Broadside

Broadside already lives in string diagrams (951, 1027) and in the Rosetta Stone (018) that says QM, topology, logic, and computation are one diagrammatic language. ZX is the concrete rewrite system that makes that slogan compute: a circuit is a diagram, a simplification is a critical-pair rewrite, a completeness theorem is a decision procedure. Khovanov (1124) is a different Frobenius algebra (Kauffman states); ZX is the computational one.

## Bottom line

Mint the founding spiders, cite picturalism and completeness. Hilbert space as a rewrite system.

## Links

- arXiv: [0906.4725](https://arxiv.org/abs/0906.4725)
- Journal: [New J. Phys. 13 (2011) 043016](https://doi.org/10.1088/1367-2630/13/4/043016)