Related papers: Loop algorithm for classical antiferromagnetic Hei…
The Ising model is a simple statistical model for ferromagnetism. There are analytic solutions for low dimensions and very efficient Monte Carlo methods, such as cluster algorithms, for simulating this model in special cases. However most…
Recently, a diffusion Monte Carlo algorithm was applied to the study of spin dependent interactions in condensed matter. Following some of the ideas presented therein, and applied to a Hamiltonian containing a Rashba-like interaction, a…
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…
Combinatorial optimization problems are central to both practical applications and the development of optimization methods. While classical and quantum algorithms have been refined over decades, machine learning--assisted approaches are…
We introduce a constrained Monte Carlo method which allows us to traverse the phase space of a classical spin system while fixing the magnetization direction. Subsequently we show the method's capability to model the temperature dependence…
Motivated by the numerical simulation of systems which display quantum phase transitions, we present a novel application of the meron-cluster algorithm to simulate the quantum antiferromagnetic Heisenberg model coupled to an external…
The Hybrid Monte Carlo algorithm is adapted to the simulation of a system of classical degrees of freedom coupled to non self-interacting lattices fermions. The diagonalization of the Hamiltonian matrix is avoided by introducing a…
A large-scale parallel loop cluster quantum Monte Carlo simulation is presented. On 24,576 nodes of the K computer, one loop cluster Monte Carlo update of the world-line configuration of the $S=1/2$ antiferromagnetic Heisenberg chain with…
Phase transitions in a classical Heisenberg spin model of a chiral helimagnet with the Dzyaloshinskii--Moriya (DM) interaction in three dimensions are numerically studied. By using the event-chain Monte Carlo algorithm recently developed…
We present \texttt{ESpinS} (Esfahan Spin Simulation) package to evaluate the thermodynamic properties of spin systems described by a spin model Hamiltonian. In addition to the Heisenberg exchange term, the spin Hamiltonian can contain…
To minimise systematic errors in Monte Carlo simulations of charged particles, long range electrostatic interactions have to be calculated accurately and efficiently. Standard approaches, such as Ewald summation or the naive application of…
Magnetization processes of the spin-1/2 antiferromagnetic $XXZ$ model in two and three spatial dimensions are studied using quantum Monte Carlo method based on stochastic series expansions. Recently developed operator-loop algorithm enables…
We present a new optimised model of Brookes-Herring ionized impurity scattering for use in Monte Carlo simulations of semiconductors. When implemented, it greatly decreases the execution time needed for simulations (typically by a factor of…
We present an efficient Monte Carlo algorithm for the simulation of the two-dimensional Random Field Ising Model (RFIM). The method combines the event-driven, rejection-free character of the Bortz Kalos-Lebowitz (BKL) algorithm with Glauber…
While the usual goal in Monte Carlo (MC) simulations of Ising models is the efficient generation of spin configurations with Boltzmann probabilities, the inverse problem is to determine the coupling constants from a given set of spin…
We present extensive Monte Carlo simulations for a classical antiferromagnetic Heisenberg model with both nearest ($J_1$) and next-nearest ($J_2$) exchange couplings on the square lattice coupled to the lattice degrees of freedom. The…
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,…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
Frustrated spin systems generically suffer from the negative sign problem inherent to Monte Carlo methods. Since the severity of this problem is formulation dependent, optimization strategies can be put forward. We introduce a phase pinning…
We apply a worm algorithm to simulate the quantum transverse-field Ising model in a path-integral representation of which the expansion basis is taken as the spin component along the external-field direction. In such a representation, a…