Cluster algorithms for general-S quantum spin systems

Details Cluster algorithms for general-S quantum spin systems Cluster algorithms for general-S quantum spin systems

1999-11-04

arxiv.org/abs/cond-mat/9911047v2

Phys. Rev. Lett. 87, 047203 (2001)

Physics

Condensed Matter

Statistical Mechanics

RevTeX, 5 pages including 2 EPS figures; accepted for publication in Phys. Rev. Lett

Scientific paper

10.1103/PhysRevLett.87.047203

We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in terms of the path integral of a S=1/2 model with special boundary conditions. We introduce additional graphs to be assigned to the boundary part and give the labeling probability explicitly, which completes the algorithm together with an existing S=1/2 cluster algorithm. As a demonstration of the algorithm, we simulate the the integer-spin antiferromagnetic Heisenberg chains. The magnitude of the first excitation gap is estimated as to be 0.41048(6), 0.08917(4), and 0.01002(3) for S=1, 2, and 3, respectively.

Affiliated with

Also associated with

No associations

Rating

Cluster algorithms for general-S quantum spin systems 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 Cluster algorithms for general-S quantum spin systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cluster algorithms for general-S quantum spin systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-82109