Block belief propagation algorithm for two-dimensional tensor networks
Abstract
Belief propagation is a well-studied algorithm for approximating local marginals of multivariate probability distribution over complex networks, while tensor network states are powerful tools for quantum and classical many-body problems. Building on a recent connection between the belief propagation algorithm and the problem of tensor network contraction, we propose a block belief propagation algorithm for contracting two-dimensional tensor networks and approximating the ground state of systems. The advantages of our method are three-fold: 1) the same algorithm works for both finite and infinite systems; 2) it allows natural and efficient parallelization; 3) given its flexibility it would allow to deal with different unit cells. As applications, we use our algorithm to study the Heisenberg and transverse Ising models, and show that the accuracy of the method is on par with state-of-the-art results.
Cite
@article{arxiv.2301.05844,
title = {Block belief propagation algorithm for two-dimensional tensor networks},
author = {Chu Guo and Dario Poletti and Itai Arad},
journal= {arXiv preprint arXiv:2301.05844},
year = {2023}
}
Comments
12 pages, 13 figures