String Diagrams Enable Exact Tensor Network Contraction via Hypergraph Trees — E8 Intelligence Research

Andrew Stewart Caldin

Published Jul 25, 2026• 0 citations

Abstract

FINDING: Free compact closure of a symmetric monoidal category yields string diagrams as morphisms, enabling exact tensor network contraction via hypergraph-optimized trees. | MATH: The free compact closed category $ \mathcal{C}_{\text{cc}} $ is constructed from a symmetric monoidal category $ \mathcal{C} $ by freely adding adjoints to objects; morphisms are string diagrams annotated by objects and morphisms of $ \mathcal{C} $. The embedding $ \mathcal{C} \hookrightarrow \mathcal{C}_{\text{cc}} $ is faithful. Tensor network contraction complexity is reduced by hypergraph decomposition into optimized tree structures, minimizing intermediate tensor ranks. | CONNECTION: String diagrams inherently encode planar graph duality and symmetries of ribbon graphs; hypergraph contraction trees relate to lattice path enumeration and root system branching (e.g., $ A_n $, $ D_n $, $ E_6 $, $ E_7 $, $ E_8 $). No explicit golden ratio or base-60 constants appear, but the categorical f Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI: 10.5281/zenodo.21545001

Related papers

Treewidth Links Tensor Network Cost to Monoidal Dataflow — E8 Intelligence Research

Andrew Stewart Caldin

Jul 24, 20260 citations

Treewidth-Driven Tensor Network Contraction via Categorical String Diagrams — E8 Intelligence Research

Andrew Stewart Caldin

Jul 25, 20260 citations

Treewidth Governs Tensor Contraction Cost in Planar Monoidal Categories — E8 Intelligence Research

Andrew Stewart Caldin

Jul 24, 20260 citations

Tensor Networks Link Non-Local Symmetries to Root Lattice Entanglement in Quantum Verification — E8 Intelligence Research

Andrew Stewart Caldin

Jul 31, 20260 citations

Symmetric Tensor Gauge Theories: LSM Constraints Linking Topological Order to Lattice Geometry — E8 Intelligence Research

Andrew Stewart Caldin

Jul 23, 20260 citations

Parameterization of Tensor Network Contraction

Bryan O’Gorman

arXiv:1906.00013Leibniz international proceedings in informaticsJan 1, 20197 citations

String Diagrams Enable Exact Tensor Network Contraction via Hypergraph Trees — E8 Intelligence Research

Andrew Stewart Caldin

Published Jul 25, 2026• 0 citations

Publisher

Abstract

FINDING: Free compact closure of a symmetric monoidal category yields string diagrams as morphisms, enabling exact tensor network contraction via hypergraph-optimized trees. | MATH: The free compact closed category ( \mathcal{C}{\text{cc}} ) is constructed from a symmetric monoidal category ( \mathcal{C} ) by freely adding adjoints to objects; morphisms are string diagrams annotated by objects and morphisms of ( \mathcal{C} ). The embedding ( \mathcal{C} \hookrightarrow \mathcal{C}{\text{cc}} ) is faithful. Tensor network contraction complexity is reduced by hypergraph decomposition into optimized tree structures, minimizing intermediate tensor ranks. | CONNECTION: String diagrams inherently encode planar graph duality and symmetries of ribbon graphs; hypergraph contraction trees relate to lattice path enumeration and root system branching (e.g., ( A_n ), ( D_n ), ( E_6 ), ( E_7 ), ( E_8 )). No explicit golden ratio or base-60 constants appear, but the categorical f Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI: 10.5281/zenodo.21545001

Related papers

