Gabriel Woolls, Shahin Jahanbani, Adarsh Pashikanti, Matthew T. Fishman, Joseph Tindall, Michael P. Zaletel (Sep 09 2026).
Abstract: We introduce "matrix product belief propagation" (MP-BP) as a controlled method for the approximate contraction of two-dimensional tensor networks and graphical models, which generically leads to a quadratic reduction of errors relative to existing methods: at similar computational effort, the number of accurate digits is asymptotically doubled. For infinite systems, MP-BP can be understood as a practical implementation of Baxter's corner-transfer-matrix method; for reflection-symmetric networks, it further coincides with the boundary matrix-product-state and corner-transfer-matrix renormalization group algorithms as conventionally implemented. In the limit of unit matrix-product rank, MP-BP is equivalent to belief propagation, and more generally, can be understood as a generalization of BP in which the "messages" live on surfaces and are assumed to have a matrix-product factorization. We further extend the quadratic improvement to the computation of expectation values, and numerically demonstrate the qualitatively improved convergence for a variety of classical and quantum 2D tensor network problems.
