Distributive Laws, Spans and the ZX-Calculus

02/08/2021
by   Cole Comfort, et al.
0

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 𝔽_2-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 of spans of finite sets where the objects are powers of the two element set. Because these fragments of the ZX-calculus have semantics in terms of full subcategories of categories of spans, they can not be presented by distributive laws over groupoids. Instead, we first construct their subcategories of partial isomorphisms via distributive laws over all isomorphims with subobjects adjoined. After which, the full subcategory of spans are obtained by freely adjoining units and counits the the semi-Frobenius structures given by the diagonal and codiagonal maps.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/11/2020

The ZX calculus: A complete graphical calculus for classical circuits using spiders

We give a complete presentation for the fragment, ZX , of the ZX-calcu...
research
06/24/2018

A concrete categorical semantics of Lambda-S

Lambda-S is an extension to first-order lambda calculus unifying two app...
research
12/10/2020

Quantum Control in the Unitary Sphere: Lambda-S1 and its Categorical Model

In a recent paper, a realizability technique has been used to give a sem...
research
12/31/2019

Interaction laws of monads and comonads

We introduce and study functor-functor and monad-comonad interaction law...
research
06/16/2022

Recursion does not always help

We show that, under mild assumptions, adding recursion does not increase...
research
04/24/2019

Circuit Relations for Real Stabilizers: Towards TOF+H

The real stabilizer fragment of quantum mechanics was shown to have a co...
research
07/18/2022

One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus

Investigations concerned with anti-unification (AU) over λ-terms have fo...

Please sign up or login with your details

Forgot password? Click here to reset