Automatic Contraction of Unstructured Tensor Networks
arXiv:1709.03080 · doi:10.21468/SciPostPhys.8.1.005
Abstract
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.
arXiv comment34 pages, 31 figures. Resubmission to SciPost
References in corpus (22)
- The NumPy array: a structure for efficient numerical computation
- The density-matrix renormalization group
- An efficient, multiple range random walk algorithm to calculate the density of states
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- A class of quantum many-body states that can be efficiently simulated
- Simulating quantum computation by contracting tensor networks
- Spin-Glass Theory for Pedestrians
- Studying Two Dimensional Systems With the Density Matrix Renormalization Group
- Tensor network states and geometry
- Second Renormalization of Tensor-Network States
- Loop optimization for tensor network renormalization
- Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm
- Grassmann Tensor Renormalization Group Approach to One-Flavor Lattice Schwinger Model
- Algorithms for tensor network renormalization
- Lattice Gauge Tensor Networks
- Faster identification of optimal contraction sequences for tensor networks
- Renormalization group flows of Hamiltonians using tensor networks
- Improving the efficiency of variational tensor network algorithms
- Encoding Universal Computation in the Ground States of Ising Lattices
- Phase diagram and exotic spin-spin correlations of anisotropic Ising model on the Sierpiński gasket
- Efficient Decomposition of High-Rank Tensors
- Tensor network method for reversible classical computation
Cited by in corpus (6)
- Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
- Hyper-optimized approximate contraction of tensor networks with arbitrary geometry
- Algorithms for Tensor Network Contraction Ordering
- Avoidance, Adjacency, and Association in Distributed Systems Design
- Scaling of contraction costs for entanglement renormalization algorithms including tensor Trotterization and variational Monte Carlo
- Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm