跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-19 06:59 · 全站最近入库:2026-11-19 06:59各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 09:44 — 2026-11-19 09:44(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-19 06:59最近发现新增版本:2026-11-19 06:59库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,871 已收录论文22,375 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-19 06:57(北京时间)
版本更新 · v3arXiv:2506.16250

Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs

Yuwen Huang, Pascal O. Vontobel

原文摘要

For standard factor graphs (S-FGs), whose local functions are nonnegative-real valued, a popular approximation of the partition function is given by the Bethe approximation, which is also known as the Bethe partition function. Vontobel gave a combinatorial characterization of the Bethe partition function with the help of graph covers. The proof of this characterization heavily relied on the method of types. In this paper, we study double-edge factor graphs (DE-FGs), whose local functions are complex valued and satisfy certain positive-semidefinite constraints. DE-FGs and their partition functions are particularly relevant to quantum information processing. Approximating the partition function of a DE-FG is more difficult than approximating the partition function of an S-FG because the DE-FG partition function is a sum of complex values rather than nonnegative-real values. We develop a Bethe approximation of the partition function of a DE-FG based on sum-product-algorithm (SPA) fixed points. However, one cannot directly apply the method of types to prove a similar graph-cover-based combinatorial characterization of the Bethe partition function as in the case of S-FGs. Despite this, we establish such a combinatorial characterization for a class of DE-FGs that satisfy an easily checkable condition. Towards proving this characterization, we apply a suitable loop-calculus transform (LCT) to DE-FGs. Originally, the LCT was introduced by Chertkov and Chernyak as a special linear transform for S-FGs and later extended by Mori. Our proposed LCT is applicable to both S-FGs and DE-FGs and generalizes prior versions by handling zero-valued SPA fixed-point message components, which are common in DE-FGs. Supported by numerical results, we conjecture that the graph-cover-based combinatorial characterization of the Bethe partition function holds more broadly for DE-FGs.

quant-ph · cs.IT