Related papers: Efficient Cluster Algorithm for Spin Glasses in An…
We extend to soft repulsive interaction potentials a recently proposed irreversible swap algorithm originally designed for polydisperse hard spheres. The original algorithm performs rejection-free, irreversible, collective swap moves. We…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
Spin glass dynamics is a strong function of spatial dimensionality $D$. The lower critical dimension is close to 2.5, so that, in two dimensions, the condensation temperature $T_\text{g}=0$, and only fluctuations are present at finite…
The study of spin-glass dynamics, long considered the paradigmatic complex system, has reached important milestones. The availability of single crystals has allowed the experimental measurement of spin-glass coherence lengths of almost…
In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…
It is challenging to scale Ising machines for industrial-level problems due to algorithm or hardware limitations. Although higher-order Ising models provide a more compact encoding, they are, however, hard to physically implement. This work…
I propose a new method to study computationally difficult problems. I consider a new system, larger than the one I want to simulate. The original system is recovered by imposing constraints on the large system. I simulate the large system…
Within a general cluster framework, we discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For…
Numerical simulations of models and theories that describe complex systems such as spin glasses are becoming increasingly important. Beyond fundamental research, these computational methods also find practical applications in fields like…
We study the glass formation in two- and three-dimensional Ising and Heisenberg spin systems subject to competing interactions and uniaxial anisotropy with a mean-field approach. In three dimensions, for sufficiently strong anisotropy the…
We discuss an Ising spin glass where each $S=1/2$ spin is coupled antiferromagnetically to three other spins (3-regular graphs). Inducing quantum fluctuations by a time-dependent transverse field, we use out-of-equilibrium quantum Monte…
An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…
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…
We propose a method for efficient simulations in extended ensembles, useful, e.g., for the study of problems with complex energy landscapes and for free energy calculations. The main difficulty in such simulations is the estimation of the a…
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…
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 describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
Extensive simulations are made on Ising Spin Glasses (ISG) with Gaussian, Laplacian and bimodal interaction distributions in dimension four. Standard finite size scaling analyses near and at criticality provide estimates of the critical…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
The method for calculation of the correlation functions of the Ising-type systems with short-range interaction and with arbitrary value of spin is developed within cluster approximation. For the Ising model (spin $S^z=\pm1$) the expressions…