arXiv:1911.04122 [cond-mat.dis-nn]AbstractReferencesReviewsResources
Classification on the Computational Complexity of Spin Models
Published 2019-11-11Version 1
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types of spin coupling. We further discuss about the implications of NP-complete Hamiltonian models in physics and the fundamental limitations of all numerical methods imposed by such models. We conclude by a brief discussion on the picture when quantum computation and quantum complexity theory are included.
Comments: 4.6 pages
Related articles: Most relevant | Search more
arXiv:1409.2290 [cond-mat.dis-nn] (Published 2014-09-08)
Computational Complexity, Phase Transitions, and Message-Passing for Community Detection
arXiv:2501.01107 [cond-mat.dis-nn] (Published 2025-01-02)
On Computational Complexity of 3D Ising Spin Glass: Lessons from D-Wave Annealer
arXiv:1408.1341 [cond-mat.dis-nn] (Published 2014-08-06)
Classical spin models with broken symmetry: Random Field Induced Order and Persistence of spontaneous magnetization in presence of a random field