Hostname: page-component-76d6cb85b7-vdhp9 Total loading time: 0 Render date: 2026-07-14T15:57:43.678Z Has data issue: false hasContentIssue false

Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs

Published online by Cambridge University Press:  07 February 2022

Pjotr Buys
Affiliation:
Korteweg de Vries Institute for Mathematics, University of Amsterdam, Postbus 94248, 1090 GE Amsterdam, The Netherlands; E-mail: pjotr.buys@gmail.com
Andreas Galanis
Affiliation:
Department of Computer Science, University of Oxford, OX1 3QD, UK; E-mail: andreas.galanis@cs.ox.ac.uk
Viresh Patel
Affiliation:
Korteweg de Vries Institute for Mathematics, University of Amsterdam, Postbus 94248, 1090 GE Amsterdam, The Netherlands; E-mail: v.s.patel@uva.nl
Guus Regts
Affiliation:
Korteweg de Vries Institute for Mathematics, University of Amsterdam, Postbus 94248, 1090 GE Amsterdam, The Netherlands; E-mail: guusregts@gmail.com

Abstract

We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter $\lambda $ on the unit circle in the complex plane. 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 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$ and, more generally, on the entire unit circle. For an integer $\Delta \geq 3$ and edge interaction parameter $b\in (0,1)$, we show $\mathsf {\#P}$-hardness for approximating the partition function on graphs of maximum degree $\Delta $ on the arc of the unit circle where the Lee–Yang zeros are dense. This result contrasts with known approximation algorithms when $|\lambda |\neq 1$ or when $\lambda $ is in the complementary arc around $1$ of the unit circle. Our work thus gives a direct connection between the presence/absence of Lee–Yang zeros and the tractability of efficiently approximating the partition function on bounded-degree graphs.

Information

Type
Theoretical Computer Science
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press
Figure 0

Figure 1 An illustration of the union of $\phi _\omega ([0,1])$, where $\omega \in \Omega $ runs over all sequences of length n for $n = 0,1, \dots , 6$ for $\alpha = 7/16$. At each level, starting at level 2, three red intervals are highlighted containing elements $q_1, q_2$ and $q_3$, respectively, such that $q_1 + q_3 = 2q_2$.