The evaluation of partition functions is a central problem in statistical physics. For lattice systems and other discrete models the partition function may be expressed as the contraction of a tensor network. Unfortunately computing such contractions is difficult, and many methods to make this tractable require periodic or otherwise structured networks. Here I present a new algorithm for contracting unstructured tensor networks. This method makes no assumptions about the structure of the network and performs well in both structured and unstructured cases so long as the correlation structure is local.
Cited by 5
Liang et al., Fast Search of the Optimal Contraction Sequence in Tensor Networks
IEEE J. Sel. Top. Signal Process. 15, 574 (2021) [Crossref]
Schindler et al., Algorithms for tensor network contraction ordering
Mach. Learn.: Sci. Technol. 1, 035001 (2020) [Crossref]
Pan et al., Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
Phys. Rev. Lett. 125, 060503 (2020) [Crossref]
Klishin et al., Avoidance, adjacency, and association in distributed systems design
J. Phys. Complex. 2, 025015 (2021) [Crossref]
Klishin et al., When does entropy promote local organization?
Soft Matter 16, 6523 (2020) [Crossref]