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/9211006 · Physical Review Letters

Cluster algorithm for vertex models

Hans Gerd Evertz, Gideon Lana, Mihai Marcu

Published Feb 15, 1993• 372 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.70.875

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

A NONLOCAL APPROACH TO VERTEX MODELS AND QUANTUM SPIN SYSTEMS

Hans Gerd Evertz, MIHAI MARCU

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.

International Journal of Modern Physics C•Dec 1, 1993•1 citation

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

The square-latticeFmodel revisited: a loop-cluster update scaling study

M Weigel, W Janke

The six-vertex F model on the square lattice constitutes the unique example of an exactly solved model exhibiting an infinite-order phase transition of the Kosterlitz-Thouless type. As one of the few non-trivial exactly solved models, it provides a welcome gauge for new numerical simulation methods and scaling techniques. In view of the notorious problems of clearly resolving the Kosterlitz-Thouless scenario in the two-dimensional XY model numerically, the F model in particular constitutes an instructive reference case for the simulational description of this type of phase transition. We present a loop-cluster update Monte Carlo study of the square-lattice F model, with a focus on the properties not exactly known such as the polarizability or the scaling dimensions in the critical phase. For the analysis of the simulation data, finite-size scaling is explicitly derived from the exact solution and plausible assumptions. Guided by the available exact results, the careful inclusion of correction terms in the scaling formulae allows for a reliable determination of the asymptotic behaviour.

arXiv:cond-mat/0501222•Journal of Physics A Mathematical and General•Jul 27, 2005•12 citations

Critical Behaviour of the Six Vertex F-model

N.B. Pannevis

The F-model is one of the six vertex models, a range of two-dimensional models designed to describe the positions of hydrogen atoms in ice. It exhibits a Kosterlitz-Thouless phase transition, and can easily be mapped onto many other models including the roughening transition in the body centered solid-on-solid model. In this thesis the critical behaviour in the F-model is examined through a computational approach, combined with finite-size scaling and real space renormalization. The simulations were run using two Monte Carlo algorithms; the so-called short loop algorithm, and the full lattice cluster algorithm. The ergodicity of the latter is revealed to be problematic, but this is overcome by combining both algorithms. Also, finite-size scaling is applied, returning a critical inverse temperature of \\epsilon \\beta = 0.79 plus or minus 0.02 compared to the known analytical value of log[2]. Furthermore, although the ice rules prevent local renormalization such as by Kadanoff block spins, a functioning coarse graining prescription based on the height function is proposed. This turns out to renormalise the high temperature states into states with temperatures below the critical point, thus preventing the determination of critical exponents from the renormalization flow.

•Aug 29, 2012•1 citation

Monte Carlo approach to phase transitions in quantum systems

Naoki Kawashima, Yasuyuki Kato

We propose algorithms of the path-ingetral-based quantum Monte Carlo simulation, which is otherwise prohibitively slow. While the basic idea is the loop-cluster update, there are some important 'tricks' that are vital to make the simulation practical. In the present paper, we show two such techniques and their successful applications to the two-dimensional SU( N ) Heisenberg model and the three-dimensional Bose Hubbard model. In the former, we obtain a new type of the valence-bond-solid state for the two-boson representation, while in the latter we equillibrate a system of which the size is comparable to a typical experiment of optical lattices.

Journal of Physics Conference Series•Jan 7, 2009•2 citations
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.
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.
The six-vertex F model on the square lattice constitutes the unique example of an exactly solved model exhibiting an infinite-order phase transition of the Kosterlitz-Thouless type. As one of the few non-trivial exactly solved models, it provides a welcome gauge for new numerical simulation methods and scaling techniques. In view of the notorious problems of clearly resolving the Kosterlitz-Thouless scenario in the two-dimensional XY model numerically, the F model in particular constitutes an instructive reference case for the simulational description of this type of phase transition. We present a loop-cluster update Monte Carlo study of the square-lattice F model, with a focus on the properties not exactly known such as the polarizability or the scaling dimensions in the critical phase. For the analysis of the simulation data, finite-size scaling is explicitly derived from the exact solution and plausible assumptions. Guided by the available exact results, the careful inclusion of correction terms in the scaling formulae allows for a reliable determination of the asymptotic behaviour.
The F-model is one of the six vertex models, a range of two-dimensional models designed to describe the positions of hydrogen atoms in ice. It exhibits a Kosterlitz-Thouless phase transition, and can easily be mapped onto many other models including the roughening transition in the body centered solid-on-solid model. In this thesis the critical behaviour in the F-model is examined through a computational approach, combined with finite-size scaling and real space renormalization. The simulations were run using two Monte Carlo algorithms; the so-called short loop algorithm, and the full lattice cluster algorithm. The ergodicity of the latter is revealed to be problematic, but this is overcome by combining both algorithms. Also, finite-size scaling is applied, returning a critical inverse temperature of \\epsilon \\beta = 0.79 plus or minus 0.02 compared to the known analytical value of log[2]. Furthermore, although the ice rules prevent local renormalization such as by Kadanoff block spins, a functioning coarse graining prescription based on the height function is proposed. This turns out to renormalise the high temperature states into states with temperatures below the critical point, thus preventing the determination of critical exponents from the renormalization flow.
We propose algorithms of the path-ingetral-based quantum Monte Carlo simulation, which is otherwise prohibitively slow. While the basic idea is the loop-cluster update, there are some important 'tricks' that are vital to make the simulation practical. In the present paper, we show two such techniques and their successful applications to the two-dimensional SU( N ) Heisenberg model and the three-dimensional Bose Hubbard model. In the former, we obtain a new type of the valence-bond-solid state for the two-boson representation, while in the latter we equillibrate a system of which the size is comparable to a typical experiment of optical lattices.