Tapes as Stochastic Matrices of String Diagrams

📅 2026-01-04
🏛️ arXiv.org
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the axiomatization of probabilistic Boolean circuits by proposing a categorical semantics–based approach. By generalizing string diagrams to the Kleisli category of an arbitrary affine monad and focusing specifically on the subdistribution monad, the authors establish—for the first time—an isomorphism between string diagrams and subdistribution-valued stochastic matrices represented by such diagrams. Building upon this correspondence, they develop a complete axiomatization for probabilistic Boolean circuits. This contribution not only provides a rigorous categorical semantic foundation for probabilistic Boolean circuits but also pioneers a novel algebraic methodology for their axiomatization through the correspondence between string diagrams and stochastic matrices.

Technology Category

Application Category

📝 Abstract
Tape diagrams provide a graphical notation for categories equipped with two monoidal products, $\otimes$ and $\oplus$, where $\oplus$ is a biproduct. Recently, they have been generalised to handle Kleisli categories of arbitrary monoidal monads. In this work, we show that for the subdistribution monad, tapes are isomorphic to stochastic matrices of subdistributions of string diagrams. We then exploit this result to provide a complete axiomatisation of probabilistic Boolean circuits.
Problem

Research questions and friction points this paper is trying to address.

tape diagrams
stochastic matrices
string diagrams
probabilistic Boolean circuits
subdistribution monad
Innovation

Methods, ideas, or system contributions that make the work stand out.

tape diagrams
stochastic matrices
subdistribution monad
probabilistic Boolean circuits
string diagrams
🔎 Similar Papers
No similar papers found.
Filippo Bonchi
Filippo Bonchi
CNRS ENS-Lyon
Logic and Semantics of Programs
C
Cipriano Junior Cioffo
University of Pisa