Related papers: Loop algorithm for classical antiferromagnetic Hei…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
We study a classical fully-frustrated honeycomb lattice Ising model using Markov chain Monte Carlo methods and exact calculations . The Hamiltonian realizes a degenerate ground state manifold of equal-energy states, where each hexagonal…
We introduce the concept of directed loops in stochastic series expansion and path integral quantum Monte Carlo methods. Using the detailed balance rules for directed loops, we show that it is possible to smoothly connect generally…
We investigate the ground-state properties of the highly degenerate non-coplanar phase of the classical bilinear-biquadratic Heisenberg model on the triangular lattice with Monte Carlo simulations. For that purpose, we introduce an Ising…
Effects of randomness on the spin-1/2 and 1 antiferromagnetic Heisenberg chains are studied using the quantum Monte Carlo method with the continuous-time loop algorithm. We precisely calculated the uniform susceptibility, string order…
We introduce a Generalized Loop Move (GLM) update for Monte Carlo simulations of frustrated Ising models on two-dimensional lattices with bond-sharing plaquettes. The GLM updates are designed to enhance Monte Carlo sampling efficiency when…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
We present the loop algorithm, a new type of cluster algorithm that we recently introduced for the F model. Using the framework of Kandel and Domany, we show how to GENERALIZE the algorithm to the arrow flip symmetric 6 vertex model. We…
We propose a generalization of the Quantum Monte Carlo loop algorithm to the t-J model by a mapping to three coupled six-vertex models. The autocorrelation times are reduced by orders of magnitude compared to the conventional local…
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
Using fermionic representation of spin degrees of freedom within the Popov-Fedotov approach we develop an algorithm for Monte Carlo sampling of skeleton Feynman diagrams for Heisenberg type models. Our scheme works without modifications for…
We discuss the sign problem arising in Monte Carlo simulations of frustrated quantum spin systems. We show that for a class of ``semi-frustrated'' systems (Heisenberg models with ferromagnetic couplings $J_z(r) < 0$ along the $z$-axis and…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
We study the phase diagram of a quasi-two dimensional magnetic system ${\rm Rb_2MnF_4}$ with Monte Carlo simulations of a classical Heisenberg spin Hamiltonian which includes the dipolar interactions between ${\rm Mn}^{2+}$ spins. Our…
We introduce an algorithm to systematically improve the efficiency of parallel tempering Monte Carlo simulations by optimizing the simulated temperature set. Our approach is closely related to a recently introduced adaptive algorithm that…
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…
Using exact diagonalization, Monte-Carlo, and mean-field techniques, characteristic temperature scales for ferromagnetic order are discussed for the Ising and the classical anisotropic Heisenberg model on finite lattices in one and two…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…