Abstract
We study the complexity of approximating the partition function of the q-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum computing and phase transitions in statistical physics, recent work in approximate counting has shown that the behaviour in the complex plane, and more precisely the location of zeros, is strongly connected with the complexity of the approximation problem, even for positive real-valued parameters. Previous work in the complex plane by Goldberg and Guo focused on q = 2, which corresponds to the case of the Ising model; for q > 2, the behaviour in the complex plane is not as well understood and most work applies only to the real-valued Tutte plane. Our main result is a complete classification of the complexity of the approximation problems for all non-real values of the parameters, by establishing #P-hardness results that apply even when restricted to planar graphs. Our techniques apply to all q \(\geq\) 2 and further complement/refine previous results both for the Ising model and the Tutte plane, answering in particular a question raised by Bordewich, Freedman, Lovász and Welsh in the context of quantum computations.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Change history
30 June 2022
"Copyright year updated as 2022 in xml".
References
A. Barvinok (2017). Combinatorics and Complexity of Partition Functions. Algorithms and Combinatorics. Springer International Publishing.
A. Barvinok & G. Regts (2019). Weighted counting of solutions to sparse systems of equations. Combinatorics, Probability and Computing 28(5), 696–719.
I. Bena, M. Droz & A. Lipowski (2005). Statistical mechanics of equilibrium and nonequilibrium phase transitions: the Yang–Lee formalism. International Journal of Modern Physics B 19(29), 4269–4329.
I. Bezáková, A. Galanis, L. A. Goldberg & D. Štefankovič (2020). Inapproximability of the independent set polynomial in the complex plane. SIAM Journal on Computing 49(5), STOC18– 395–STOC18–448. ISSN 0097-5397. URL https://doi.org/10.1137/18M1184485.
I. Bezáková, A. Galanis, L. A. Goldberg & D. Štefankovič (2021). The complexity of approximating the matching polynomial in the complex plane. ACM Transactions on Computation Theory 13(2), Art. 13, 37. ISSN 1942-3454. URL https://doi.org/10.1145/3448645.
M. Bordewich, M. Freedman, L. Lovász & D. Welsh (2005). Approximate counting and quantum computation. Combinatorics, Probability and Computing 14(5-6), 737–754.
R. J. Bradford & J. H. Davenport (1989). Effective tests for cyclotomic polynomials. In Symbolic and algebraic computation, volume 358 of Lecture Notes in Comput. Sci., 244–251. Springer, Berlin.
A. Brandstädt, V. B. Le & J. P. Spinrad (1999). Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
M. Brin & G. Stuck (2002). Introduction to Dynamical Systems. Cambridge University Press.
J. I. Brown, C. Hickman, A. D. Sokal & D. G. Wagner (2001). On the chromatic roots of generalized theta graphs. Journal of Combinatorial Theory. Series B 83(2), 272–297.
I. Z. Emiris, B. Mourrain & E. P. Tsigaridas (2008). Real algebraic numbers: Complexity Analysis and Experimentation. In Reliable Implementation of Real Number Algorithms: Theory and Practice, 57– 82. Springer.
L. A. Goldberg & H. Guo (2017). The complexity of approximating complex-valued Ising and Tutte partition functions. Computational Complexity 26(4), 765–833.
L. A. Goldberg & M. Jerrum (2008). Inapproximability of the Tutte polynomial. Information and Computation 206(7), 908–929.
L. A. Goldberg & M. Jerrum (2012a). Approximating the partition function of the ferromagnetic Potts model. Journal of the ACM 59(5), Art. 25, 31.
L. A. Goldberg & M. Jerrum (2012b). Inapproximability of the Tutte polynomial of a planar graph. Computational Complexity 21(4), 605–642.
L. A. Goldberg & M. Jerrum (2014). The complexity of computing the sign of the Tutte polynomial. SIAM Journal on Computing 43(6), 1921–1952.
L. A. Goldberg & M. Jerrum (2019). Approximating Pairwise Correlations in the IsingModel. ACM Transactions on Computation Theory 11(4), 23.
H. Guo, C. Liao, P. Lu & C. Zhang (2021). Zeros of Holant problems: locations and algorithms. ACM Transactions on Algorithms 17(1), Art. 4, 25. ISSN 1549-6325. URL https://doi.org/10.1145/3418056.
H. Guo, J. Liu & P. Lu (2020). Zeros of Ferromagnetic 2-Spin Systems. In Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’20, 181–192. USA.
A. Harrow, S. Mehraban & M. Soleimanifar (2020). Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 378–386.
O. J. Heilmann & E. H. Lieb (1972). Theory of monomer-dimer systems. Communications in Mathematical Physics 25(3), 190–232.
Bill Jackson (1993). A zero-free interval for chromatic polynomials of graphs. Combinatorics, Probability and Computing 2(3), 325–336. ISSN 0963-5483. URL https://doi.org/10.1017/S0963548300000705.
F. Jaeger, D. L. Vertigan & D. J. A. Welsh (1990). On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society 108(1), 35–53.
M. Jerrum & A. Sinclair (1993). Polynomial-time approximation algorithms for the Ising model. SIAM Journal on Computing 22(5), 1087–1116.
R. Kannan, A. K. Lenstra & L. Lovász (1988). Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers. Mathematics of Computation 50(181), 235–250.
K.-I Ko (1991). Complexity theory of real functions. Progress in Theoretical Computer Science. Birkh¨auser Boston, Inc., Boston, MA.
G. Kuperberg (2015). How hard is it to approximate the Jones polynomial? Theory of Computing 11, 183–219.
E. H. Lieb & A. D. Sokal (1981). A general Lee-Yang theorem for one-component and multicomponent ferromagnets. Communications in Mathematical Physics 80(2), 153–179.
J. Liu, A. Sinclair & P. Srivastava (2019). A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. In IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS 2019), 1380– 1404.
J. Liu, A. Sinclair & P. Srivastava (2019a). Fisher zeros and correlation decay in the Ising model. Journal of Mathematical Physics 60(10), 103 304.
J. Liu, A. Sinclair & P. Srivastava (2019b). The Ising partition function: Zeros and deterministic approximation. Journal of Statistical Physics 174(2), 287–315.
V. Patel & G. Regts (2017). Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials. SIAM Journal on Computing 46(6), 1893–1919.
H. Peters & G. Regts (2018). Location of zeros for the partition function of the Ising model on bounded degree graphs. Journal of the London Mathematical Society.
H. Peters & G. Regts (2019). On a Conjecture of Sokal Concerning Roots of the Independence Polynomial. Michigan Mathematical Journal 68(1), 33–55.
R. B. Potts (1952). Some generalized order-disorder transformations. Proceedings of the Cambridge Philosophical Society 48, 106–109.
J. S. Provan & M. O. Ball (1983). The complexity of counting cuts and of computing the probability that a graph is connected. SIAM Journal on Computing 12(4), 777–788.
A. D. Sokal (2005). The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In Surveys in combinatorics 2005, volume 327 of London Math. Soc. Lecture Note Ser., 173–226. Cambridge Univ. Press, Cambridge.
E. M. Stein & R. Shakarchi (2010). Complex analysis, volume 2. Princeton University Press.
I. Stewart (2004). Galois Theory. Chapman & Hall/CRC Mathematics. Chapman & Hall/CRC, Boca Raton, FL, 3rd edition.
A. W. Strzeboński (1997). Computing in the field of complex algebraic numbers. Journal of Symbolic Computation 24(6), 647–656.
M. B. Thistlethwaite (1987). A spanning tree expansion of the Jones polynomial. Topology 26(3), 297–309.
D. Vertigan (2005). The computational complexity of Tutte invariants for planar graphs. SIAM Journal on Computing 35(3), 690–712.
M. Waldschmidt (2000). Diophantine approximation on linear algebraic groups, volume 326 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin. Transcendence properties of the exponential function in several variables.
D. J. A. Welsh (1993). Complexity: knots, colourings and counting, volume 186 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge.
C.-N. Yang & T.-D. Lee (1952). Statistical theory of equations of state and phase transitions. I. Theory of condensation. Physical Review 87(3), 404.
C. K. Yap (2000). Fundamental problems of algorithmic algebra. Oxford University Press, New York.
Acknowledgements
We thank Ben Green, Joel Ouaknine and Oliver Riordan for useful discussions on Section 6.1. We also thank Miriam Backens for useful conversations and suggestions about this work. A short preliminary version without proofs has appeared on the proceedings of MFCS 2020. The third author is supported by an Oxford- DeepMind Graduate Scholarship and a EPSRC Doctoral Training Partnership.
Funding
Open Access funding enabled and organized by Projekt DEAL
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Galanis, A., Goldberg, L.A. & Herrera-Poyatos, A. The complexity of approximating the complex-valued Potts model. comput. complex. 31, 2 (2022). https://doi.org/10.1007/s00037-021-00218-x
Received:
Published:
DOI: https://doi.org/10.1007/s00037-021-00218-x