A survey of graphical languages for monoidal categories
read the original abstract
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and others who use diagrammatic reasoning. We have opted for a somewhat informal treatment of topological notions, and have omitted most proofs. Nevertheless, the exposition is sufficiently detailed to make it clear what is presently known, and to serve as a starting place for more in-depth study. Where possible, we provide pointers to more rigorous treatments in the literature. Where we include results that have only been proved in special cases, we indicate this in the form of caveats.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Approaching the Continuous from the Discrete: an Infinite Tensor Product Construction
A universal construction adjoins infinite tensor products to FinStoch to produce a category of locally constant Markov kernels on finite sets union the Cantor space, enabling algebraic reasoning about continuous proba...
-
Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.
-
String Diagrams for Quantum Foundations, Computing and Natural Language Processing
String diagrams formalize constructor theory with locality-composition conflicts, enable wave-based Boolean logic design and optimization, and map Urdu text circuits equivalently to English ones up to gate translation...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.