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

@article{Buy2020LeeYangZA, title={Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs}, author={Pjotr Buy and Andreas Galanis and Viresh Patel and Guus Regts}, journal={ArXiv}, year={2020}, volume={abs/2006.14828} }

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 |λ| 6 = 1 by Liu, Sinclair, and Srivastava. Here, we focus on the unresolved… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 48 REFERENCES

## Polynomial-Time Approximation Algorithms for the Ising Model

VIEW 10 EXCERPTS

HIGHLY INFLUENTIAL

## Random cluster dynamics for the Ising model is rapidly mixing

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## The Worm Process for the Ising Model is Rapidly Mixing

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Štefankovič, The complexity of approximating the matching polynomial in the complex plane, 46th International Colloquium on Automata, Languages, and Programming

VIEW 2 EXCERPTS

HIGHLY INFLUENTIAL

## Combinatorics and Complexity of Partition Functions

VIEW 3 EXCERPTS