Distributive Laws, Spans and the ZX-Calculus
Cole Comfort

TL;DR
This paper develops a modular framework for constructing fragments of the ZX-calculus using distributive laws and spans, linking these fragments to categories of spans of affine vector spaces and finite sets.
Contribution
It introduces a novel modular method for building ZX-calculus fragments via distributive laws, connecting them to categories of spans with concrete semantics.
Findings
Fragments correspond to spans of affine vector spaces and finite sets.
Semantics are given by subcategories of spans, not presentation by distributive laws.
Partial isomorphisms are constructed via distributive laws over all isomorphisms.
Abstract
We modularly build increasingly larger fragments of the ZX-calculus by modularly adding new generators and relations, at each point, giving some concrete semantics in terms of some category of spans. This is performed using Lack's technique of composing props via distributive laws, as well as the technique of pushout cubes of Zanasi. We do this for the fragment of the ZX-calculus with only the black -phase (and no Hadamard gate) as well as well as the fragment which additionally has the and gate as a generator (which is equivalent to the natural number H-box fragment of the ZH-calculus). In the former case, we show that this is equivalent to the full subcategory of spans of (possibly empty) free, finite dimensional affine -vector spaces, where the objects are the non-empty affine vector spaces. In the latter case, we show that this is equivalent to the full subcategory…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · semigroups and automata theory · Logic, Reasoning, and Knowledge
