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

Abstract

We study the computational complexity of approximating the partition function of the ferromagnetic Ising model in the Lee-Yang circle of zeros given by |λ| = 1, where λ 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 |λ| = 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 λ = 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 λ = 1; in fact, our techniques apply more generally to the whole unit circle |λ| = 1. We show #P-hardness for approximating the partition function on graphs of maximum degree ∆ when b, the edgeinteraction parameter, is in the interval (0, ∆−2 ∆ ] and λ is a non-real on the unit circle. This result contrasts with known approximation algorithms when |λ| = 1 or b ∈ ( ∆−2 ∆ , 1), and shows that the Lee-Yang circle of zeros is computationally intractable, even on bounded-degree graphs.Our inapproximability result is based on constructing rooted tree gadgets via a detailed understanding of the underlying dynamical systems, which are further parameterised by the degree of the root. The ferromagnetic Ising model has radically different behaviour than previously considered antiferromagnetic models, and showing our #P-hardness results in the whole Lee-Yang circle requires a new high-level strategy to construct the gadgets. To this end, we devise an elaborate inductive procedure to construct the required gadgets by taking into account the dependence between the degree of the root of the tree and the magnitude of the derivative at the fixpoint of the corresponding dynamical system.Date: July 6, 2020. 1 The parametrisation of the Ising model in terms of δ(σ) follows the closely related works [33, 40]; if instead the model is defined in terms of the number of edges with the same spins the edge-interaction parameter 1/b ∈ (1, ∞) is obtained, whose logarithm is known as the inverse temperature in the physics literature.

Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial

“…Remark 1.2. We note that [PR20] and [BGPR20] combined implicitly contain similar equivalent characterizations for the Lee-Yang zeros of the partition function of the ferromagnetic Ising model on bounded degree graphs. In that setting the complement of the zero-locus is in fact connected when the edge interaction parameter is sub-critical.…”