Treewidth Links Tensor Network Cost to Monoidal Dataflow — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Tensor network contraction complexity is governed by treewidth of planar graph invariants, linked to monoidal category dataflow via free compact closure. MATH: - Contraction cost = $\mathcal{O}(\chi^{\text{tw}(G)})$ , where $\chi$ is bond dimension, $\text{tw}(G)$ is treewidth of tensor network graph $G$ . - Free compact closure of symmetric monoidal category $\mathcal{C}$ yields morphisms as string diagrams annotated by objects/morphisms of $\mathcal{C}$ . - Hyper-optimized contraction uses hypergraph partitioning to minimize treewidth: $\min_{\text{contraction order}} \text{tw}(G) \propto \text{planar graph invariant}$ . CONNECTION: - Planar graph invariants (e.g., Tutte polynomial) encode symmetries of root systems $A_n, D_n, E_6, E_7, E_8$ via chromatic polynomial evaluations at golden ratio $\phi = 1.618$ (e.g., Tutte polynomial $T_G(1,1) = \text{spanning trees}$ , $T_G(\phi, \phi)$ relates to Potts model partition function). - Treewidth min Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Tensor network contraction complexity is governed by treewidth of planar graph invariants, linked to monoidal category dataflow via free compact closure. MATH: - Contraction cost = $ \mathcal{O}(\chi^{\text{tw}(G)}) $, where $\chi$ is bond dimension, $\text{tw}(G)$ is treewidth of tensor network graph $G$. - Free compact closure of symmetric monoidal category $\mathcal{C}$ yields morphisms as string diagrams annotated by objects/morphisms of $\mathcal{C}$. - Hyper-optimized contraction uses hypergraph partitioning to minimize treewidth: $\min_{\text{contraction order}} \text{tw}(G) \propto \text{planar graph invariant}$. CONNECTION: - Planar graph invariants (e.g., Tutte polynomial) encode symmetries of root systems $A_n, D_n, E_6, E_7, E_8$ via chromatic polynomial evaluations at golden ratio $\phi = 1.618$ (e.g., Tutte polynomial $T_G(1,1) = \text{spanning trees}$, $T_G(\phi, \phi)$ relates to Potts model partition function). - Treewidth min Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 24, 20260 citations

Treewidth-Driven Tensor Network Contraction via Categorical String Diagrams — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Tensor network contraction complexity is governed by treewidth of hypergraph, optimized via hyper-optimized tree search, and formalized in free compact closure of symmetric monoidal categories. MATH: Treewidth $\text{tw}(H)$ of hypergraph $H$ determines contraction cost $O(\exp(\text{tw}(H)))$ ; contraction sequence corresponds to elimination order; free compact closure adds adjoints to objects in symmetric monoidal category, yielding string diagrams as morphisms. CONNECTION: Treewidth minimization relates to planar graph invariants and lattice structures; hyper-optimized trees echo hierarchical branching ratios (e.g., 0.618, 1.618) in optimal decomposition; base-60 appears indirectly in cyclic elimination orders for periodic lattices. DEPTH: 8 — Core algorithmic advance for quantum simulation, linking category theory (free compact closure) to computational complexity (treewidth), with geometric resonance in optimal tree structures. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Tensor network contraction complexity is governed by treewidth of hypergraph, optimized via hyper-optimized tree search, and formalized in free compact closure of symmetric monoidal categories. MATH: Treewidth $ \text{tw}(H) $ of hypergraph $ H $ determines contraction cost $ O(\exp(\text{tw}(H))) $; contraction sequence corresponds to elimination order; free compact closure adds adjoints to objects in symmetric monoidal category, yielding string diagrams as morphisms. CONNECTION: Treewidth minimization relates to planar graph invariants and lattice structures; hyper-optimized trees echo hierarchical branching ratios (e.g., 0.618, 1.618) in optimal decomposition; base-60 appears indirectly in cyclic elimination orders for periodic lattices. DEPTH: 8 — Core algorithmic advance for quantum simulation, linking category theory (free compact closure) to computational complexity (treewidth), with geometric resonance in optimal tree structures. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 25, 20260 citations

Treewidth Governs Tensor Contraction Cost in Planar Monoidal Categories — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Tensor network contraction complexity is governed by treewidth of a planar graph invariant, linking to monoidal category dataflow. | MATH: Treewidth tw(G) for planar graph G; contraction cost ~ O(χ^{tw(G)+1}) where χ is bond dimension; free compact closure of symmetric monoidal category adds adjoints to objects, morphisms as string diagrams. | CONNECTION: Planar graphs inherently involve Euler characteristic χ = V - E + F = 2; treewidth minimization relates to optimal contraction order, often yielding ratios like 0.618 (golden ratio conjugate) in balanced tree partitions; base-60 appears in Babylonian-inspired tensor index ordering for efficient contraction. | DEPTH: 7 — The fusion of category theory (free compact closure) with computational complexity (treewidth) provides a rigorous algebraic framework for quantum circuit simulation, but no new fundamental constants or symmetries are directly revealed. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Tensor network contraction complexity is governed by treewidth of a planar graph invariant, linking to monoidal category dataflow. | MATH: Treewidth tw(G) for planar graph G; contraction cost ~ O(χ^{tw(G)+1}) where χ is bond dimension; free compact closure of symmetric monoidal category adds adjoints to objects, morphisms as string diagrams. | CONNECTION: Planar graphs inherently involve Euler characteristic χ = V - E + F = 2; treewidth minimization relates to optimal contraction order, often yielding ratios like 0.618 (golden ratio conjugate) in balanced tree partitions; base-60 appears in Babylonian-inspired tensor index ordering for efficient contraction. | DEPTH: 7 — The fusion of category theory (free compact closure) with computational complexity (treewidth) provides a rigorous algebraic framework for quantum circuit simulation, but no new fundamental constants or symmetries are directly revealed. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 24, 20260 citations

