Tensor networks contraction and the belief propagation algorithm

Belief propagation is a well-studied message-passing algorithm that runs over graphical models and can be used for approximate inference and approximation of local marginals. The resulting approximations are equivalent to the Bethe-Peierls approximation of statistical mechanics. Here, we show how th...

Full description

Bibliographic Details
Main Authors: R. Alkabetz, I. Arad
Format: Article
Language:English
Published: American Physical Society 2021-04-01
Series:Physical Review Research
Online Access:http://doi.org/10.1103/PhysRevResearch.3.023073
_version_ 1827285806202486784
author R. Alkabetz
I. Arad
author_facet R. Alkabetz
I. Arad
author_sort R. Alkabetz
collection DOAJ
description Belief propagation is a well-studied message-passing algorithm that runs over graphical models and can be used for approximate inference and approximation of local marginals. The resulting approximations are equivalent to the Bethe-Peierls approximation of statistical mechanics. Here, we show how this algorithm can be adapted to the world of projected-entangled-pair-state tensor networks and used as an approximate contraction scheme. We further show that the resultant approximation is equivalent to the “mean field” approximation that is used in the simple-update algorithm, thereby showing that the latter is essentially the Bethe-Peierls approximation. This shows that one of the simplest approximate contraction algorithms for tensor networks is equivalent to one of the simplest schemes for approximating marginals in graphical models in general and paves the way for using improvements of belief propagation as tensor networks algorithms.
first_indexed 2024-04-24T10:20:46Z
format Article
id doaj.art-aff3c0a74ae04488b962946ebdcf0269
institution Directory Open Access Journal
issn 2643-1564
language English
last_indexed 2024-04-24T10:20:46Z
publishDate 2021-04-01
publisher American Physical Society
record_format Article
series Physical Review Research
spelling doaj.art-aff3c0a74ae04488b962946ebdcf02692024-04-12T17:09:27ZengAmerican Physical SocietyPhysical Review Research2643-15642021-04-013202307310.1103/PhysRevResearch.3.023073Tensor networks contraction and the belief propagation algorithmR. AlkabetzI. AradBelief propagation is a well-studied message-passing algorithm that runs over graphical models and can be used for approximate inference and approximation of local marginals. The resulting approximations are equivalent to the Bethe-Peierls approximation of statistical mechanics. Here, we show how this algorithm can be adapted to the world of projected-entangled-pair-state tensor networks and used as an approximate contraction scheme. We further show that the resultant approximation is equivalent to the “mean field” approximation that is used in the simple-update algorithm, thereby showing that the latter is essentially the Bethe-Peierls approximation. This shows that one of the simplest approximate contraction algorithms for tensor networks is equivalent to one of the simplest schemes for approximating marginals in graphical models in general and paves the way for using improvements of belief propagation as tensor networks algorithms.http://doi.org/10.1103/PhysRevResearch.3.023073
spellingShingle R. Alkabetz
I. Arad
Tensor networks contraction and the belief propagation algorithm
Physical Review Research
title Tensor networks contraction and the belief propagation algorithm
title_full Tensor networks contraction and the belief propagation algorithm
title_fullStr Tensor networks contraction and the belief propagation algorithm
title_full_unstemmed Tensor networks contraction and the belief propagation algorithm
title_short Tensor networks contraction and the belief propagation algorithm
title_sort tensor networks contraction and the belief propagation algorithm
url http://doi.org/10.1103/PhysRevResearch.3.023073
work_keys_str_mv AT ralkabetz tensornetworkscontractionandthebeliefpropagationalgorithm
AT iarad tensornetworkscontractionandthebeliefpropagationalgorithm