Corpus ID: 220128174

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}
}
  • Pjotr Buy, Andreas Galanis, +1 author Guus Regts
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • 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

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

    • I. Bezáková, A. Galanis, L. A. Goldberg
    • (ICALP 2019),
    • 2019
    VIEW 2 EXCERPTS
    HIGHLY INFLUENTIAL

    A Deterministic Algorithm for Counting Colorings with 2-Delta Colors

    VIEW 2 EXCERPTS

    Combinatorics and Complexity of Partition Functions

    VIEW 3 EXCERPTS