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

Chinese Physics Letters

A Coherent Updating Algorithm for the XYZ Model

He-Ping Ying, JI DA-REN

Published Mar 1, 1996• 0 citations
Publisher

Abstract

A scheme of loop-cluster algorithm is developed for simulating an anisotropic Heisenberg antiferromagnet–the XYZ model. Results of numerical simulations are presented, suggesting that this quantum system may also be studied by using the cluster updating techniques.
DOI
10.1088/0256-307x/13/3/017

Related papers

An updating scheme for the loop-cluster algorithm for the anisotropic Heisenberg antiferromagnet

He-Ping Ying, Feng Chen

Physics Letters A•Dec 1, 1995•0 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•761 citations

An Efficient Cluster Algorithm and Its Numerical Study for the Quantum Spin systems

He-Ping Ying, JI DA-REN

Using a blockspin scheme, a cluster algorithm is developed for the numerical study of the quantum spin systems. The method is tested in detail for the ferro- and antiferromagnetic Heisenberg chains, of which our calculations show that the new algorithm can be used to simulate the induced classical spin systems efficiently by strongly reducing the slowing down effects.

Communications in Theoretical Physics•Jun 15, 1994•0 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

BLOCKSPIN SCHEME AND THE CLUSTER-UPDATING ALGO-RITHMS FOR THE QUANTUM SPIN SYSTEMS

Ying He-Ping, U. J. WIESB

In this paper, we proposed a blockspin scheme and developed the usual cluster-updating algorithms for the one-and two-dimensional quantum spin systems, saying s=1/2 isotropic Hei-senberg models. The results for he ferro-and antiferro-magnet chains showed that the criti-cal slowing down (CSD) was indeed eliminated, and so it offered a possibility to improve the estimations in the lower-temperature region. We expect that the algorithms could also be ap-plied to the anisotropic or/and the higher-spin cases, as will as some other interesting models, such as eight-vortex lattice model and low-dimensional Fermi-systems.

Acta Physica Sinica•Jan 1, 1993•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
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.
In this paper, we proposed a blockspin scheme and developed the usual cluster-updating algorithms for the one-and two-dimensional quantum spin systems, saying s=1/2 isotropic Hei-senberg models. The results for he ferro-and antiferro-magnet chains showed that the criti-cal slowing down (CSD) was indeed eliminated, and so it offered a possibility to improve the estimations in the lower-temperature region. We expect that the algorithms could also be ap-plied to the anisotropic or/and the higher-spin cases, as will as some other interesting models, such as eight-vortex lattice model and low-dimensional Fermi-systems.