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

International Journal of Modern Physics C

A NONLOCAL APPROACH TO VERTEX MODELS AND QUANTUM SPIN SYSTEMS

Hans Gerd Evertz, MIHAI MARCU

Published Dec 1, 1993• 1 citation
Publisher

Abstract

We discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For the F-model, we present numerical results that demonstrate the effectiveness of the loop algorithm. We show how to modify the original algorithm for some more complicated situations, especially for quantum spin systems in one and two dimensions, and we discuss parallelization.

DOI
10.1142/s0129183193000902

Related papers

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

Cluster algorithm for vertex models

Hans Gerd Evertz, Gideon Lana, Mihai Marcu

We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the loop algorithm. The basic steps in constructing a cluster are the breakup and the freezing of vertices. We concentrate on the case of the F model, which is a subset of the six-vertex model exhibiting a Kosterlitz-Thouless transition. The loop algorithm is also applicable to simulations of other vertex models and of one- and two-dimensional quantum spin systems.

arXiv:cond-mat/9211006•Physical Review Letters•Feb 15, 1993•372 citations

An Efficient Cluster Algorithm and Its Numerical Study for the Quantum Spin systems

He-Ping Ying, JI DA-REN

Using a blockspin scheme, a cluster algorithm is developed for the numerical study of the quantum spin systems. The method is tested in detail for the ferro- and antiferromagnetic Heisenberg chains, of which our calculations show that the new algorithm can be used to simulate the induced classical spin systems efficiently by strongly reducing the slowing down effects.

Communications in Theoretical Physics•Jun 15, 1994•0 citations

Cluster Simulations of Loop Models on Two-Dimensional Lattices

Youjin Deng, Timothy M. Garoni, Wenan Guo +2 more

We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n> or =1. We show that our algorithm has little or no critical slowing-down when 1< or =n< or =2. We use this algorithm to investigate the honeycomb-lattice O(n) loop model, for which we determine several new critical exponents, and a square-lattice O(n) loop model, for which we obtain new information on the phase diagram.

arXiv:cond-mat/0608447•Physical Review Letters•Mar 21, 2007•34 citations

SPIN CHAIN SIMULATIONS WITH A MERON CLUSTER ALGORITHM

Thomas Boyer‐Kassem, Wolfgang Bietenholz A, JAIR WUILLOUD

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.

arXiv:cond-mat/0701331•International Journal of Modern Physics C•Sep 1, 2007•6 citations

Blockspin Scheme and Cluster Algorithm for Quantum Spin Systems

He-Ping Ying, U.‐J. Wiese

We present a numerical study using a cluster algorithm for the 1-d $S=1/2$ quantum Heisenberg models. The dynamical critical exponent for anti-ferromagnetic chains is $z=0.0(1)$ such that critical slowing down is eliminated.

arXiv:hep-lat/9211034•Nov 12, 1992•0 citations
We discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For the F-model, we present numerical results that demonstrate the effectiveness of the loop algorithm. We show how to modify the original algorithm for some more complicated situations, especially for quantum spin systems in one and two dimensions, and we discuss parallelization.
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.
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the loop algorithm. The basic steps in constructing a cluster are the breakup and the freezing of vertices. We concentrate on the case of the F model, which is a subset of the six-vertex model exhibiting a Kosterlitz-Thouless transition. The loop algorithm is also applicable to simulations of other vertex models and of one- and two-dimensional quantum spin systems.
We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.
We present a numerical study using a cluster algorithm for the 1-d S=1/2S=1/2S=1/2 quantum Heisenberg models. The dynamical critical exponent for anti-ferromagnetic chains is z=0.0(1)z=0.0(1)z=0.0(1) such that critical slowing down is eliminated.