Related papers: Canonical local algorithms for spin systems: Heat …
We discuss a dynamical systems perspective on discrete optimization. Departing from the fact that many combinatorial optimization problems can be reformulated as finding low energy spin configurations in corresponding Ising models, we…
A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…
Many spin systems affected by critical slowing down can be efficiently simulated using cluster algorithms. Where such systems have long-range interactions, suitable formulations can additionally bring down the computational effort for each…
Experiments and computer simulation studies have revealed existence of rich dynamics in the orientational relaxation of molecules in confined systems such as water in reverse micelles, cyclodextrin cavities and nano-tubes. Here we introduce…
The classical spin $O(n)$ model is a model on a $d$-dimensional lattice in which a vector on the $(n-1)$-dimensional sphere is assigned to every lattice site and the vectors at adjacent sites interact ferromagnetically via their inner…
We present a new method to close the Master Equation representing the continuous time dynamics of Ising interacting spins. The method makes use of the the theory of Random Point Processes to derive a master equation for local conditional…
Problems of temperature behavior of specific heat are solved by the entropy simulation method for Ising models on a simple square lattice and a square spin ice (SSI) lattice with nearest neighbor interaction, models of hexagonal lattices…
Results regarding spin glass models are, to this day, mainly confined to models with Ising spins. Spin glass models with continuous spins exhibit interesting new physical behaviors related to the additional degrees of freedom, but have been…
The critical behavior of a hybrid spin-electron model with localized Ising spins placed on nodal sites and mobile electrons delocalized over bonds between two nodal lattice sites is analyzed by the use of a generalized decoration-iteration…
Classical or quantum physical systems can simulate the Ising Hamiltonian for large-scale optimization and machine learning. However, devices such as quantum annealers and coherent Ising machines suffer an exponential drop in the probability…
Local samplers are algorithms that generate random samples based on local queries to high-dimensional distributions, ensuring the samples follow the correct induced distributions while maintaining time complexity that scales locally with…
A cluster Monte Carlo method for systems of classical spins with purely dipolar couplings is presented. It is tested and applied for finite arrays of perpendicular Ising dipoles on the triangular lattice. This model is a modification with…
We propose a quantum optical implementation of a class of dissipative spin systems, including the XXZ and Ising model, with ultra-cold atoms in optical lattices. Employing the motional degree of freedom of the atoms and detuned Raman…
In this work we extend the applicability of the microcanonical ensemble simulation method, originally proposed to study the Ising model (A. H\"uller and M. Pleimling, Int. Journal of Modern Physics C, 13, 947 (2002),…
In this paper, we report new results on a novel Ising machine technology for solving combinatorial optimization problems using networks of coupled self-sustaining oscillators. Specifically, we present several working hardware prototypes…
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 study a family of models for an $N_1 \times N_2$ matrix worth of Ising spins $S_{aB}$. In the large $N_i$ limit we show that the spins soften, so that the partition function is described by a bosonic matrix integral with a single…
We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
Spin systems are fundamental models of statistical physics that provide insight into collective behavior across scientific domains. Their interest to computer science stems in part from the deep connection between the phase transitions they…