The Delayed Stabilizer ZX-Calculus

Many stabilizer quantum error-correcting codes are built from a finite pattern repeated across space or time, such as lattice codes, translation-invariant graph states, and quantum convolutional codes.

Ordinary stabilizer ZX-diagrams capture only finite truncations of such systems, obscuring the repeated structure that defines them.

We introduce the delayed stabilizer ZX-calculus, a finite graphical language for these infinite, translation-invariant processes.

It extends the odd-prime-dimensional stabilizer ZX-calculus with a single new generator, the delay, which feeds data from one time step to the next.

We equip the calculus with two semantics.

In the first semantics, we interpret the behaviour of a delayed ZX-diagram as an equivalence class of sequences of quantum channels; where two sequences are identified if they have the same information content.

We show that the behaviour of a delayed ZX-diagram uniquely determines an infinite stabilizer group.

In the second semantics, we interpret the delay as a formal variable, encoding the translation-invariant families of Pauli operators as generating functions.

This allows us to represent a delayed ZX-diagram in terms of a tableau of generating functions, from which the infinite stabilizer group can be recovered.

Finally, we give a complete axiomatization of the delayed stabilizer ZX-calculus, featuring generalised Euler decomposition and colour change rules.

Using generalised forms of local complementation and pivoting, we reduce every diagram to a unique normal form.

This establishes soundness, universality, and completeness for the generating tableau semantics.