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

arXiv:cond-mat/9204014 · Physics Letters A

Blockspin cluster algorithms for quantum spin systems

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

Published Aug 1, 1992• 27 citations
arXivHTMLPDF
DOI
10.1016/0375-9601(92)90077-y

Related papers

Blockspin scheme and cluster algorithm for quantum spin systems

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

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

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

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

Blockspin Cluster Algorithms for Quantum Spin Systems

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

Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are maped to blockspin models with two-blockspin interactions. Clusters of blockspins are updated collectively. The efficiency of the method is investigated in detail for one-dimensional spin chains. Then in most cases the new algorithms solve the problems of slowing down from which standard algorithms are suffering. Two-dimensional quantum spin systems are relevant for the description of the undoped anti-ferromagnetic precursor insulators of high-Tc superconductors. Presumably understanding the physics of the superconductors requires an understanding of their precursor insulators. This already is a nontrivial problem, which most likely does not allow for a complete analytic solution. Therefore it is natural to use a numerical approach to compute the properties of these materials. At present different

•Jan 1, 2008•30 citations

Cluster algorithms for anisotropic quantum spin models

Naoki Kawashima

arXiv:cond-mat/9506075•Journal of Statistical Physics•Jan 1, 1996•22 citations
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are maped to blockspin models with two-blockspin interactions. Clusters of blockspins are updated collectively. The efficiency of the method is investigated in detail for one-dimensional spin chains. Then in most cases the new algorithms solve the problems of slowing down from which standard algorithms are suffering. Two-dimensional quantum spin systems are relevant for the description of the undoped anti-ferromagnetic precursor insulators of high-Tc superconductors. Presumably understanding the physics of the superconductors requires an understanding of their precursor insulators. This already is a nontrivial problem, which most likely does not allow for a complete analytic solution. Therefore it is natural to use a numerical approach to compute the properties of these materials. At present different