Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Acta Physica Sinica

A LOOP-CLUSTER UPATING MONTE CARLO STUDY FOR THE TWO-DIMENSIONAL QHAF ON THE HEXAGONAL LATTICES

He Ying

Published Jan 1, 1995• 0 citations
OpenAlex

Abstract

A new type of cluster algorithm is developed to simulate the two-dimensional spin one half quantum Heisenberg antiferromagnet (QHAF) on a hexagonal lattice. The numerical results show that the method can be applied to study efficiently the QHAF systems at lowertemperatures, with large Trotter number, on the general bipartite lattices.

Related papers

A LOOP-CLUSTER UPATING MONTE CARLO STUDY FOR THE TWO-DIMENSIONAL QHAF ON THE HEXAGONAL LATTICES

Y. Heping, JI DA-REN, Zhigang Wang +1 more

A new type of cluster algorithm is developed to simulate the two-dimensional spin one half quantum Heisenberg antiferromagnet (QHAF) on a hexagonal lattice. The numerical results show that the method can be applied to study efficiently the QHAF systems at lowertemperatures, with large Trotter number, on the general bipartite lattices.

Acta Physica Sinica•Jan 1, 1995•0 citations

AN EFFICIENT CLUSTER ALGORITHM AND THE STUDY FOR THE TWO-DIMENSIONAL QUANTUM HEISENBERG ANTIFERROMAGNET

Ying He-Ping, JI DA-REN, (1)浙江大学物理系,杭州310027; (2)浙江近代物理中心,杭州310027

We develop a new type of cluster algorithm that strongly reduces the critical slowing down and the frustration effect in Monte Carlo simulations of the 2D quantum antiferro-magnet Heisenberg model (AFMH). The results obtained show that the method can be applied efficiently for the study of the 2D AFMH at lower temperatures.

Acta Physica Sinica•Jan 1, 1993•1 citation

Cluster-Spin Quantum Monte Carlo Study of One-Dimensional Heisenberg Model

Yutaka Okabe, Macoto Kikuchi

The cluster-spin decomposition method is studied for the quantum Monte Carlo simulation based on the Suzuki-Trotter formula. A new vectorized algorithm for the speed-up of the calculation is implemented. We investigate the one-dimensional ferromagnetic and antiferromagnetic Heisenberg models, paying attention to the cluster size of decomposition.

Journal of the Physical Society of Japan•Jun 15, 1987•8 citations

Meron-cluster simulation of the quantum antiferromagnetic Heisenberg model in a magnetic field in one- and two-dimensions

Palma, A. Riveros

Motivated by the numerical simulation of systems which display quantum phase transitions, we present a novel application of the meron-cluster algorithm to simulate the quantum antiferromagnetic Heisenberg model coupled to an external uniform magnetic field both in one and in two dimensions.In the infinite volume limit and at zero temperature we found numerical evidence that supports a quantum phase transition very close to the critical values B c = 2 and B c = 4 for the system in one and two dimensions, respectively.For the one dimensional system, we have compared the numerical data obtained with analytical predictions for the magnetization density as a function of the external field obtained by scaling-behaviour analysis and Bethe Ansatz techniques.Since there is no analytical solution for the two dimensional case, we have compared our results with the magnetization density obtained by scaling relations for small lattice sizes and with the approximated thermodynamical limit at zero temperature guessed by scaling relations.Moreover, we have compared the numerical data with other numerical simulations performed by using different algorithms in one and two dimensions, like the directed loop method.The numerical data obtained are in perfect agreement with all these previous results, which confirms that the meron-algorithm is reliable for quantum Monte Carlo simulations and applicable both in one and two dimensions.Finally, we have computed the integrated autocorrelation time to measure the efficiency of the meron algorithm in one dimension.

arXiv:1312.4915•Condensed Matter Physics•May 25, 2015•8 citations

Quantum Cluster Algorithm Monte Carlo Method and Its Application to Higher-Spin Heisenberg Antiferromagnets

Synge Todo

The quantum Monte Carlo technique for quantum magnets has been greatly improved during the last decade. In this paper, we review the quantum cluster algorithm (loop algorithm) for higher-spin Heisenberg antiferromagnets, together with some technical aspects including parallelization technique and with its application to low-dimensional Heisenberg antiferromagnets.

Progress of Theoretical Physics Supplement•Jan 1, 2002•3 citations

Stochastic series expansion method with operator-loop update

Anders W. Sandvik

A cluster update (the ``operator loop'') is developed within the framework of a numerically exact quantum Monte Carlo method based on the power series expansion of $\mathrm{exp}(\ensuremath{-}\ensuremath{\beta}H)$ (stochastic series expansion). The method is generally applicable to a wide class of lattice Hamiltonians for which the expansion is positive definite. For some important models the operator-loop algorithm is more efficient than loop updates previously developed for ``worldline'' simulations. The method is here tested on a two-dimensional anisotropic Heisenberg antiferromagnet in a magnetic field.

arXiv:cond-mat/9902226•Physical review. B, Condensed matter•Jun 1, 1999•747 citations
Motivated by the numerical simulation of systems which display quantum phase transitions, we present a novel application of the meron-cluster algorithm to simulate the quantum antiferromagnetic Heisenberg model coupled to an external uniform magnetic field both in one and in two dimensions.In the infinite volume limit and at zero temperature we found numerical evidence that supports a quantum phase transition very close to the critical values B c = 2 and B c = 4 for the system in one and two dimensions, respectively.For the one dimensional system, we have compared the numerical data obtained with analytical predictions for the magnetization density as a function of the external field obtained by scaling-behaviour analysis and Bethe Ansatz techniques.Since there is no analytical solution for the two dimensional case, we have compared our results with the magnetization density obtained by scaling relations for small lattice sizes and with the approximated thermodynamical limit at zero temperature guessed by scaling relations.Moreover, we have compared the numerical data with other numerical simulations performed by using different algorithms in one and two dimensions, like the directed loop method.The numerical data obtained are in perfect agreement with all these previous results, which confirms that the meron-algorithm is reliable for quantum Monte Carlo simulations and applicable both in one and two dimensions.Finally, we have computed the integrated autocorrelation time to measure the efficiency of the meron algorithm in one dimension.
A cluster update (the ``operator loop'') is developed within the framework of a numerically exact quantum Monte Carlo method based on the power series expansion of $\mathrm{exp}(\ensuremath{-}\ensuremath{\beta}H)$ (stochastic series expansion). The method is generally applicable to a wide class of lattice Hamiltonians for which the expansion is positive definite. For some important models the operator-loop algorithm is more efficient than loop updates previously developed for ``worldline'' simulations. The method is here tested on a two-dimensional anisotropic Heisenberg antiferromagnet in a magnetic field.