3 papers
cs.LO2026
Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB
Julie Cailler, Noé Delorme, Sophie Tourret
We introduce a new family of benchmarks for the problem of diagrammatic equivalence between circuits. Three variants of this problem are considered, ranging from basic to challengi…
cs.LO2026
Towards Term-based Verification of Diagrammatic Equivalence
Julie Cailler, Noé Delorme, Simon Perdrix +1
A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel comp…
quant-ph2025
Diagrammatic Reasoning with Control as a Constructor, Applications to Quantum Circuits
Noé Delorme, Simon Perdrix
Control is a fundamental concept in quantum and reversible computational models. It enables the conditional application of a transformation to a system, depending on the state of a…