Efficient Cluster Algorithm for CP(N-1) Models

Simple item page
dc.creatorBeard, B. B
dc.creatorPepe, M.
dc.creatorRiederer, S.
dc.creatorWiese, U. -J.
dc.date2006-02-14
dc.date.accessioned2026-07-07T10:44:14Z
dc.date.available2026-07-07T10:44:14Z
dc.descriptionDespite 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.
dc.description14 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/hep-lat/0602018
dc.identifierhttp://arxiv.org/abs/hep-lat/0602018
dc.identifierComput.Phys.Commun.175:629-634,2006
dc.identifierdoi:10.1016/j.cpc.2006.06.007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/182524
dc.subjectHigh Energy Physics - Lattice
dc.titleEfficient Cluster Algorithm for CP(N-1) Models
dc.typetext

Files

Collections

arXiv