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

OVERCOMING CRITICAL SLOWING DOWN IN QUANTUM MONTE CARLO SIMULATIONS

Hans Gerd Evertz, Mihai Marcu

The classical d +1-dimensional spin systems used for the simulation of quantum spin systems in d dimensions are, quite generally, vertex models. Standard simulation methods for such models strongly suffer from critical slowing down. Recently, we developed the loop algorithm , a new type of cluster algorithm that to a large extent overcomes critical slowing down for vertex models. We present the basic ideas on the example of the F model, a special case of the 6-vertex model. Numerical results clearly demonstrate the effectiveness of the loop algorithm. Then, using the framework for cluster algorithms developed by Kandel and Domany, we explain how to adapt our algorithm to the cases of the 6-vertex model and the 8-vertex model, which are relevant for spin systems. The techniqes presented here can be applied without modification to 2-dimensional spin systems, provided that in the Suzuki-Trotter formula the Hamiltonian is broken up into 4 sums of link terms. Generalizations to more complicated situations (higher spins, different uses of the Suzuki-Trotter formula) are, at least in principle, straightforward.

WORLD SCIENTIFIC eBooks•Dec 1, 1993•2 citations

Improved directed loop method for Quantum Monte Carlo simulations

Fabien Alet

Efficient schemes called directed loops for cluster updates in Quantum Monte Carlo simulations have recently been proposed, which improve both the efficiency and precision for simulations of quantum models. In this work we show that local detailed balance is not necessary in order to fulfill global detailed balance during the construction of these loops. We therefore propose to insert additional degrees of freedom into the directed loop equations, resulting in even more efficient algorithms. Our approach works directly in the natural representation of an extended space where the matrix elements of the operators defining the worm (broken worldline segments) are taken into account.

AIP conference proceedings•Jan 1, 2003•0 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.
The classical d +1-dimensional spin systems used for the simulation of quantum spin systems in d dimensions are, quite generally, vertex models. Standard simulation methods for such models strongly suffer from critical slowing down. Recently, we developed the loop algorithm , a new type of cluster algorithm that to a large extent overcomes critical slowing down for vertex models. We present the basic ideas on the example of the F model, a special case of the 6-vertex model. Numerical results clearly demonstrate the effectiveness of the loop algorithm. Then, using the framework for cluster algorithms developed by Kandel and Domany, we explain how to adapt our algorithm to the cases of the 6-vertex model and the 8-vertex model, which are relevant for spin systems. The techniqes presented here can be applied without modification to 2-dimensional spin systems, provided that in the Suzuki-Trotter formula the Hamiltonian is broken up into 4 sums of link terms. Generalizations to more complicated situations (higher spins, different uses of the Suzuki-Trotter formula) are, at least in principle, straightforward.
Efficient schemes called directed loops for cluster updates in Quantum Monte Carlo simulations have recently been proposed, which improve both the efficiency and precision for simulations of quantum models. In this work we show that local detailed balance is not necessary in order to fulfill global detailed balance during the construction of these loops. We therefore propose to insert additional degrees of freedom into the directed loop equations, resulting in even more efficient algorithms. Our approach works directly in the natural representation of an extended space where the matrix elements of the operators defining the worm (broken worldline segments) are taken into account.