Related papers: Parallel loop cluster quantum Monte Carlo simulati…
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 present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its…
Monte Carlo simulations are performed for the S = 1/2 XY and ferro- and antiferromagnetic Heisenberg model in two dimensions using the loop algorithm. Thermodynamic properties of all these models are investigated in wide temperature range.…
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…
Quantum Monte Carlo (QMC) techniques are widely used in a variety of scientific problems and much work has been dedicated to developing optimized algorithms that can accelerate QMC on standard processors (CPU). With the advent of various…
A review of the Loop Algorithm, its generalizations, and its relation to some other Monte Carlo techniques is given. The loop algorithm is a Quantum Monte Carlo procedure which employs nonlocal changes of worldline configurations,…
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 investigate the critical relaxational dynamics of the S=1/2 Heisenberg ferromagnet on a simple cubic lattice within the Handscomb prescription on which it is a diagrammatic series expansion of the partition function that is computed by…
We investigate the efficiency of different quantum Monte Carlo simulations of a pair of antiferromagnetically coupled qubits in an Ohmic dissipative environment. Using a Trotter-Suzuky decomposition and integrating out the degrees of…
The temperature dependence of the correlation length, susceptibilities and the magnetic structure factor of the two-dimensional spin-1 square lattice quantum Heisenberg antiferromagnet are computed by the quantum Monte Carlo loop algorithm…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
We present numerical results for an $S=1/2$ Heisenberg antiferromagnet on a inhomogeneous square lattice with tunable interaction between spins belonging to different plaquettes. Employing Quantum Monte Carlo, we significantly improve on…
Monte Carlo algorithms are frequently used in atomistic simulations, including for computation of magnetic parameter temperature dependences in multiscale simulations. Even though parallelization strategies for Monte Carlo simulations of…
Using the Continuous Time Quantum Monte Carlo Loop algorithm, we calculate the temperature dependence of the uniform susceptibility, and the specific heat of a spin-1/2 chain with random antiferromagnetic and ferromagnetic couplings, down…
One-dimensional Heisenberg spin 1/2 chains with random ferro- and antiferromagnetic bonds are realized in systems such as $Sr_3 CuPt_{1-x} Ir_x O_6$. We have investigated numerically the thermodynamic properties of a generic random bond…
We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…
We present the GPU calculation with the common unified device architecture (CUDA) for the Wolff single-cluster algorithm of the Ising model. Proposing an algorithm for a quasi-block synchronization, we realize the Wolff single-cluster Monte…
Current trends in parallel processors call for the design of efficient massively parallel algorithms for scientific computing. Parallel algorithms for Monte Carlo simulations of thermodynamic ensembles of particles have received little…
Motivated by recent progress on field-induced phase transitions in quasi-one-dimensional quantum antiferromagnets, we study the phase diagram of $S=1/2$ antiferromagnetic Heisenberg chains with Ising anisotropic interchain couplings under a…