title: Directed geometrical worm algorithm applied to the quantum rotor model.
abstract: We discuss the implementation of a directed geometrical worm algorithm for the study of quantum link-current models. In this algorithm the Monte Carlo updates are made through the biased reptation of a worm through the lattice. A directed algorithm is an algorithm where, during the construction of the worm, the probability for erasing the immediately preceding part of the worm, when adding a new part, is minimal. We introduce a simple numerical procedure for minimizing this probability. The procedure only depends on appropriately defined local probabilities and should be generally applicable. Furthermore, we show how correlation functions C(r,tau) can be straightforwardly obtained from the probability of a worm to reach a site (r,tau) away from its starting point independent of whether or not a directed version of the algorithm is used. Detailed analytical proofs of the validity of the Monte Carlo algorithms are presented for both the directed and undirected geometrical worm algorithms. Results for autocorrelation times and Green's functions are presented for the quantum rotor model.
authors.affiliation: Computational Laboratory, ETH Zürich, CH-8092 Zürich, Switzerland. alet@phys.ethz.ch
authors.forename: Fabien
authors.initials: F
authors.lastname: Alet
authors.forename: Erik S
authors.initials: ES
authors.lastname: Sørensen