Towards Term-based Verification of Diagrammatic Equivalence
Abstract
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 compositions. Since different syntactic terms may represent the same diagram, this syntax is quotiented by a collection of coherence equations expressing equivalence up to deformation. This work lays foundations for automated reasoning about diagrammatic equivalence, motivated primarily by the verification of quantum circuit equivalences. We consider two classes of diagrams, for which we introduce normalizing term rewriting systems that equate diagrammatically equivalent terms. In both cases, we prove termination and confluence with the help of the proof assistant Isabelle/HOL.
Keywords
Cite
@article{arxiv.2602.11035,
title = {Towards Term-based Verification of Diagrammatic Equivalence},
author = {Julie Cailler and Noé Delorme and Simon Perdrix and Sophie Tourret},
journal= {arXiv preprint arXiv:2602.11035},
year = {2026}
}