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

Communications in Theoretical Physics

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

He-Ping Ying, JI DA-REN

Published Jun 15, 1994• 0 citations
Publisher

Abstract

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.

DOI
10.1088/0253-6102/21/4/421

Related papers

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

Blockspin Scheme and Cluster Algorithm for Quantum Spin Systems

He-Ping Ying, U.‐J. Wiese

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.

arXiv:hep-lat/9211034•Nov 12, 1992•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

SPIN CHAIN SIMULATIONS WITH A MERON CLUSTER ALGORITHM

Thomas Boyer‐Kassem, Wolfgang Bietenholz A, JAIR WUILLOUD

We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.

arXiv:cond-mat/0701331•International Journal of Modern Physics C•Sep 1, 2007•6 citations

A Coherent Updating Algorithm for the XYZ Model

He-Ping Ying, JI DA-REN

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.

Chinese Physics Letters•Mar 1, 1996•0 citations
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.
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.
We present a numerical study using a cluster algorithm for the 1-d S=1/2S=1/2S=1/2 quantum Heisenberg models. The dynamical critical exponent for anti-ferromagnetic chains is z=0.0(1)z=0.0(1)z=0.0(1) such that critical slowing down is eliminated.
We apply a meron cluster algorithm to the XY spin chain, which describes a quantum rotor. This is a multi-cluster simulation supplemented by an improved estimator, which deals with objects of half-integer topological charge. This method is powerful enough to provide precise results for the model with a θ-term — it is therefore one of the rare examples, where a system with a complex action can be solved numerically. In particular we measure the correlation length, as well as the topological and magnetic susceptibility. We discuss the algorithmic efficiency in view of the critical slowing down. Due to the excellent performance that we observe, it is strongly motivated to work on new applications of meron cluster algorithms in higher dimensions.