Related papers: Efficient Cluster Algorithm for Spin Glasses in An…
By quenched-randomly mixing local units of different spatial dimensionalities, we have studied Ising spin-glass systems on hierarchical lattices continuously in dimensionalities 1 =< d =< 3. The global phase diagram in temperature,…
This key-issues review is a plea for a new focus on simpler and more realistic models of glass-forming fluids. It seems to me that we have too often been led astray by sophisticated mathematical models that beautifully capture some of the…
Understanding how frustration and disorder shape relaxation in complex systems is a central problem in statistical physics and quantum annealing. Spin-glass models provide a natural framework to explore this connection, as their energy…
A spin-1/2 Ising model, defined in the body centered cubic lattice, is used to describe some of the thermodynamic properties of Fe$_p$-Al$_q$ alloys, with $p+q=1$. The model assumes, besides the nearest-neighbor exchange coupling, the…
For $d \ge 2$ and all $q\geq q_{0}(d)$ we give an efficient algorithm to approximately sample from the $q$-state ferromagnetic Potts and random cluster models on finite tori $(\mathbb Z / n \mathbb Z )^d$ for any inverse temperature…
Spin Glasses (SG) are paradigmatic models for physical, computer science, biological and social systems. The problem of studying the dynamics for SG models is NP hard, i.e., no algorithm solves it in polynomial time. Here we implement the…
The aim of this work is to prove that it is possible to realise an optical system which produces as output a light intensity that can be expressed in the same mathematical form of the spin glass Hamiltonian. The optical system under study…
A given set of data-points in some feature space may be associated with a Schrodinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged…
A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…
We study the dynamics of a two-dimensional ensemble of randomly distributed classical Heisenberg spins with isotropic RKKY and weaker anisotropic dipole-dipole couplings. Such ensembles may give rise to the flux noise observed in SQUIDs…
Studying spin-glass physics through analyzing their ground-state properties has a long history. Although there exist polynomial-time algorithms for the two-dimensional planar case, where the problem of finding ground states is transformed…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
The coherent Ising machine (CIM) enables efficient sampling of low-lying energy states of the Ising Hamiltonian with all-to-all connectivity by encoding the spins in the amplitudes of pulsed modes in an optical parametric oscillator (OPO).…
We present a fast and robust cluster update algorithm that is especially efficient in implementing the task of image segmentation using the method of superparamagnetic clustering. We apply it to a Potts model with spin interactions that are…
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…
Adiabatic quantum computers, such as the quantum annealers commercialized by D-Wave Systems Inc., are routinely used to tackle combinatorial optimization problems. In this article, we show how to exploit them to accelerate equilibrium…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
We introduce an alternative thermal diffusive dynamics for the spin-S Ising ferromagnet realized by means of a random walker. The latter hops across the sites of the lattice and flips the relevant spins according to a probability depending…
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…