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

04/11/2020
by   Cole Comfort, et al.
0

We give a complete presentation for the fragment, ZX , of the ZX-calculus generated by the Z and X spiders (corresponding to copying and addition) along with the not gate and the and gate. To prove completeness, we freely add units and counits to the category TOF generated by the Toffoli gate and ancillary bits, showing that this yields the strictification of spans of powers of the two element set; and then perform a two way translation between this category and ZX . A translation to some extension of TOF, as opposed to some fragment of the ZX-calculus, is a natural choice because of the multiplicative nature of the Toffoli gate. To this end, we show that freely adding counits to the semi-Frobenius algebra of a discrete inverse category is the same as computing the “environment structure” of the classical structures of the base discrete inverse category. We show that in this setting, the classical channels and the discrete Cartesian completion are the same constructions. Therefore, in the case of TOF, freely adding a counit, constructing the category of quantum channels, and computing the discrete Cartesian completion are all equivalent to partial functions between powers of the two element set. By glueing together the free counit completion and the free unit completion, this yields the strictification of spans between powers of the two element set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/08/2021

Distributive Laws, Spans and the ZX-Calculus

We modularly build increasingly larger fragments of the ZX-calculus by m...
research
04/27/2018

The category TOF

We provide a complete set of identities for the symmetric monoidal categ...
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
12/01/2020

Difference-restriction algebras of partial functions with operators: discrete duality and completion

We exhibit an adjunction between a category of abstract algebras of part...
research
09/10/2017

A Straightforward Method to Judge the Completeness of a Polymorphic Gate Set

Polymorphic circuits are a special kind of circuits which possess some d...
research
06/16/2022

Recursion does not always help

We show that, under mild assumptions, adding recursion does not increase...
research
07/19/2023

The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality

We introduce the qudit ZH-calculus and show how to generalise all the ph...

Please sign up or login with your details

Forgot password? Click here to reset