Blockspin cluster algorithms for quantum spin systems

@article{Wiese1992BlockspinCA,
  title={Blockspin cluster algorithms for quantum spin systems},
  author={U. Wiese and Heping Ying},
  journal={Physics Letters A},
  year={1992},
  volume={168},
  pages={143-150}
}
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 mapped 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… 

Figures and Tables from this paper

Blockspin scheme and cluster algorithm for 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
The Efficiency of a Cluster Algorithm for the Quantum Heisenberg Model on a Kagome Lattice
Experiments with electronand hole-doped antiferromagnetic materials show interesting properties at low temperatures, such as high temperature superconductivity (high Tc) and quantum
Loop-cluster algorithm: an application for the 2D quantum Heisenberg antiferromagnet
Abstract A new type of cluster algorithm that strongly reduces the critical slowing down and frustration effects is developed to stimulate the spin one half quantum Heisenberg antiferromagnet. The
Cluster Monte Carlo Method for Quantum Systems
TLDR
The general framework of the cluster Monte Carlo algorithms for quantum systems is reviewed and a new algorithm is applied to the one-dimensional t-J model and has proved to reduce the autocorrelation time by a few orders of magnitude.
Quantum Monte Carlo Methods
We present a review of quantum Monte Carlo algorithms for the simulation of quantum magnets. A general introduction to Monte Carlo sampling is followed by an overview of local updates, cluster
Improvements in cluster algorithms for quantum spin systems
Loop cluster algorithms provide an efficient implementation of the Monte Carlo technique for evaluating path integrals. The work described here represents improvement in the state of the art in
Meron-cluster solution of fermion and other sign problems
Abstract Numerical simulations of numerous quantum systems suffer from the notorious sign problem. Important examples include QCD and other field theories at non-zero chemical potential, at non-zero
AN UPDATING SCHEME FOR THE LOOP-CLUSTER ALGORITHM FOR THE ANISOTROPIC HEISENBERG ANTIFERROMAGNET
Abstract A loop-cluster algorithm is proposed to overcome the critical slowing down in simulations of the anisotropic Heisenberg antiferromagnet, the XYZ model. The primary features of the algorithm
Monte Carlo Simulations of the Quantum X-Y Model by a Loop-Cluster Algorithm
The quantum X-Y model of interacting spins on square lattices is simulated by a loop-cluster algorithm. It is shown that the method can be used to simulate the systems efficiently at low temperatures
Generalization of the Fortuin-Kasteleyn transformation and its application to quantum spin simulations
We generalize the Fortuin-Kasteleyn (FK) cluster representation of the partition function of the Ising model to represent the partition function of quantum spin models with an arbitrary spin
...
1
2
3
...

References

SHOWING 1-10 OF 14 REFERENCES
Monte Carlo Simulation of Quantum Spin Systems. I
A general explicit formulation of Monte Carlo simulation for quantum systems is given in this paper on the basis of the previous fundamental proposal by Suzuki. This paper also demonstrates
Relationship between d-Dimensional Quantal Spin Systems and (d+1)-Dimensional Ising Systems: Equivalence, Critical Exponents and Systematic Approximants of the Partition Function and Spin Correlations
The partition function of a quantal spin system is expressed by that of the Ising model, on the basis of the generalized Trotter formula. Thereby the ground state of the d-dimensional Ising model
Two-dimensional spin-1/2 Heisenberg antiferromagnet: A quantum Monte Carlo study.
  • Makivic, Ding
  • Physics, Medicine
    Physical review. B, Condensed matter
  • 1991
TLDR
A fast and efficient multispin coding algorithm on a parallel supercomputer, based on the Suzuki-Trotter transformation, is developed, which shows that the correlation length and staggered susceptibility are quantitatively well described by the renormalized classical picture at the two-loop level of approximation.
Collective Monte Carlo updating for spin systems.
  • Wolff
  • Physics, Medicine
    Physical review letters
  • 1989
A Monte Carlo algorithm is presented that updates large clusters of spins simultaneously in systems at and near criticality. We demonstrate its efficiency in the two-dimensional $\mathrm{O}(n)$
THE 2D HEISENBERG ANTIFERROMAGNET IN HIGH-Tc SUPERCONDUCTIVITY: A Review of Numerical Techniques and Results
In this article we review numerical studies of the quantum Heisenberg antiferromagnet on a square lattice, which is a model of the magnetic properties of the undoped “precursor insulators” of the
Monte Carlo studies of one-dimensional quantum Heisenberg and XY models
The Suzuki-Trotter transformation has been used to transform $N$-spin $S=\frac{1}{2}$ Heisenberg and $\mathrm{XY}$ chains into two-dimensional ($N\ifmmode\times\else\texttimes\fi{}2m$) classical
Nonuniversal critical dynamics in Monte Carlo simulations.
A new approach to Monte Carlo simulations is presented, giving a highly efficient method of simulation for large systems near criticality. The algorithm violates dynamic universality at second-order
Phys. Rev
  • Phys. Rev
  • 1991
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 1989
Phys. Rev. Lett
  • Phys. Rev. Lett
  • 1987
...
1
2
...