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

Nuclear Physics B

Improved estimators for a cluster updating of O(n) spin models

Martin Hasenbusch B

Published Mar 1, 1990• 40 citations
Publisher
DOI
10.1016/0550-3213(90)90052-f

Related papers

Improving the improved estimator in O(N) spin models

Ferenc Niedermayer A

Physics Letters B•Mar 1, 1990•20 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

Adaptive cluster expansion for Ising spin models

Simona Cocco, Giancarlo Croce, Francesco Zamponi

arXiv:1906.05805•The European Physical Journal B•Nov 1, 2019•2 citations

Improved estimator of disorder observables in q-state Potts model

Ferdinando Gliozzi

In most lattice models the direct numerical evaluation of disorder observables is very noisy, owing to the non-local nature of these operators. It is pointed out that in the models where an updating cluster algorithm is implementable, like for instance in the q-state Potts model, one can define an estimator based on the linking properties of the clusters which produces a dramatic improvement of the measure of disorder operators of large size near criticality.

AIP conference proceedings•Jan 1, 2001•0 citations

Cluster algorithms for anisotropic quantum spin models

Naoki Kawashima

arXiv:cond-mat/9506075•Journal of Statistical Physics•Jan 1, 1996•22 citations

Improved Sweeping Cluster Algorithm for Quantum Dimer Model

Zheng Yan

Quantum dimer models~(QDMs) featured by strong geometric constraint are effective low energy descriptions of many quantum spin systems. The geometric restriction described by local gauge field, hinders the application of numerical algorithms. Before sweeping cluster method was applied in world-line quantum Monte Carlo (QMC) algorithm, there is only projector QMC which obey the constraints and could be used for calculation on QDMs. However, the projector QMC for QDMs has some drawbacks, e.g., it is not effective when the parameter interval away from Rokhsar-Kivelson (RK) point. That's because the projector method still lacks a cluster update to improve its efficiency. Although sweeping cluster algorithm improves the update for these systems, it also only works in one winding (topological) sector. In this paper, we improve the sweeping cluster method to sample in different winding sectors.

•Nov 16, 2020•5 citations
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.
Quantum dimer models~(QDMs) featured by strong geometric constraint are effective low energy descriptions of many quantum spin systems. The geometric restriction described by local gauge field, hinders the application of numerical algorithms. Before sweeping cluster method was applied in world-line quantum Monte Carlo (QMC) algorithm, there is only projector QMC which obey the constraints and could be used for calculation on QDMs. However, the projector QMC for QDMs has some drawbacks, e.g., it is not effective when the parameter interval away from Rokhsar-Kivelson (RK) point. That's because the projector method still lacks a cluster update to improve its efficiency. Although sweeping cluster algorithm improves the update for these systems, it also only works in one winding (topological) sector. In this paper, we improve the sweeping cluster method to sample in different winding sectors.