Surface worm algorithm for abelian Gauge-Higgs systems on the lattice
arXiv:1211.3436 · doi:10.1016/j.cpc.2013.02.001
Abstract
The Prokof'ev Svistunov worm algorithm was originally developed for models with nearest neighbor interactions that in a high temperature expansion are mapped to systems of closed loops. In this work we present the surface worm algorithm (SWA) which is a generalization of the worm algorithm concept to abelian Gauge-Higgs models on a lattice which can be mapped to systems of surfaces and loops (dual representation). Using Gauge-Higgs models with gauge groups Z(3) and U(1) we compare the SWA to the conventional approach and to a local update in the dual representation. For the Z(3) case we also consider finite chemical potential where the conventional representation has a sign problem which is overcome in the dual representation. For a wide range of parameters we find that the SWA clearly outperforms the local update.
32 pages; appendix added; revised version published in Comput.Phys.Commun
References in corpus (13)
- Onset Transition to Cold Nuclear Matter from Lattice QCD with Heavy Quarks
- Method for simulating O(N) lattice models at finite density
- The QCD phase diagram according to the center group
- Efficient simulation of relativistic fermions via vertex models
- Cluster simulation of relativistic fermions in two space-time dimensions
- Worm algorithms for the 3-state Potts model with magnetic field and chemical potential
- Dual Computations of Non-abelian Yang-Mills on the Lattice
- Triviality of theory: small volume expansion and new data
- Simulating the All-Order Hopping Expansion II: Wilson Fermions
- Fermion bag approach to the sign problem in strongly coupled lattice QED with Wilson fermions
- Anomalous discrete chiral symmetry in the Gross-Neveu model and loop gas simulations
- Monte Carlo simulation of abelian gauge-Higgs lattice models using dual representation
- Dual Non-Abelian Yang-Mills Simulations in Four Dimensions