Optimizing glassy p-spin models
Disordered Systems and Neural Networks
2015-03-17 v2
Abstract
Computing the ground state of Ising spin-glass models with p-spin interactions is, in general, an NP-hard problem. In this work we show that unlike in the case of the standard Ising spin glass with two-spin interactions, computing ground states with p=3 is an NP-hard problem even in two space dimensions. Furthermore, we present generic exact and heuristic algorithms for finding ground states of p-spin models with high confidence for systems of up to several thousand spins.
Keywords
Cite
@article{arxiv.1010.2524,
title = {Optimizing glassy p-spin models},
author = {Creighton K. Thomas and Helmut G. Katzgraber},
journal= {arXiv preprint arXiv:1010.2524},
year = {2015}
}
Comments
10 pages, 8 figures