On the computational complexity of Ising spin glass models

In a spin glass with Ising spins, the problems of computing the magnetic partition function and finding a ground state are studied. In a finite two-dimensional lattice these problems can be solved by algorithms that require a number of steps bounded by a polynomial function of the size of the lattice. In contrast to this fact, the same problems are shown to belong to the class of NP-hard problems, both in the two-dimensional case within a magnetic field, and in the three-dimensional case. NP-hardness of a problem suggests that it is very unlikely that a polynomial algorithm could exist to solve it.

[1]  L. Onsager.  Crystal statistics. I. A two-dimensional model with an order-disorder transition , 1944 .

[2]  P. W. Kasteleyn.  The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice , 1961 .

[3]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[4]  M. Fisher.  On the Dimer Solution of Planar Ising Models , 1966 .

[5]  Frank Harary,et al.  Graph Theory , 2016 .

[6]  C. Berge.  Graphes et hypergraphes , 1970 .

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[9]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[10]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[11]  F. Hadlock,et al.  Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[12]  S. Kirkpatrick.  Frustration and ground-state degeneracy in spin glasses , 1977 .

[13]  Mihalis Yannakakis,et al.  Node-and edge-deletion NP-complete problems , 1978, STOC.

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  W. Cunningham,et al.  A primal algorithm for optimum matching , 1978 .

[16]  J. Leblanc.  THÈSE DE 3ÈME CYCLE , 1978 .

[17]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[18]  L. Bieche,et al.  On the ground states of the frustration model of a spin glass by a matching method of graph theory , 1980 .

[19]  F. Barahona,et al.  Morphology of ground states of two-dimensional frustration model , 1982 .