Cluster algorithms for general-S quantum spin systems
We present a general strategy to extend quantum cluster algorithms for S = 1 / 2 spin systems, such as the loop algorithm, to those with an arbitrary size of spins. The partition function of a high- S spin system is generally represented by the path integral of a S = 1 / 2 model with special boundar...
Saved in:
| Published in | Physical review letters Vol. 87; no. 4; p. 047203 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
United States
23.07.2001
|
| Online Access | Get more information |
| ISSN | 0031-9007 |
| DOI | 10.1103/PhysRevLett.87.047203 |
Cover
| Summary: | We present a general strategy to extend quantum cluster algorithms for S = 1 / 2 spin systems, such as the loop algorithm, to those with an arbitrary size of spins. The partition function of a high- S spin system is generally represented by the path integral of a S = 1 / 2 model with special boundary conditions in the imaginary-time direction. We introduce additional graphs for the boundary part and give the labeling probability explicitly, which completes the algorithm together with an existing S = 1 / 2 algorithm. As a demonstration, we simulate the integer-spin antiferromagnetic Heisenberg chains. The magnitude of the first excitation gap is estimated to be 0.41048(6), 0.08917(4), and 0.01002(3) for S = 1, 2, and 3, respectively. |
|---|---|
| ISSN: | 0031-9007 |
| DOI: | 10.1103/PhysRevLett.87.047203 |