Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0205472 · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

Coarse-grained loop algorithms for Monte Carlo simulation of quantum spin systems

Kenji Harada, Naoki Kawashima

Published Nov 26, 2002• 14 citations
arXivHTMLPDF

Abstract

Recently, Syljuåsen and Sandvik [Phys. Rev. E. (to be published)] proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a given model. Based on their framework, we propose an algorithm that is a natural extension of the conventional loop algorithm with the split-spin representation. A complete table of the vertex density and the worm-scattering probability is presented for the general XXZ model of an arbitrary S with a uniform magnetic field.

DOI
10.1103/physreve.66.056705

Related papers

Publisher’s Note: Coarse-grained loop algorithms for Monte Carlo simulation of quantum spin systems [Phys. Rev. E66, 056705 (2002)]

Kenji Harada, Naoki Kawashima

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Mar 20, 2003•2 citations

Large Spins, High Order Interaction, and Bosonic Problems

Naoki Kawashima

The directed loop algorithm proposed recently by Syljuåsen and Sandvik [Phys. Rev. E 66 (2002) 046701] provides a new framework for the Monte Carlo simulation that possesses the advantages of the loop update and the worm update. Starting from another formulation of the algorithm based on the path‐integral representation, we discuss the coarse‐grained algorithm for quantum spin models and its extension to the boson models from the new viewpoint.

AIP conference proceedings•Jan 1, 2003•0 citations

Short-loop algorithm for quantum Monte Carlo simulations

Ying-Jer Kao, Roger G. Melko

We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where nonlocal cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase simulation efficiency in cases where conventional loops become very large, do not close altogether, or otherwise behave poorly. We demonstrate and characterize some aspects of the short loop on a square lattice spin-1/2 XXZ model where, remarkably, a significant increase in simulation efficiency is observed in some parameter regimes. The simplicity of the model provides a prototype for the use of short loops on more complicated quantum systems.

arXiv:0709.1718•Physical Review E•Mar 25, 2008•2 citations

Loop algorithms for asymmetric Hamiltonians

Olav F. Syljuåsen

Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ model in a uniform magnetic field along the Z axis. As is demonstrated for the Heisenberg antiferromagnet it is possible from these rules to select a new algorithm which performs significantly better than the standard loop algorithm in strong magnetic fields at low temperatures.

arXiv:cond-mat/9907142•Physical review. B, Condensed matter•Jan 1, 2000•6 citations

Loop Algorithms for Monte Carlo Simulations of Quantum Spin Systems

Naoki Kawashima, James E. Gubernatis

We present a new algorithm for world line Monte Carlo simulations of quantum spin systems. The algorithm consists of a stochastic pairing and a stochastic flipping procedure, and the formula for the pairing probability is explicitly given for Heisenberg models. As an illustration of the algorithm, we calculated autocorrelation times for simulations of the $S=1$ antiferromagnetic Heisenberg chain. The rapid increase in autocorrelation times which is seen in the conventional world line method as the imaginary-time spacing decreases is eliminated by the present algorithm.

Physical Review Letters•Aug 29, 1994•59 citations

Directed loop updates for quantum lattice models

Olav F. Syljuåsen

This article outlines how the quantum Monte Carlo directed loop update recently introduced can be applied to a wide class of quantum lattice models. Several models are considered: spin-s XXZ models with longitudinal and transverse magnetic fields, boson models with two-body interactions, and one-dimensional spinful fermion models. Expressions are given for the parameter regimes where very efficient "no-bounce" quantum Monte Carlo algorithms can be found.

arXiv:cond-mat/0211513•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Apr 3, 2003•82 citations
Recently, Syljuåsen and Sandvik [Phys. Rev. E. (to be published)] proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a given model. Based on their framework, we propose an algorithm that is a natural extension of the conventional loop algorithm with the split-spin representation. A complete table of the vertex density and the worm-scattering probability is presented for the general XXZ model of an arbitrary S with a uniform magnetic field.
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where nonlocal cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase simulation efficiency in cases where conventional loops become very large, do not close altogether, or otherwise behave poorly. We demonstrate and characterize some aspects of the short loop on a square lattice spin-1/2 XXZ model where, remarkably, a significant increase in simulation efficiency is observed in some parameter regimes. The simplicity of the model provides a prototype for the use of short loops on more complicated quantum systems.
We present a new algorithm for world line Monte Carlo simulations of quantum spin systems. The algorithm consists of a stochastic pairing and a stochastic flipping procedure, and the formula for the pairing probability is explicitly given for Heisenberg models. As an illustration of the algorithm, we calculated autocorrelation times for simulations of the S=1S=1S=1 antiferromagnetic Heisenberg chain. The rapid increase in autocorrelation times which is seen in the conventional world line method as the imaginary-time spacing decreases is eliminated by the present algorithm.