Efficient Cluster Algorithm for CP(N-1) Models

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, 3 figures

Keywords

High Energy Physics - Lattice

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/182524

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/hep-lat/0602018
 http://arxiv.org/abs/hep-lat/0602018
 Comput.Phys.Commun.175:629-634,2006
 doi:10.1016/j.cpc.2006.06.007

Collections

arXiv