Parallel computing of Edwards–Anderson model

Abstract

An algorithm for parallel exact calculation of the ground state of a two-dimensional Edwards–Anderson model with free boundary conditions is given. The running time of the algorithm grows exponentially as the side of the lattice square increases. If one side of the lattice is fixed, the running time grows polynomially with increasing size of the other side. The method may find application in the theory of spin glasses, in the field of quantum computing. Performance data for the bimodal distribution is given. The distribution of spin bonds can be either bimodal or Gaussian. The method makes it possible to compute systems up to a size of 40x40.