Pattern graph rewrite systems

Abstract

String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes"), on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

In Proceedings DCM 2012, arXiv:1403.7579

References in corpus (1)

• Open Graphs and Computational Reasoning

Cited by in corpus (9)

• PyZX: Large Scale Automated Diagrammatic Reasoning
• ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
• Verifying the Smallest Interesting Colour Code with Quantomatic
• Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
• Completeness of the ZH-calculus
• !-Graphs with Trivial Overlap are Context-Free
• Finite Verification of Infinite Families of Diagram Equations
• A Framework for Rewriting Families of String Diagrams
• Encoding !-tensors as !-graphs with neighbourhood orders