arXiv · hep-lat/0602018
Efficient Cluster Algorithm for CP(N-1) Models
Abstract
Despite several attempts, no efficient cluster algorithm has been constructed for CP(N-1) models in the standard Wilson formulation of lattice field theory. In fact, there is a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm. In this paper, we construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a regularization for CP(N-1) models in the framework of D-theory. We present detailed studies of the autocorrelations and find a dynamical critical exponent that is consistent with z = 0.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
B. B Beard, M. Pepe, S. Riederer, U. -J. Wiese. 2006-02-14. Efficient Cluster Algorithm for CP(N-1) Models. https://doi.org/10.1016/j.cpc.2006.06.007
Cite the original work for its findings. Save a collection to share your selection of sources.