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

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

2005-10-06

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

PoS LAT2005 (2005) 113

Physics

High Energy Physics

High Energy Physics - Lattice

6 pages, no figure. Talk presented at Lattice 2005 (Machines and Algorithms) in Dublin, Ireland

Scientific paper

We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach to quantum field theory formulated in terms of discrete quantum variables instead of classical fields. Despite several attempts, no efficient cluster algorithm has been constructed for CP(N-1) models in the standard formulation of lattice field theory. In fact, there is even a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm. We present various simulations for different correlation lengths, couplings and lattice sizes. We have simulated correlation lengths up to 250 lattice spacings on lattices as large as 640x640 and we detect no evidence for critical slowing down.

Affiliated with

Also associated with

No associations

Rating

An 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 An 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 An Efficient Cluster Algorithm for CP(N-1) Models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-323898