DeepAI AI Chat
Log In Sign Up

Classification on the Computational Complexity of Spin Models

by   Shi-Xin Zhang, et al.

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.


page 1

page 2

page 3

page 4


Computational complexity of the Rydberg blockade in two dimensions

We discuss the computational complexity of finding the ground state of t...

Computational Complexity of Quadratic Unconstrained Binary Optimization

In this paper, we study the computational complexity of the quadratic un...

The importance of the spectral gap in estimating ground-state energies

The field of quantum Hamiltonian complexity lies at the intersection of ...

Quantum Pseudorandomness and Classical Complexity

We construct a quantum oracle relative to which 𝖡𝖰𝖯 = 𝖰𝖬𝖠 but cryptograp...

Combinators: A Centennial View

We give a modern computational introduction to the S,K combinators inven...

Computational Complexity and the Nature of Quantum Mechanics

Quantum theory (QT) has been confirmed by numerous experiments, yet we s...

Relating complexities for the reflexive study of complex systems

Several approaches and corresponding definitions of complexity have been...