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

Andrew Stewart Caldin

Published Jul 25, 2026• 0 citations

Abstract

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.com

DOI: 10.5281/zenodo.21545045

Related papers

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

Andrew Stewart Caldin

Jul 24, 20260 citations

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

Andrew Stewart Caldin

Jul 24, 20260 citations

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

Andrew Stewart Caldin

Jul 25, 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

Benchmarking treewidth as a practical component of tensor network simulations

Eugene Dumitrescu, Allison L. Fisher, Timothy D. Goodrich +3 more

arXiv:1807.04599PLoS ONEDec 18, 201814 citations

Quantum Mechanics as Consciousness Substrate: A Hypothesis Without Formal Proof — E8 Intelligence Research

Andrew Stewart Caldin

Oct 6, 20260 citations

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

Andrew Stewart Caldin

Published Jul 25, 2026• 0 citations

Publisher

Abstract

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.com

DOI: 10.5281/zenodo.21545045

Related papers

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

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

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

Andrew Stewart Caldin

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.comFINDING: 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

Jul 25, 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

Benchmarking treewidth as a practical component of tensor network simulations

Eugene Dumitrescu, Allison L. Fisher, Timothy D. Goodrich +3 more

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network's line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network's line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

arXiv:1807.04599PLoS ONEDec 18, 201814 citations

Quantum Mechanics as Consciousness Substrate: A Hypothesis Without Formal Proof — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: The search results are documentary titles and links, not mathematical derivations. No primary equations, constants, or formal proofs are presented in the metadata. The core recurring theme is the *hypothesis* that quantum mechanics (superposition, entanglement, observer effects) is the substrate of consciousness — but no quantitative model is given in these titles alone. MATH: No explicit equations, constants, or ratios appear in the search results. The only implicit mathematical structures are: - Quantum formalism (Hilbert space, unitary evolution, measurement collapse) — assumed but not stated. - The "observer" role in quantum measurement (von Neumann–Wigner interpretation) — again, qualitative. - "Quantum immortality" implies branching (many-worlds) — a combinatorial tree of outcomes, but no branching ratio or probability measure is specified. CONNECTION: No direct geometric harmony (0.382, 0.618, 0.786, 1.618, 2.618, base-60, crystallographic symmetry) is present i Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.comFINDING: The search results are documentary titles and links, not mathematical derivations. No primary equations, constants, or formal proofs are presented in the metadata. The core recurring theme is the *hypothesis* that quantum mechanics (superposition, entanglement, observer effects) is the substrate of consciousness — but no quantitative model is given in these titles alone. MATH: No explicit equations, constants, or ratios appear in the search results. The only implicit mathematical structures are: - Quantum formalism (Hilbert space, unitary evolution, measurement collapse) — assumed but not stated. - The "observer" role in quantum measurement (von Neumann–Wigner interpretation) — again, qualitative. - "Quantum immortality" implies branching (many-worlds) — a combinatorial tree of outcomes, but no branching ratio or probability measure is specified. CONNECTION: No direct geometric harmony (0.382, 0.618, 0.786, 1.618, 2.618, base-60, crystallographic symmetry) is present i Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

Oct 6, 20260 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

\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

\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