Related papers: Canonical local algorithms for spin systems: Heat …
In this micro-canonical simulation the temperature and also the specific heat are determined as averages of expressions easy to implement. The XY-chain is studied for a test. The second order transition on a cubic lattice and the first…
In complex systems such as spin systems and protein systems, conventional simulations in the canonical ensemble will get trapped in states of energy local minima. We employ the generalized-ensemble algorithms in order to overcome this…
Local tensor methods are a class of optimization algorithms that was introduced in [Hastings,arXiv:1905.07047v2][1] as a classical analogue of the quantum approximate optimization algorithm (QAOA). These algorithms treat the cost function…
A general technique of exact calculation of any correlation functions for the special class of one-dimensional spin models containing small clusters of quantum spins assembled to a chain by alternating with the single Ising spins is…
We investigate certain classes of integrable classical or quantum spin systems. The first class is characterized by the recursively defined property $P$ saying that the spin system consists of a single spin or can be decomposed into two…
We study the zero temperature static properties of dissipative ensembles of quantum Ising spins arranged on periodic one dimensional finite clusters and on an infinite chain. The spins interact ferro-magnetically with nearest-neighbour pure…
Binary random variables are the building blocks used to describe a large variety of systems, from magnetic spins to financial time series and neuron activity. In Statistical Physics the Kinetic Ising Model has been introduced to describe…
A new method for locating analytically critical temperatures is discussed. It is exact for selfdual systems. When applied the two coupled layers of Ising spins it deviates from our preliminary Monte Carlo estimates by 1.5 standard…
A cluster mean-field method is introduced and the applications to the Ising and Heisenberg models are demonstrated. We divide the lattice sites into clusters whose size and shape are selected so that the equivalence of all sites in a…
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…
To establish a unified framework for studying both discrete and continuous coupling distributions, we introduce the {\it binomial} spin glass, a class of models where the couplings are sums of $m$ identically distributed Bernoulli random…
We study the statistical Ising model of spins on the infinite lattice using a bootstrap method that combines spin-flip identities with positivity conditions, including reflection positivity and Griffiths inequalities, to derive rigorous…
A network of optical parametric oscillators is used to simulate classical Ising and XY spin chains. The collective nonlinear dynamics of this network, driven by quantum noise rather than thermal fluctuations, seeks out the Ising / XY ground…
A coherent Ising machine (CIM) is known to deliver the low-energy states of the Ising model. Here, we investigate how well the CIM simulates the thermodynamic properties of a two-dimensional square-lattice Ising model. Assuming that the…
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 present a new family of zero-field Ising models over N binary variables/spins obtained by consecutive "gluing" of planar and $O(1)$-sized components along with subsets of at most three vertices into a tree. The polynomial time algorithm…
IBM quantum computers are used to simulate the dynamics of small systems of interacting quantum spins. For time-independent systems with fewer than three spins, we compute the exact time evolution at arbitrary times and measure spin…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
We have computed through order $\beta^{21}$ the high-temperature expansions for the nearest-neighbor spin correlation function $G(N,\beta)$ of the classical N-vector model, with general N, on the simple-cubic and on the body-centered-cubic…
Algorithmic cooling (AC) is a method to purify quantum systems, such as ensembles of nuclear spins, or cold atoms in an optical lattice. When applied to spins, AC produces ensembles of highly polarized spins, which enhance the signal…