Cluster algorithm for vertex models
Phys. Rev. Lett. 70, 875 – Published 15 February, 1993
DOI: https://doi.org/10.1103/PhysRevLett.70.875
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.