发表机构
National Science Center "Kharkiv Institute of Physics and Technology"; Haiqu, Inc.; V.N. Karazin Kharkiv National University（哈尔科夫物理与技术国家科学中心; 海奎公司; V.N.卡拉金哈尔科夫国立大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文提出将角传递矩阵重正化群（CTMRG）转化为平面图上的局部消息传递方程，求解得到消息张量与角矩阵以构造 MPS 环境，并在多种晶格上验证其优于置信传播。
AI 中文摘要
我们将角传递矩阵方程以及基于这些方程的角传递矩阵重正化群，表述为一般平面图上的局部方程组。这些方程仅依赖于平面图的局部子图，并通过一致的方式拼接起来以描述整个图。求解这些方程可得到消息张量和角矩阵，它们可用于为任何连通子图构造 MPS 环境。我们在铁磁伊辛模型上，对多种无限晶格（包括双曲晶格）和有限图测试了所提出的方程，并发现其相对于置信传播有系统性改进。
英文摘要
We formulate the corner transfer matrix equations, and the corner transfer matrix renormalization group built on them, as a set of local equations on general planar graphs. These equations depend only on the local subgraphs of the planar graph and are glued together consistently to describe the whole graph. Solving them yields message tensors and corner matrices, which can be used to construct an MPS environment for any connected subgraph. We test the proposed equations on the ferromagnetic Ising model, on a variety of infinite lattices (including hyperbolic ones) and on finite graphs, and find systematic improvement over belief propagation.
CommentsComments welcome; 54 pages, 36 figures
