Related papers: Cluster algorithms for frustrated two dimensional …
Working within the stochastic series expansion framework, we introduce and characterize a new quantum cluster algorithm for quantum Monte Carlo simulations of transverse field Ising models with frustrated Ising exchange interactions. As a…
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for…
The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…
Working within the Stochastic Series Expansion (SSE) framework, we construct efficient quantum cluster algorithms for transverse field Ising antiferromagnets on the pyrochlore lattice and the planar pyrochlore lattice, for the fully…
Simulations of frustrated quantum antiferromagnets suffer from a severe sign problem. We solve the ergodicity problem of the loop-cluster algorithm in a natural way and apply a powerful strategy to address the sign problem. For the spin 1/2…
Motivated by the recent success of tensor networks to calculate the residual entropy of spin ice and kagome Ising models, we develop a general framework to study frustrated Ising models in terms of infinite tensor networks %, i.e. tensor…
We present a dual geometrical worm algorithm for two-dimensional Ising models. The existence of such dual algorithms was first pointed out by Prokof'ev and Svistunov \cite{ProkofevClassical}. The algorithm is defined on the dual lattice and…
The study of frustrated spin systems often requires time-consuming numerical simulations. As the simplest approach, the classical Ising model is often used to investigate the thermodynamic behavior of such systems. Exploiting the small…
Despite their simple formulation, short range classical antiferromagnetic Ising models on frustrated lattices give rise to exotic phases of matter, in particular due to their macroscopic ground state degeneracy. Recent experiments on…
We report results from spin trimer-based cluster quantum Monte Carlo simulations for the thermodynamic properties of two-dimensional frustrated quantum antiferromagnets that are composed of weakly-coupled three-spin (trimer) clusters. In…
We have investigated by Monte-Carlo simulation the phase diagram of a three-dimensional Ising model with nearest-neighbor ferromagnetic interactions and small, but long-range (Coulombic) antiferromagnetic interactions. We have developed an…
We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, 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…
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…
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…
We report on a systematic study of two dimensional, periodic, frustrated Ising models with a quantum dynamics introduced via a transverse magnetic field. The systems studied are the triangular and kagome lattice antiferromagnets, fully…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
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…
We illustrate how the systematic inclusion of multi-spin correlations of the quantum spin-lattice systems can be efficiently implemented within the framework of the coupled-cluster method by examining the ground-state properties of both the…
We investigate in some detail an alternative simulation strategy for lattice field theory based on the so-called worm algorithm introduced by Prokof'ev and Svistunov in 2001. It amounts to stochastically simulating the strong coupling…