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 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 un-directed geometrical worm algorithms. Results for auto-correlation times and Green functions are presented for the quantum rotor model.

11 pages, 9 figures, v2 : Additional results and data calculated at an incorrect chemical potential replaced. Conclusions unchanged

References in corpus (3)

• Quantum Monte Carlo study of S=1/2 weakly-anisotropic antiferromagnets on the square lattice
• Cluster Monte Carlo Algorithm for the Quantum Rotor Model
• Directed Loop Updates for Quantum Lattice Models

Cited by in corpus (35)

• Generalized Directed Loop Method for Quantum Monte Carlo Simulations
• Classical dimers with aligning interactions on the square lattice
• The dynamics of quantum criticality via Quantum Monte Carlo and holography
• Conformal field theories at non-zero temperature: operator product expansions, Monte Carlo, and holography
• Universal Conductivity in a Two-Dimensional Superfluid-to-Insulator Quantum Critical System
• Directed-loop Monte Carlo simulations of vertex models
• High-precision Monte Carlo study of several models in the three-dimensional U(1) universality class
• Universal Scaling of the Conductivity at the Superfluid-Insulator Phase Transition
• Weak first-order superfluid--solid quantum phase transitions
• The superfluid-insulator transition in the disordered two-dimensional Bose-Hubbard model
• Global scheme of sweeping cluster algorithm to sample among topological sectors
• Bose-glass to Superfluid transition in the three-dimensional Bose-Hubbard Model
• Quantum Critical Scaling of Dirty Bosons in Two Dimensions
• Deconfinement transitions in a generalised XY model
• Policy Guided Monte Carlo: Reinforcement Learning Markov Chain Dynamics
• Cluster algorithms for frustrated two dimensional Ising antiferromagnets via dual worm constructions
• The Generic, Incommensurate Transition in the two-dimensional Boson Hubbard Model
• Berry phases, current lattices, and suppression of phase transitions in a lattice gauge theory of quantum antiferromagnets
• Quantum Monte Carlo study of a magnetic-field-driven 2D superconductor-insulator transition
• Cavity-renormalized quantum criticality in a honeycomb bilayer antiferromagnet
• Line of continuous phase transitions in a three dimensional U(1) model with 1/r^2 current-current interactions
• Phase diagram of the quantum O(2)-model in 2+1 dimensions
• Solving quantum rotor model with different Monte Carlo techniques
• Universal monopole scaling near transitions from the Coulomb phase
• Finite-temperature phase transitions in a two-dimensional boson Hubbard model
• Dual Geometric Worm Algorithm for Two-Dimensional Discrete Classical Lattice Models
• Separation of two regimes in a disordered boson Hubbard Model
• Re-entrance effect in the high-temperature critical phase of the quantum dimer model on the square lattice
• The quasi-particle gap in a disordered boson Hubbard model in two dimensions
• A cluster algorithm for Lattice Gauge Theories
• Classical fully-packed loop model with attractive interactions on the square lattice
• Statistical properties of worm algorithms for two dimensional frustrated Ising models
• Computing quantum phase transitions
• Valence-Bond Quantum Monte Carlo Algorithms Defined on Trees
• The generic Mott transition in the sine-Gordon model through an embedded worm algorithm