Categorifying the ZX-calculus
We build a symmetric monoidal and compact closed bicategory by combining spans and cospans inside a topos. This can be used as a framework in which to study open networks and diagrammatic languages. We illustrate this framework with Coecke and Duncan's zx-calculus by constructing a bicategory w...
Main Author: | Daniel Cicala |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2018-02-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1704.07034v2 |
Similar Items
-
Completeness and the ZX-calculus
by: Backens, M
Published: (2015) -
Completeness of the ZX-calculus
by: Wang, Q
Published: (2018) -
Completeness of the ZX-Calculus
by: Emmanuel Jeandel, et al.
Published: (2020-06-01) -
CATEGORIFYING RATIONALIZATION
by: CLARK BARWICK, et al.
Published: (2019-01-01) -
A simplified stabilizer ZX-calculus
by: Backens, M, et al.
Published: (2017)