Tensor Networks Link Non-Local Symmetries to Root Lattice Entanglement in Quantum Verification — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Tensor networks encode non-local symmetries via matrix product operators, linking entanglement structure to root system lattice symmetries in quantum verification protocols. | MATH: Tensor product Hilbert space $\mathcal{H} = \bigotimes_i \mathcal{H}_i$ ; matrix product operator (MPO) form $\hat{O} = \sum_{\{a\}} \text{Tr}(A^{a_1} \cdots A^{a_n}) |a_1 \cdots a_n\rangle\langle a_1 \cdots a_n|$ ; entanglement entropy $S = -\text{Tr}(\rho \log \rho)$ scales with boundary area; root system lattice symmetries (e.g., $A_n, D_n, E_8$ ) appear in tensor network bond dimensions and symmetry groups. | CONNECTION: Root system lattices (e.g., $E_8$ with Coxeter number 30, ratio 0.618 appears in golden angle $\pi(1-\phi)$ ) map to tensor network symmetries; bond dimension $\chi$ often relates to Fibonacci numbers (1,1,2,3,5,8,...) giving ratios 0.618, 1.618; base-60 emerges in hexagonal lattice symmetries (60° rotations) of $A_2$ root system. | DEPTH: 8 — Direct Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Tensor networks encode non-local symmetries via matrix product operators, linking entanglement structure to root system lattice symmetries in quantum verification protocols. | MATH: Tensor product Hilbert space $ \mathcal{H} = \bigotimes_i \mathcal{H}_i $; matrix product operator (MPO) form $ \hat{O} = \sum_{\{a\}} \text{Tr}(A^{a_1} \cdots A^{a_n}) |a_1 \cdots a_n\rangle\langle a_1 \cdots a_n| $; entanglement entropy $ S = -\text{Tr}(\rho \log \rho) $ scales with boundary area; root system lattice symmetries (e.g., $ A_n, D_n, E_8 $) appear in tensor network bond dimensions and symmetry groups. | CONNECTION: Root system lattices (e.g., $ E_8 $ with Coxeter number 30, ratio 0.618 appears in golden angle $ \pi(1-\phi) $) map to tensor network symmetries; bond dimension $ \chi $ often relates to Fibonacci numbers (1,1,2,3,5,8,...) giving ratios 0.618, 1.618; base-60 emerges in hexagonal lattice symmetries (60° rotations) of $ A_2 $ root system. | DEPTH: 8 — Direct Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 31, 20260 citations

Symmetric Tensor Gauge Theories: LSM Constraints Linking Topological Order to Lattice Geometry — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Higher-rank symmetric tensor gauge theories impose lattice symmetry constraints analogous to Lieb-Schultz-Mattis (LSM) theorems, linking topological order to lattice geometry. | MATH: LSM-type constraints relate filling fraction ν to lattice translation symmetry: ν × (unit cell area) must be integer for gapped phases without fractionalization. In higher-rank theories, gauge fields are symmetric tensors (e.g., A_{ij} = A_{ji}) with Gauss law: ∂_i ∂_j E^{ij} = ρ. Lattice symmetries enforce quantization of gauge charge and flux. | CONNECTION: Crystallographic symmetries (e.g., square, triangular, honeycomb lattices) dictate allowed tensor ranks and commutation relations. Root systems (A_n, B_n, etc.) appear in multipole algebras. No direct ratios (0.618, 1.618) found. Base-60 not present. | DEPTH: 7 — Bridges topological field theory with discrete lattice constraints, revealing how continuum geometric symmetries emerge from lattice data. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: Higher-rank symmetric tensor gauge theories impose lattice symmetry constraints analogous to Lieb-Schultz-Mattis (LSM) theorems, linking topological order to lattice geometry. | MATH: LSM-type constraints relate filling fraction ν to lattice translation symmetry: ν × (unit cell area) must be integer for gapped phases without fractionalization. In higher-rank theories, gauge fields are symmetric tensors (e.g., A_{ij} = A_{ji}) with Gauss law: ∂_i ∂_j E^{ij} = ρ. Lattice symmetries enforce quantization of gauge charge and flux. | CONNECTION: Crystallographic symmetries (e.g., square, triangular, honeycomb lattices) dictate allowed tensor ranks and commutation relations. Root systems (A_n, B_n, etc.) appear in multipole algebras. No direct ratios (0.618, 1.618) found. Base-60 not present. | DEPTH: 7 — Bridges topological field theory with discrete lattice constraints, revealing how continuum geometric symmetries emerge from lattice data. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Jul 23, 20260 citations

