当前位置: X-MOL 学术arXiv.cs.CC › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs
arXiv - CS - Computational Complexity Pub Date : 2020-06-26 , DOI: arxiv-2006.14828
Pjotr Buys, Andreas Galanis, Viresh Patel, Guus Regts

We study the computational complexity of approximating the partition function of the ferromagnetic Ising model in the Lee-Yang circle of zeros given by $|\lambda|=1$, where $\lambda$ is the external field of the model. Complex-valued parameters for the Ising model are relevant for quantum circuit computations and phase transitions in statistical physics, but have also been key in the recent deterministic approximation scheme for all $|\lambda|\neq 1$ by Liu, Sinclair, and Srivastava. Here, we focus on the unresolved complexity picture on the unit circle, and on the tantalising question of what happens in the circular arc around $\lambda=1$, where on one hand the classical algorithm of Jerrum and Sinclair gives a randomised approximation scheme on the real axis suggesting tractability, and on the other hand the presence of Lee-Yang zeros alludes to computational hardness. Our main result establishes a sharp computational transition at the point $\lambda=1$; in fact, our techniques apply more generally to the whole unit circle $|\lambda|=1$. We show #P-hardness for approximating the partition function on graphs of maximum degree $\Delta$ when $b$, the edge-interaction parameter, is in the interval $(0,\frac{\Delta-2}{\Delta}]$ and $\lambda$ is a non-real on the unit circle. This result contrasts with known approximation algorithms when $|\lambda|\neq 1$ or $b\in (\frac{\Delta-2}{\Delta},1)$, and shows that the Lee-Yang circle of zeros is computationally intractable, even on bounded-degree graphs.

中文翻译:

Lee-Yang 零点和铁磁 Ising 模型在有界度图上的复杂性

我们研究了在由 $|\lambda|=1$ 给出的 Lee-Yang 零点圆中逼近铁磁 Ising 模型的配分函数的计算复杂性,其中 $\lambda$ 是模型的外场。Ising 模型的复值参数与统计物理学中的量子电路计算和相变相关,但在最近由 Liu、Sinclair 和 Srivastava 提出的所有 $|\lambda|\neq 1$ 的确定性近似方案中也很关键. 在这里,我们关注单位圆上未解决的复杂性问题,以及围绕 $\lambda=1$ 的圆弧中会发生什么的诱人问题,一方面,Jerrum 和 Sinclair 的经典算法给出了一个随机近似方案在表示易处理性的实轴上,另一方面,Lee-Yang 零点的存在暗示了计算难度。我们的主要结果在 $\lambda=1$ 点建立了一个急剧的计算转换;事实上,我们的技术更普遍地适用于整个单位圆 $|\lambda|=1$。当边缘交互参数 $b$ 在区间 $(0,\frac{\Delta-2}{\Delta }]$ 和 $\lambda$ 在单位圆上是非实数。当 $|\lambda|\neq 1$ 或 $b\in (\frac{\Delta-2}{ \Delta},1)$,并表明 Lee-Yang 零点圆在计算上是难以处理的,即使在有界度图上也是如此。我们的技术更普遍地适用于整个单位圆 $|\lambda|=1$。当边缘交互参数 $b$ 在区间 $(0,\frac{\Delta-2}{\Delta }]$ 和 $\lambda$ 在单位圆上是非实数。当 $|\lambda|\neq 1$ 或 $b\in (\frac{\Delta-2}{ \Delta},1)$,并表明 Lee-Yang 零点圆在计算上是难以处理的,即使在有界度图上也是如此。我们的技术更普遍地适用于整个单位圆 $|\lambda|=1$。当边缘交互参数 $b$ 在区间 $(0,\frac{\Delta-2}{\Delta }]$ 和 $\lambda$ 在单位圆上是非实数。当 $|\lambda|\neq 1$ 或 $b\in (\frac{\Delta-2}{ \Delta},1)$,并表明 Lee-Yang 零点圆在计算上是难以处理的,即使在有界度图上也是如此。
更新日期:2020-07-06
down
wechat
bug