Loop Series Expansions for Tensor Networks
arXiv:2409.03108 · doi:10.1103/vqks-cr6x
Abstract
Belief propagation (BP) can be a useful tool to approximately contract a tensor network, provided that the contributions from any closed loops in the network are sufficiently weak. In this manuscript we describe how a loop series expansion can be applied to systematically improve the accuracy of a BP approximation to a tensor network contraction, in principle converging arbitrarily close to the exact result. More generally, our result provides a framework for expanding a tensor network as a sum of component networks in a hierarchy of increasing complexity. We benchmark this proposal for the contraction of iPEPS, either representing the ground state of an AKLT model or with randomly defined tensors, where it is shown to improve in accuracy over standard BP by several orders of magnitude whilst incurring only a minor increase in computational cost. These results indicate that the proposed series expansions could be a useful tool to accurately evaluate tensor networks in cases that otherwise exceed the limits of established contraction routines.
Main text: 6 pages, 5 figures. Appendices: 8 pages, 7 figures. Revised version contains improved results and an additional appendix entry
References in corpus (44)
- The density-matrix renormalization group
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Tensor renormalization group approach to 2D classical lattice models
- Tensor networks for complex quantum systems
- Competing states in the t-J model: uniform d-wave state versus stripe state
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- Simulation of two dimensional quantum systems on an infinite lattice revisited: corner transfer matrix for tensor contraction
- Renormalization and tensor product states in spin chains and lattices
- Tensor Network Renormalization
- The computational complexity of PEPS
- Percolation on sparse networks
- Tensor network states and geometry
- Algorithms for finite Projected Entangled Pair States
- What limits the simulation of quantum computers?
- Lecture Notes of Tensor Network Contractions
- Loop series for discrete statistical models on graphs
- Loop optimization for tensor network renormalization
- Entanglement renormalization in two spatial dimensions
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Quantum Graphical Models and Belief Propagation
- Solving the sampling problem of the Sycamore quantum circuits
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Isometric Tensor Network States in Two Dimensions
- The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
- Tensor renormalization of quantum many-body systems using projected entangled simplex states
- Faster Methods for Contracting Infinite 2D Tensor Networks
- Unifying Projected Entangled Pair States contractions
- Multi-scale Entanglement Renormalization Ansatz in Two Dimensions: Quantum Ising Model
- Renormalization of tensor networks using graph independent local truncations
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Loop Calculus in Statistical Physics and Information Science
- Gauge fixing, canonical forms and optimal truncations in tensor networks with closed loops
- A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
- Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs
- qTorch: The Quantum Tensor Contraction Handler
- Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction
- Gauging tensor networks with belief propagation
- Tensor Networks contraction and the Belief Propagation algorithm
- An adaptive algorithm for quantum circuit simulation
- Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs
- Block belief propagation algorithm for two-dimensional tensor networks