Related papers: Parallel Invaded Cluster Algorithm for the Ising M…
The Ising machine is an unconventional computing architecture that can be used to solve NP-hard combinatorial optimization problems more efficiently than traditional von Neumann architectures. Fast, compact oscillator networks which provide…
The past decade has seen the emergence of Ising machines targeting hard combinatorial optimization problems by minimizing the Ising Hamiltonian with spins represented by continuous dynamical variables. However, capabilities of these…
In this work we have calculated the dynamic critical exponent $z$ for 2-, 3- and 4-dimensional Ising models using the Wolff's algorithm through dynamic finite size scaling. We have studied time evolution of the average cluster size, the…
We use the cluster variation method (CVM) to investigate the phase structure of the 3d gonihedric Ising actions defined by Savvidy and Wegner. The geometrical spin cluster boundaries in these systems serve as models for the string…
Many tasks in our modern life, such as planning an efficient travel, image processing and optimizing integrated circuit design, are modeled as complex combinatorial optimization problems with binary variables. Such problems can be mapped to…
In this study, we computed three critical exponents ($\alpha, \beta, \gamma$) for the 3D Ising model with Metropolis Algorithm using Finite-Size Scaling Analysis on six cube length scales (L=20,30,40,60,80,90), and performed a supervised…
Extensive Monte Carlo simulations in the semi-grand-canonical ensemble are used to study the critical behavior of a three-dimensional compressible Ising model with antiferromagnetic interactions under constant volume conditions. Elastic…
Some universal amplitude ratios appropriate to the $\phi_{2,1}$ peturbation of the c=7/10 minimal field theory, the subleading magnetic perturbation of the tricritical Ising model, are explicitly demonstrated in the dilute A$_3$ model, in…
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…
We consider the percolation problem in the high-temperature Ising model on the two-dimensional square lattice at or near critical external fields. The incipient infinite cluster (IIC) measure in the sense of Kesten is constructed. As a…
We study the three-dimensional Ising model at the critical point in the fixed-magnetization ensemble, by means of the recently developed geometric cluster Monte Carlo algorithm. We define a magnetic-field-like quantity in terms of…
We consider a two-dimensional Ising model with random i.i.d. nearest-neighbor ferromagnetic couplings and no external magnetic field. We show that, if the probability of supercritical couplings is small enough, the system admits a…
The critical relaxation from the low-temperature ordered state of the three-dimensional fully frustrated Ising model on a simple cubic lattice has been studied using the short time dynamics method. Particles with the periodic boundary…
A quantum simulator is a well controlled quantum system that can simulate the behavior of another quantum system which may require exponentially large classical computing resources to understand otherwise. In the 1980s, Feynman proposed the…
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…
We report on the development of two dual worm constructions that lead to cluster algorithms for efficient and ergodic Monte Carlo simulations of frustrated Ising models with arbitrary two-spin interactions that extend up to third-neighbours…
In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…
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…
New algorithm of the finite lattice method is presented to generate the high-temperature expansion series of the Ising model. It enables us to obtain much longer series in three dimensions when compared not only to the previous algorithm of…
We present an exact simulation of a one-dimensional transverse Ising spin chain with a quantum computer. We construct an efficient quantum circuit that diagonalizes the Ising Hamiltonian and allows to obtain all eigenstates of the model by…