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...
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 |
Similar Items
-
Gaussian Belief Propagation for Solving Network Utility Maximization with Delivery Contracts
by: Shengbin Liao, et al.
Published: (2019-07-01) -
Convergence of a Belief Propagation Algorithm for Biological Networks
by: Sang-Mok Choo, et al.
Published: (2019-01-01) -
Sign Problem in Tensor-Network Contraction
by: Jielun Chen, et al.
Published: (2025-01-01) -
Algebraically contractible topological tensor network states
by: Denny, S, et al.
Published: (2011) -
Towards a polynomial algorithm for optimal contraction sequence of tensor networks from trees
by: Xu, Jianyu, et al.
Published: (2020)