Cluster algorithms for general-S quantum spin systems

TL;DR

This paper develops a general method to extend quantum cluster algorithms from S=1/2 spin systems to arbitrary spin sizes, enabling efficient simulations of high-spin quantum models.

Contribution

The authors introduce a novel extension of quantum cluster algorithms to arbitrary spin sizes by representing high-S systems as path integrals of S=1/2 models with special boundary conditions.

Findings

Successfully simulated integer-spin antiferromagnetic Heisenberg chains.

Estimated the first excitation gap for S=1, 2, and 3 with high precision.

Demonstrated the algorithm's effectiveness for high-spin quantum systems.

Abstract

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.