Harry K. Stoltz | Searcharxiv

arXiv2026

Minimality of the Pure Qubit ZX Calculus

The ZX calculus is a graphical language for reasoning about quantum processes. In this paper, we develop a minimal pure-qubit ZX calculus based on the work of Vilmart [arXiv:1812.09114], Backens, Perdrix, and Wang [arXiv:1709.08903], and Stoltz [arXiv:2606.12383]. This resolves a problem that has remained open for nearly a decade, since completeness was first proved. Specifically, we show that $(I_r)$ is derivable and establish the necessity of $(B)$ and $(I_g)$, yielding two complete and minimal rulesets.

quant-ph↗

arXiv2026

Minimality of the Stabilizer ZX Calculus

The stabilizer fragment of the ZX calculus is amongst the most important fragments of the theory. Crucially, the stabilizer calculus can be described by a small collection of rewrites, most of which have been shown to be necessary by Backens--Perdrix--Wang (arXiv:1709.08903). However, two rules, describing the red/green compact-structure coincidence and the important bialgebra law, had not been shown to be necessary. We present two alternate interpretations, showing that both of these rules are individually necessary. Thus, this resolves a problem which has remained open for over a decade, and gives the first complete, minimal ruleset for the stabilizer ZX Calculus.

quant-ph↗