DeepAI AI Chat
Log In Sign Up

Classification on the Computational Complexity of Spin Models

11/11/2019
by   Shi-Xin Zhang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/13/2018

Computational complexity of the Rydberg blockade in two dimensions

We discuss the computational complexity of finding the ground state of t...
09/21/2021

Computational Complexity of Quadratic Unconstrained Binary Optimization

In this paper, we study the computational complexity of the quadratic un...
07/22/2020

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

The field of quantum Hamiltonian complexity lies at the intersection of ...
03/16/2021

Quantum Pseudorandomness and Classical Complexity

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

Combinators: A Centennial View

We give a modern computational introduction to the S,K combinators inven...
02/12/2019

Computational Complexity and the Nature of Quantum Mechanics

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

Relating complexities for the reflexive study of complex systems

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