Showing cs.LOShow all
3 papers · 1 filter
cs.LO2025
The Tensor-Plus Calculus
Kostia Chardonnet, Marc de Visme, Benoît Valiron +1
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires…
cs.LO2025
The Many-Worlds Calculus
Kostia Chardonnet, Marc de Visme, Benoît Valiron +1
In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We pr…
cs.LO2024
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
Renaud Vilmart
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We…