Related papers: Exact Ground States of Large Two-Dimensional Plana…
As spin glass materials have extremely slow dynamics, devious numerical methods are needed to study low-temperature states. A simple and fast optimization version of the classical Kasteleyn treatment of the Ising model is described and…
Large numbers of ground states of two-dimensional Ising spin glasses with periodic boundary conditions in both directions are calculated for sizes up to 40^2. A combination of a genetic algorithm and Cluster-Exact Approximation is used. For…
Computing the ground state of Ising spin-glass models with p-spin interactions is, in general, an NP-hard problem. In this work we show that unlike in the case of the standard Ising spin glass with two-spin interactions, computing ground…
We consider whether it is possible to find ground states of frustrated spin systems by solving them locally. Using spin glass physics and Imry-Ma arguments in addition to numerical benchmarks we quantify the power of such local solution…
Ground states of 3d EA Ising spin glasses are calculated for sizes up to $14^3$ using a combination of genetic algorithms and cluster-exact approximation . The distribution $P(|q|)$ of overlaps is calculated. For increasing size the width…
Using an efficient polynomial-time ground state algorithm we investigate the Ising spin glass state at zero temperature in two dimensions. For large sizes, we show that the spin state in a central region is independent of the interactions…
We present an algorithm which calculates groundstates of Ising spin glasses approximately. It works by randomly selecting clusters of spins which exhibit no frustrations. The spins which were not selected, contribute to the local fields of…
Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time…
We investigate the performance of the recently proposed stationary Fokker-Planck sampling method considering a combinatorial optimization problem from statistical physics. The algorithmic procedure relies upon the numerical solution of a…
We introduce an exact algorithm for the computation of spin correlation functions for the two dimensional +/-J Ising spin glass in the ground state. Unlike with the transfer matrix method, there is no particular restriction on the shape of…
The Ising spin glass in two dimensions exhibits rich behavior with subtle differences in the scaling for different coupling distributions. We use recently developed mappings to graph-theoretic problems together with highly efficient…
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. Therefore, it is explained how the respective ground state…
We derive exact analytical expressions for the ground-state energy and entropy of the two-dimensional $\pm J$ Ising spin glass, uncovering a nested hierarchy of frustrations. Each level in this hierarchy contributes through the kernel and…
We analyze the zero-temperature behavior of the XY Edwards-Anderson spin glass model on a square lattice. A newly developed algorithm combining exact ground-state computations for Ising variables embedded into the planar spins with a…
We study the Ising spin glass on random graphs with fixed connectivity z and with a Gaussian distribution of the couplings, with mean \mu and unit variance. We compute exact ground states by using a sophisticated branch-and-cut method for…
We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any…
We present an algorithm for finding ground states of two dimensional spin glass systems based on ideas from matrix product states in quantum information theory. The algorithm works directly at zero temperature and defines an approximate…
Ground states of four-dimensional (d=4) EA Ising spin glasses are calculated for sizes up to 7x7x7x7 using a combination of a genetic algorithm and cluster-exact approximation. The ground-state energy of the infinite system is extrapolated…
A ``ballistic-search'' algorithm is presented which allows the identification of clusters (or funnels) of ground states in Ising spin glasses even for moderate system sizes. The clusters are defined to be sets of states, which are connected…
Ground states of 3d EA Ising spin glasses are calculated for sizes up to 14^3 using a combination of a genetic algorithm and Cluster-Exact Approximation. Evidence for an ultrametric structure is found by studying triplets of independent…