Related papers: Solving Spin Glasses with Optimized Trees of Clust…
We study Ising spin models on finitely connected random interaction graphs which are drawn from an ensemble in which not only the degree distribution $p(k)$ can be chosen arbitrarily, but which allows for further fine-tuning of the topology…
The Minimum Quartet Tree Cost problem is to construct an optimal weight tree from the $3{n \choose 4}$ weighted quartet topologies on $n$ objects, where optimality means that the summed weight of the embedded quartet topologies is optimal…
We develop a systematic expansion method of physical quantities for the SK model and the finite-dimensional $\pm J$ model of spin glasses in non-equilibrium states. The dynamical probability distribution function is derived from the master…
Motivated by the recent success of tensor networks to calculate the residual entropy of spin ice and kagome Ising models, we develop a general framework to study frustrated Ising models in terms of infinite tensor networks %, i.e. tensor…
Spin glasses are frustrated magnetic systems due to a random distribution of ferro- and antiferromagnetic interactions. An experimental three dimensional (3d) spin glass exhibits a second order phase transition to a low temperature spin…
We study link-diluted $\pm J$ Ising spin glass models on the hierarchical lattice and on a three-dimensional lattice close to the percolation threshold. We show that previously computed zero temperature fixed points are unstable with…
A huge number of independent true ground-state configurations is calculated for two-, three- and four-dimensional +- J spin-glass models. Using the genetic cluster-exact approximation method, system sizes up to N=20^2,8^3,6^4 spins are…
We discuss interfaces in spin glasses. We present new theoretical results and a numerical method to characterize overlap interfaces and the stability of the spin-glass phase in extended disordered systems. We use this definition to…
We introduce a new update scheme to systematically improve the efficiency of parallel tempering simulations. We show that by adapting the number of sweeps between replica exchanges to the canonical autocorrelation time, the average…
Ising machines are hardware solvers which aim to find the absolute or approximate ground states of the Ising model. The Ising model is of fundamental computational interest because it is possible to formulate any problem in the complexity…
We consider the long-ranged Ising spin-glass with random couplings decaying as a power-law of the distance, in the region of parameters where the spin-glass phase exists with a positive droplet exponent. For the Metropolis single-spin-flip…
We study the problem of determining the Hamiltonian of a fully connected Ising Spin Glass of $N$ units from a set of measurements, whose sizes needs to be ${\cal O}(N^2)$ bits. The student-teacher scenario, used to study learning in…
Finding a ground state of a given Hamiltonian of an Ising model on a graph $G=(V,E)$ is an important but hard problem. The standard approach for this kind of problem is the application of algorithms that rely on single-spin-flip Markov…
Aging in spin glasses (and in some other systems) reveals astonishing effects of `rejuvenation and memory' upon temperature changes. In this paper, we propose microscopic mechanisms (at the scale of spin-spin interactions) which can be at…
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…
An efficient technique to generate ensembles of spins that are highly polarized by external magnetic fields is the Holy Grail in Nuclear Magnetic Resonance (NMR) spectroscopy. Since spin-half nuclei have steady-state polarization biases…
The branching algorithm is a fundamental technique for designing fast exponential-time algorithms to solve combinatorial optimization problems exactly. It divides the entire solution space into independent search branches using…
We investigate the performance of flat-histogram methods based on a multicanonical ensemble and the Wang-Landau algorithm for the three-dimensional +/- J spin glass by measuring round-trip times in the energy range between the…
We study a variant of the Sherrington-Kirkpatrick (S-K) spin glass model with external field, where the random symmetric couplings matrix does not consist of i.i.d. entries but is instead orthogonally invariant in law. For sufficiently high…
We analyze models of spin glasses on the two-dimensional square lattice by exploiting symmetry arguments. The replicated partition functions of the Ising and related spin glasses are shown to have many remarkable symmetry properties as…