Lee-yang zeros and the complexity of the ferromagnetic ising model on bounded-degree graphs

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.