加权Fibonacci门的FPTAS及其应用
FPTAS for Weighted Fibonacci Gates and Its Applications
摘要:
Fibonacci门问题作为全息算法求解其它问题的计算基元,在Holant和CSP框架的精确计数二分法中起着重要作用。我们将它们推广到加权的情况,并允许每个顶点函数有不同的参数,这是一个更广泛的家庭和#P-难以精确计数。我们设计了一个完全多项式时间近似方案(FPTAS)的相关衰减技术的推广。这是第一个确定性的FPTAS近似计数在一般Holant框架没有一个度的界限。我们还正式介绍全息约简在近似计数的研究和这些加权Fibonacci门问题作为计算原语近似计数。在全息约化下,我们得到了其他Holant问题和自旋问题的FPTAS。其中一个重要的应用是为大范围的铁磁两态自旋系统开发FPTAS。这是第一个确定性的FPTAS在铁磁范围内的两个状态的自旋系统没有度约束。除了这些算法,我们还开发了一些新的工具和技术来建立相关衰减特性,这是适用于其他问题。
英文摘要:
Fibonacci gate problems have severed as computation primitives to solve other problems by holographic algorithm and play an important role in the dichotomy of exact counting for Holant and CSP frameworks. We generalize them to weighted cases and allow each vertex function to have different parameters, which is a much boarder family and #P-hard for exactly counting. We design a fully polynomial-time approximation scheme (FPTAS) for this generalization by correlation decay technique. This is the first deterministic FPTAS for approximate counting in the general Holant framework without a degree bound. We also formally introduce holographic reduction in the study of approximate counting and these weighted Fibonacci gate problems serve as computation primitives for approximate counting. Under holographic reduction, we obtain FPTAS for other Holant problems and spin problems. One important application is developing an FPTAS for a large range of ferromagnetic two-state spin systems. This is the first deterministic FPTAS in the ferromagnetic range for two-state spin systems without a degree bound. Besides these algorithms, we also develop several new tools and techniques to establish the correlation decay property, which are applicable in other problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。