相关论文: Finding Ground States of Sherrington-Kirkpatrick S…
We use heuristic optimization methods in extensive computations to determine with low systematic error ground state configurations of the mean-field $p$-spin glass model with $p=3$. Here, all possible triplets in a system of $N$ Ising spins…
We present a numerical study of ground states of the dilute versions of the Sherrington-Kirkpatrick (SK) mean-field spin glass. In contrast to so-called "sparse" mean-field spin glasses that have been studied widely on random networks of…
Extremal Optimization (EO), a new local search heuristic, is used to approximate ground states of the mean-field spin glass model introduced by Sherrington and Kirkpatrick. The implementation extends the applicability of EO to systems with…
Due to an extremely rugged structure of the free energy landscape, the determination of spin-glass ground states is among the hardest known optimization problems, found to be NP-hard in the most general case. Owing to the specific structure…
Hysteretic optimization is a heuristic optimization method based on the observation that magnetic samples are driven into a low energy state when demagnetized by an oscillating magnetic field of decreasing amplitude. We show that hysteretic…
This paper provides an in-depth empirical analysis of several evolutionary algorithms on the one-dimensional spin glass model with power-law interactions. The considered spin glass model provides a mechanism for tuning the effective range…
The Sherrington-Kirkpatrick (SK) is a foundational model for understanding spin glass systems. It is based on the pairwise interaction between each two spins in a fully connected lattice with quenched disordered interactions. The nature of…
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…
We describe a numerical algorithm for computing spin glass ground states with a high level of reliability. The method uses a population based search and applies optimization on multiple scales. Benchmarks are given leading to estimates of…
The average ground state energies for spin glasses on Bethe lattices of connectivities r=3,...,15 are studied numerically for a Gaussian bond distribution. The Extremal Optimization heuristic is employed which provides high-quality…
Exact ground states are calculated for the Sherrington-Kirkpatrick (SK) spin-glass containing up to N=90 spins. A ground-state energy per spin $e^{\infty}_0 = - 0.7637 \pm 0.0004$ is found from the $N$ dependence of the misfit parameter,…
We analyze the transformation of QUBO from its conventional Boolean presentation into an equivalent spin glass problem with coupled $\pm1$ spin variables exposed to a site-dependent external field. We find that in a widely used testbed for…
Using a stochastic algorithm introduced in a previous paper, we study the finite size volume corrections and the fluctuations of the ground state energy in the Sherrington-Kirkpatrick and the Edwards-Anderson models at zero temperature. The…
Using the discrete $\pm J$ bond distribution for the Sherrington-Kirkpatrick spin glass, all ground states for the entire ensemble of the bond disorder are enumerated. Although the combinatorial complexity of the enumeration severely…
This study analyzes performance of several genetic and evolutionary algorithms on randomly generated NK fitness landscapes with various values of n and k. A large number of NK problem instances are first generated for each n and k, and the…
We study the problem of testing and recovering $k$-clique Ferromagnetic mean shift in the planted Sherrington-Kirkpatrick model (i.e., a type of spin glass model) with $n$ spins. The planted SK model -- a stylized mixture of an uncountable…
Branch-and-bound is a widely used technique for solving combinatorial optimisation problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that…
We present a quantum algorithm that has rigorous runtime guarantees for several families of binary optimization problems, including Quadratic Unconstrained Binary Optimization (QUBO), Ising spin glasses ($p$-spin model), and $k$-local…
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two extremal cases are considered: (1) the +/- J spin glass, and…
We consider algorithmic determination of the $n$-dimensional Sherrington-Kirkpatrick (SK) spin glass model ground state free energy. It corresponds to a binary maximization of an indefinite quadratic form and under the \emph{worst case}…