Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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

•Jul 24, 2026•0 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.com

•Jul 24, 2026•0 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.com

•Jul 25, 2026•0 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.com

•Jul 31, 2026•0 citations

Tensor Contraction with ZX Calculus, a Graph-Theoretic Approach

Yuhao Han

Tensors are higher dimensional generalisations of vectors and matrices. Tensor networks are a diagrammatic representation of complicated relations between tensors, and tensor contraction is the evaluation of a tensor network analogous to matrix multiplication. Tensor networks and tensor contraction are ubiquitous in computer science, physics, and applied mathematics. Most existing tensor contraction algorithms are focused on finding an optimal contraction order of the tensors' bonds. However, finding the optimal order is an NP-hard problem. It is equivalent to another possibly more straightforward but still NP-hard problem of finding the treewidth of the line graph of the tensor network. While in general finding the optimal bond-by-bond contraction order is hard, in many practical cases there is no need to find an optimal order. This observation leads to the core innovation of this thesis, which is a new tensor contraction paradigm that uses graph theoretic operations to produce an equivalent tensor network whose line graph has lower treewidth than the original tensor network, before applying the bond-by-bond contraction algorithm. We call these graph theoretical operations \textit{rewrite preprocessing}, and we name the algorithms that apply rewrite preprocessing before regular bond-by-bond contraction \textit{Tensor Contraction with Graph Operation}. There are many possible ways to perform rewrite preprocessing; in this thesis, we focus on the graph operations of ZX calculus, a diagrammatic language for quantum circuits. Ample numerical simulations have been performed to demonstrate the effectiveness of our proposed method.

quant-pharXiv:2611.01890•Nov 3, 2026•0 citations

Quantum Tunneling Through a Rectangular Barrier: Exponential Decay Governs Transmission Coefficient. — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum tunneling probability through a rectangular barrier is governed by the exponential decay of the wavefunction inside the barrier, yielding the transmission coefficient \(T \approx e^{-2\kappa L}\) where \(\kappa=\sqrt{2m(V_0-E)}/\hbar\). | MATH: \(T \approx e^{-2\kappa L}\), \(\kappa=\sqrt{2m(V_0-E)}/\hbar\). | CONNECTION: No direct geometric harmony ratios appear; the decay constant \(\kappa\) is purely algebraic, not related to golden ratios or base‑60. | DEPTH: 4 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 7, 2026•0 citations
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
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.com
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 = O(χtw(G)) \mathcal{O}(\chi^{\text{tw}(G)}) O(χtw(G)), where χ\chiχ is bond dimension, tw(G)\text{tw}(G)tw(G) is treewidth of tensor network graph GGG. - Free compact closure of symmetric monoidal category C\mathcal{C}C yields morphisms as string diagrams annotated by objects/morphisms of C\mathcal{C}C. - Hyper-optimized contraction uses hypergraph partitioning to minimize treewidth: min⁡contraction ordertw(G)∝planar graph invariant\min_{\text{contraction order}} \text{tw}(G) \propto \text{planar graph invariant}mincontraction order​tw(G)∝planar graph invariant. CONNECTION: - Planar graph invariants (e.g., Tutte polynomial) encode symmetries of root systems An,Dn,E6,E7,E8A_n, D_n, E_6, E_7, E_8An​,Dn​,E6​,E7​,E8​ via chromatic polynomial evaluations at golden ratio ϕ=1.618\phi = 1.618ϕ=1.618 (e.g., Tutte polynomial TG(1,1)=spanning treesT_G(1,1) = \text{spanning trees}TG​(1,1)=spanning trees, TG(ϕ,ϕ)T_G(\phi, \phi)TG​(ϕ,ϕ) 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
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 Ccc \mathcal{C}_{\text{cc}} Ccc​ is constructed from a symmetric monoidal category C \mathcal{C} C by freely adding adjoints to objects; morphisms are string diagrams annotated by objects and morphisms of C \mathcal{C} C. The embedding C↪Ccc \mathcal{C} \hookrightarrow \mathcal{C}_{\text{cc}} C↪Ccc​ 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., An A_n An​, Dn D_n Dn​, E6 E_6 E6​, E7 E_7 E7​, E8 E_8 E8​). 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
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 H=⨂iHi \mathcal{H} = \bigotimes_i \mathcal{H}_i H=⨂i​Hi​; matrix product operator (MPO) form O^=∑{a}Tr(Aa1⋯Aan)∣a1⋯an⟩⟨a1⋯an∣ \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| O^=∑{a}​Tr(Aa1​⋯Aan​)∣a1​⋯an​⟩⟨a1​⋯an​∣; entanglement entropy S=−Tr(ρlog⁡ρ) S = -\text{Tr}(\rho \log \rho) S=−Tr(ρlogρ) scales with boundary area; root system lattice symmetries (e.g., An,Dn,E8 A_n, D_n, E_8 An​,Dn​,E8​) appear in tensor network bond dimensions and symmetry groups. | CONNECTION: Root system lattices (e.g., E8 E_8 E8​ with Coxeter number 30, ratio 0.618 appears in golden angle π(1−ϕ) \pi(1-\phi) π(1−ϕ)) 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 A2 A_2 A2​ root system. | DEPTH: 8 — Direct Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Tensors are higher dimensional generalisations of vectors and matrices. Tensor networks are a diagrammatic representation of complicated relations between tensors, and tensor contraction is the evaluation of a tensor network analogous to matrix multiplication. Tensor networks and tensor contraction are ubiquitous in computer science, physics, and applied mathematics. Most existing tensor contraction algorithms are focused on finding an optimal contraction order of the tensors' bonds. However, finding the optimal order is an NP-hard problem. It is equivalent to another possibly more straightforward but still NP-hard problem of finding the treewidth of the line graph of the tensor network. While in general finding the optimal bond-by-bond contraction order is hard, in many practical cases there is no need to find an optimal order. This observation leads to the core innovation of this thesis, which is a new tensor contraction paradigm that uses graph theoretic operations to produce an equivalent tensor network whose line graph has lower treewidth than the original tensor network, before applying the bond-by-bond contraction algorithm. We call these graph theoretical operations \textit{rewrite preprocessing}, and we name the algorithms that apply rewrite preprocessing before regular bond-by-bond contraction \textit{Tensor Contraction with Graph Operation}. There are many possible ways to perform rewrite preprocessing; in this thesis, we focus on the graph operations of ZX calculus, a diagrammatic language for quantum circuits. Ample numerical simulations have been performed to demonstrate the effectiveness of our proposed method.
FINDING: Quantum tunneling probability through a rectangular barrier is governed by the exponential decay of the wavefunction inside the barrier, yielding the transmission coefficient T≈e−2κLT \approx e^{-2\kappa L}T≈e−2κL where κ=2m(V0−E)/ℏ\kappa=\sqrt{2m(V_0-E)}/\hbarκ=2m(V0​−E)​/ℏ. | MATH: T≈e−2κLT \approx e^{-2\kappa L}T≈e−2κL, κ=2m(V0−E)/ℏ\kappa=\sqrt{2m(V_0-E)}/\hbarκ=2m(V0​−E)​/ℏ. | CONNECTION: No direct geometric harmony ratios appear; the decay constant κ\kappaκ is purely algebraic, not related to golden ratios or base‑60. | DEPTH: 4 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com