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 - Proceedings Supplements

Blockspin scheme and cluster algorithm for quantum spin systems

U.‐J. Wiese, H.-P. Ying

Published Mar 1, 1993• 1 citation
Publisher
DOI
10.1016/0920-5632(93)90209-o

Related papers

Blockspin cluster algorithms for quantum spin systems

U.‐J. Wiese, H.-P. Ying

arXiv:cond-mat/9204014•Physics Letters A•Aug 1, 1992•27 citations

Cluster algorithms for general quantum spin systems and its application to Kosterlitz-Thouless transition

Naoki Kawashima

APS•Mar 1, 1998•0 citations

Fixed Cluster Algorithm for Unfrustrated Spin Systems

Tanniemola B. Liverpool, Sharon C. Glotzer

APS•Mar 1, 1996•0 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

Higher-Spin Cluster Algorithms: the Heisenberg Spin and U(1) Quantum Link Models

Victor Chudnovsky

Nuclear Physics B - Proceedings Supplements•Mar 1, 2000•1 citation

Efficient Algorithms for Weakly-Interacting Quantum Spin Systems

Ryan L. Mann, Gabriel Waite

We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling scheme for the thermal distribution over a classical spin space. Our approach is based on the cluster expansion method and a standard reduction from approximate sampling to approximate counting.

quant-pharXiv:2601.21140•Physical Review A•Jan 30, 2026•0 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.