ZX Calculus

Origin. Coecke and Duncan (2008). Graphical language for quantum computing. String diagrams for linear maps. Completeness for Clifford+T. Foundation for quantum circuit optimization.

Models. Green nodes (Z spiders): Z-basis operations. Red nodes (X spiders): X-basis operations. Wires: qubits. Composition: sequential, parallel. Rewrite rules for simplification.

Formalism.

Z spider: Green node with m inputs, n outputs, phase α. |Z(α)⟩ₘ,ₙ = |0⟩^⊗n⟨0|^⊗m + e^{iα}|1⟩^⊗n⟨1|^⊗m

X spider: Red node with m inputs, n outputs, phase α. Same in X basis (Hadamard conjugate of Z).

Basic rules: Spider fusion: adjacent same-color spiders merge. Z_α ∘ Z_β = Z_{α+β}

Bialgebra: Z-X interaction rules. (Special cases give Hopf algebra)

Copy rule: Z spider copies X spider and vice versa.

Hadamard: changes color (Z ↔ X). H Z_α H = X_α

Completeness: ZX is complete for:

Clifford circuits
Clifford+T (with additional rules)
Universal quantum computation

Normal forms: Graph-like diagrams. Reduced diagrams for optimization.

Optimization: Circuit simplification via rewriting. T-count reduction. Verified quantum transformations.

Symbols.

Symbol	Unicode	Name	Meaning
Z	—	Z spider	Green node
X	—	X spider	Red node
H	—	Hadamard	Color swap
α	U+03B1	Phase	Rotation angle
⊗	U+2297	Tensor	Parallel composition

Metatheory. Completeness theorems. Soundness wrt quantum mechanics. Categorical foundations (dagger compact). Rewrite confluence.

Applies to. Quantum circuit optimization. Verification. Error correction. Measurement-based QC. Quantum protocols.

Limitations. Large diagrams hard to manage. Rewrite strategy selection. Tool support developing. Learning curve.