Blockspin Cluster Algorithms for Quantum Spin Systems
arXiv:cond-mat/9204014 · doi:10.1016/0375-9601(92)90077-Y
Abstract
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are maped to blockspin models with two-blockspin interactions. Clusters of blockspins are updated collectively. The efficiency of the method is investigated in detail for one-dimensional spin chains. Then in most cases the new algorithms solve the problems of slowing down from which standard algorithms are suffering.
11 pages
Cited by in corpus (16)
- Cluster Algorithm for Vertex Models
- Meron-Cluster Solution of Fermion Sign Problems
- Nature of the quantum phase transitions in the two-dimensional hardcore boson model
- Asymptotic scaling of the square lattice quantum Heisenberg antiferromagnet
- Accessing the dynamics of large many-particle systems using Stochastic Series Expansion
- Cluster counting: The Hoshen-Kopelman algorithm vs. spanning tree approaches
- Quantum magnetism in the stripe phase: bond- versus site order
- Bosonization and Cluster Updating of Lattice Fermions
- Meron-Cluster Simulation of a Chiral Phase Transition with Staggered Fermions
- Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets
- Meron-Cluster Solution of Fermion and Other Sign Problems
- Dynamic Monte Carlo Study of the Two-Dimensional Quantum XY Model
- Quantum Monte Carlo Loop Algorithm for the t-J Model
- Meron-cluster algorithms and chiral symmetry breaking in a (2+1)-d staggered fermion model
- Efficient Cluster Algorithm for CP(N-1) Models
- Exact duality and dual Monte-Carlo simulation for the Bosonic Hubbard model