Classification on the Computational Complexity of Spin Models [article]

Shi-Xin Zhang
<span title="2019-11-11">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="">arXiv:1911.04122v1</a> <a target="_blank" rel="external noopener" href="">fatcat:b3sefrnk5ff2lbp7e2j2qpr2pm</a> </span>
<a target="_blank" rel="noopener" href="" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>