Efficient Cluster Algorithm for CP(N-1) Models

Details Efficient Cluster Algorithm for CP(N-1) Models Efficient Cluster Algorithm for CP(N-1) Models

2006-02-14

arxiv.org/abs/hep-lat/0602018v1

Comput.Phys.Commun.175:629-634,2006

Physics

High Energy Physics

High Energy Physics - Lattice

14 pages, 3 figures

Scientific paper

10.1016/j.cpc.2006.06.007

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.

Affiliated with

Also associated with

No associations

Rating

Efficient Cluster Algorithm for CP(N-1) Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Cluster Algorithm for CP(N-1) Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Cluster Algorithm for CP(N-1) Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568071