Related papers: A hierarchical approach for computing spin glass g…
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…
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…
The chapter starts with a historical summary of first attempts to optimize the spin glass Hamiltonian, comparing it to recent results on searching largest cliques in random graphs. Exact algorithms to find ground states in generic spin…
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…
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…
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…
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into…
This study focuses on the problem of finding ground states of random instances of the Sherrington-Kirkpatrick (SK) spin-glass model with Gaussian couplings. While the ground states of SK spin-glass instances can be obtained with branch and…
We propose a general learning algorithm for solving optimization problems, based on a simple strategy of trial and adaptation. The algorithm maintains a probability distribution of possible solutions (configurations), which is updated…
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…
The genetic cluster-exact approximation algorithm is an efficient method to calculate ground states of EA spin glasses. The method can be used to study ground-state landscapes by calculating many independent ground states for each…
Many developments in science and engineering depend on tackling complex optimizations on large scales. The challenge motivates intense search for specific computing hardware that takes advantage from quantum features, nonlinear dynamics, or…
Spin glasses are disordered magnets with random interactions that are, generally, in conflict with each other. Finding the ground states of spin glasses is not only essential for the understanding of the nature of disordered magnetic and…
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of energy landscapes. This paper describes an implementation of the algorithm, including issues of parallel performance and scalability. To…
We use a random pinning procedure to investigate stable glassy states associated with large deviations of the activity in a model glass-former. We pin particles both from active (equilibrium) configurations and from stable (inactive) glassy…
In this talk I will review the approach to spin glasses based on the spontaneously broken replica symmetry. I will concentrate my attention mostly on more general ideas, skipping technical details and stressing the characteristic…
Ground states of three-dimensional EA Ising spin glasses are calculated for sizes up to 14^3 using a combination of a genetic algorithm and cluster-exact approximation. For each realization several independent ground states are obtained.…
Across many scientific and engineering disciplines, it is important to consider how much the output of a given system changes due to perturbations of the input. Here, we investigate the glassy phase of $\pm J$ spin glasses at zero…
We introduce an algorithm to generate (not solve) spin-glass instances with planted solutions of arbitrary size and structure. First, a set of small problem patches with open boundaries is solved either exactly or with a heuristic, and then…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…