Related papers: Efficient Cluster Algorithm for Spin Glasses in An…
We use a non-equilibrium simulation method to study the spin glass transition in three-dimensional Ising spin glasses. The transition point is repeatedly approached at finite velocity $v$ (temperature change versus time) in Monte Carlo…
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…
There are many factors that influence the design of quantum annealing processing units. Here we address the issue of improving quantum annealing processing unit designs from the point of view of the critical behavior of spin glasses. It has…
Recently, a programmable quantum annealing machine has been built that minimizes the cost function of hard optimization problems by adiabatically quenching quantum fluctuations. Tests performed by different research teams have shown that,…
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…
We discuss generation of series expansions for Ising spin-glasses with a symmetric $\pm J$ (i.e. bimodal) distribution on d-dimensional hypercubic lattices using linked-cluster methods. Simplifications for the bimodal distribution allow us…
We study the spacial and temporal multiscale properties of complex systems. We present accelerated algorithms for dilute spin glasses and display explicitly their relation to the effective dynamics of specific collective degrees of freedom…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
Large scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage$2$ system on a range of lattices. Following extensive comparison to existing numerical methods, these experiments were claimed to…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
We propose a general method for studying systems that display excitations with arbitrarily low energy in their low-temperature phase. We argue that in a rectangular right prism geometry, with longitudinal size much larger than the…
A wide variety of optimization techniques, both exact and heuristic, tend to be biased samplers. This means that when attempting to find multiple uncorrelated solutions of a degenerate Boolean optimization problem a subset of the solution…
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…
Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…
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…
We demonstrate numerically that for Ising spins on square lattices with ferromagnetic second neighbour interactions and random near neighbour interactions, two dimensional Ising spin glass order with a non-zero freezing temperature can…
A cluster algorithm formulated in continuous (imaginary) time is presented for Ising models in a transverse field. It works directly with an infinite number of time-slices in the imaginary time direction, avoiding the necessity to take this…
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 study the thermodynamic Casimir force for films with various types of boundary conditions and the bulk universality class of the three-dimensional Ising model. To this end we perform Monte Carlo simulations of the improved Blume-Capel…