• Corpus ID: 207852894

Classification on the Computational Complexity of Spin Models

  title={Classification on the Computational Complexity of Spin Models},
  author={Shixin Zhang},
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… 
1 Citations

Tables from this paper

Classical simulation of boson sampling with sparse output

This work shows explicit classical methods of finding boson sampling distributions when they are known to be highly sparse and indicates that boson samplers may be advantageous in dealing with problems which are not highly sparse.



On the computational complexity of Ising spin glass models

In a spin glass with Ising spins, the problems of computing the magnetic partition function and finding a ground state are studied and are shown to belong to the class of NP-hard problems, both in the two-dimensional case within a magnetic field, and in the three-dimensional cases.

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations

It is proved that the sign problem is nondeterministic polynomial (NP) hard, implying that a generic solution of the sign problems would also solve all problems in the complexity class NP inPolynomial time.

Computational complexity of interacting electrons and fundamental limitations of density functional theory

Using arguments from computational complexity theory, fundamental limitations are found for how efficient it is to calculate the ground-state energy of many-electron systems using density functional

The Statistics of Dimers on a Lattice

The number of ways in which a finite quadratic lattice (with edges or with periodic boundary conditions) can be fully covered with given numbers of “horizontal” and “vertical” dimers is rigorously

Sign-Problem-Free Fermionic Quantum Monte Carlo: Developments and Applications

Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further our understanding of essential

QMA-complete problems

An overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date are given and problems of interest to all of these professions can be found here.

Sign problem in the numerical simulation of many-electron systems.

A recent proposal for dealing with the sign problem due to Sorella leads to an uncontrolled approximation for the ground-state energy, and a method for calculating the correction needed to make it exact is presented.

The random field Ising model : algorithmic complexity and phase transition

The random field Ising model (RFIM) is investigated from the complexity point of view. We prove that finding a ground state of the ferromagnetic RFIM is a polynomial (P) optimization problem in any

The Monte Carlo Method in Condensed Matter Physics

Vectorisation of Monte Carlo programs for lattice models using supercomputers.- Parallel algorithms for statistical physics problems.- New monte carlo methods for improved efficiency of computer

On the Dimer Solution of Planar Ising Models

Derivations of the partition function of the Ising model on a general planar lattice L, which proceed via an associated dimer problem and use Pfaffians, are simplified by constructing a lattice LΔ