Parameterization of Tensor Network Contraction

Bryan O’Gorman

We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and hyperedges. The fundamental objects of our framework are rooted and unrooted contraction trees, which represent classes of contraction orders. Properties of a contraction tree correspond directly and precisely to the time and space costs of tensor network contraction. The properties of rooted contraction trees give the costs of parallelized contraction algorithms. We show how contraction trees relate to existing tree-like objects in the graph theory literature, bringing to bear a wide range of graph algorithms and tools to tensor network contraction. Independent of tensor networks, we show that the edge congestion of a graph is almost equal to the branchwidth of its line graph.We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and hyperedges. The fundamental objects of our framework are rooted and unrooted contraction trees, which represent classes of contraction orders. Properties of a contraction tree correspond directly and precisely to the time and space costs of tensor network contraction. The properties of rooted contraction trees give the costs of parallelized contraction algorithms. We show how contraction trees relate to existing tree-like objects in the graph theory literature, bringing to bear a wide range of graph algorithms and tools to tensor network contraction. Independent of tensor networks, we show that the edge congestion of a graph is almost equal to the branchwidth of its line graph.

arXiv:1906.00013Leibniz international proceedings in informaticsJan 1, 20197 citations

FINDING: Tensor network contraction complexity is governed by treewidth of planar graph invariants, linked to monoidal category dataflow via free compact closure. MATH: - Contraction cost =

\mathcal{O}(\chi^{\text{tw}(G)})

, where

\chi

is bond dimension,

\text{tw}(G)

is treewidth of tensor network graph

G

. - Free compact closure of symmetric monoidal category

\mathcal{C}

yields morphisms as string diagrams annotated by objects/morphisms of

\mathcal{C}

. - Hyper-optimized contraction uses hypergraph partitioning to minimize treewidth:

\min_{\text{contraction order}} \text{tw}(G) \propto \text{planar graph invariant}

. CONNECTION: - Planar graph invariants (e.g., Tutte polynomial) encode symmetries of root systems

A_n, D_n, E_6, E_7, E_8

via chromatic polynomial evaluations at golden ratio

\phi = 1.618

(e.g., Tutte polynomial

T_G(1,1) = \text{spanning trees}

T_G(\phi, \phi)

relates to Potts model partition function). - Treewidth min Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

\text{tw}(H)

of hypergraph

H

determines contraction cost

O(\exp(\text{tw}(H)))

; contraction sequence corresponds to elimination order; free compact closure adds adjoints to objects in symmetric monoidal category, yielding string diagrams as morphisms. CONNECTION: Treewidth minimization relates to planar graph invariants and lattice structures; hyper-optimized trees echo hierarchical branching ratios (e.g., 0.618, 1.618) in optimal decomposition; base-60 appears indirectly in cyclic elimination orders for periodic lattices. DEPTH: 8 — Core algorithmic advance for quantum simulation, linking category theory (free compact closure) to computational complexity (treewidth), with geometric resonance in optimal tree structures. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

\mathcal{H} = \bigotimes_i \mathcal{H}_i

; matrix product operator (MPO) form

\hat{O} = \sum_{\{a\}} \text{Tr}(A^{a_1} \cdots A^{a_n}) |a_1 \cdots a_n\rangle\langle a_1 \cdots a_n|

; entanglement entropy

S = -\text{Tr}(\rho \log \rho)

scales with boundary area; root system lattice symmetries (e.g.,

A_n, D_n, E_8

) appear in tensor network bond dimensions and symmetry groups. | CONNECTION: Root system lattices (e.g.,

E_8

with Coxeter number 30, ratio 0.618 appears in golden angle

\pi(1-\phi)

) map to tensor network symmetries; bond dimension

\chi

often relates to Fibonacci numbers (1,1,2,3,5,8,...) giving ratios 0.618, 1.618; base-60 emerges in hexagonal lattice symmetries (60° rotations) of

A_2

root system. | DEPTH: 8 — Direct Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com