Blockspin Scheme and Cluster Algorithm for Quantum Spin Systems

TL;DR

This paper introduces a cluster algorithm for 1D quantum Heisenberg models that effectively eliminates critical slowing down, enabling more efficient simulations of quantum spin systems.

Contribution

The paper develops a novel cluster algorithm for 1D quantum Heisenberg models that reduces critical slowing down, improving computational efficiency.

Findings

Critical exponent z=0.0(1) for antiferromagnetic chains.

Critical slowing down is eliminated using the proposed algorithm.

Enhanced efficiency in simulating quantum spin systems.

Abstract

We present a numerical study using a cluster algorithm for the 1-d $S=1/2$ quantum Heisenberg models. The dynamical critical exponent for anti-ferromagnetic chains is $z=0.0(1)$ such that critical slowing down is eliminated.