无规Max-CSP从自旋玻璃继承了晶体硬度
Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses
摘要:
研究了不可满足域中的随机约束满足问题。我们与任何Max-CSP的近最优解的结构相关的超立方体上的相关自旋玻璃,使用Guerra-Toninelli插值从统计物理。CSP谓词的噪声稳定性多项式是相关自旋玻璃的混合多项式,直到常数。我们证明了两个主要结果:1)我们将随机Max-CSP中可以满足的约束的最大分数与相应自旋玻璃的基态能量密度联系起来。由于后者的值可以用Parisi公式计算,我们提供了一些流行的CSP的数值。2)我们证明了一个Max-CSP具有广义版本的重叠间隙属性的当且仅当同样适用于相应的自旋玻璃。我们转移了Huang等人的结果。[arXiv:2110.07847,2021]以阻碍在一大类Max-CSP上具有重叠集中的算法。这直接包括局部经典和局部量子算法。
英文摘要:
We study random constraint satisfaction problems (CSPs) in the unsatisfiable regime. We relate the structure of near-optimal solutions for any Max-CSP to that for an associated spin glass on the hypercube, using the Guerra-Toninelli interpolation from statistical physics. The noise stability polynomial of the CSP's predicate is, up to a constant, the mixture polynomial of the associated spin glass. We prove two main consequences: 1) We relate the maximum fraction of constraints that can be satisfied in a random Max-CSP to the ground state energy density of the corresponding spin glass. Since the latter value can be computed with the Parisi formula, we provide numerical values for some popular CSPs. 2) We prove that a Max-CSP possesses generalized versions of the overlap gap property if and only if the same holds for the corresponding spin glass. We transfer results from Huang et al. [arXiv:2110.07847, 2021] to obstruct algorithms with overlap concentration on a large class of Max-CSPs. This immediately includes local classical and local quantum algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。