A Worm Algorithm for the Lattice CP(N-1) Model
arXiv:1703.08571
Abstract
The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for simulating 2D CP(N-1) on the lattice is much lower than the one for simulating 4D QCD. However to our knowledge, no efficient algorithm for simulating the lattice CP(N-1) model has been tested so far, which also works at finite density. To this end we propose and test a new type of worm algorithm which is appropriate to simulate the lattice CP(N-1) model in a dual, flux-variables based representation, in which the introduction of a chemical potential does not give rise to any complications.
7 pages, 3 figures, talk presented at the 34th annual International Symposium on Lattice Field Theory (LATTICE 2016), 24-30 July 2016, University of Southampton, UK