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/9506075 · Journal of Statistical Physics

Cluster algorithms for anisotropic quantum spin models

Naoki Kawashima

Published Jan 1, 1996• 22 citations
arXivHTMLPDF
DOI
10.1007/bf02189228

Related papers

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

Wolff algorithm and anisotropic continuous-spin models: An application to the spin–van der Waals model

Marco D’Onorio De Meo, Suhk Kun Oh

The problem of applying Wolff's cluster algorithm to anisotropic classical spin models is resolved by modifying a part of the Wolff algorithm. To test the effectiveness of our modified algorithm, the spin--van der Waals model is investigated in detail. Our estimate of the dynamical exponent of the model is z=0.19\ifmmode\pm\else\textpm\fi{}0.04.

Physical review. B, Condensed matter•Jul 1, 1992•6 citations

Quantum Spin Lattice Models: A Coupled-Cluster Treatment

R. F. Bishop, John B. Parkinson, Yang Xian

Springer eBooks•Jan 1, 1991•1 citation

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

Cluster representations and the Wolff algorithm in arbitrary external fields

Jaron Kent-Dobias, James P. Sethna

We introduce a natural way to extend celebrated spin-cluster Monte Carlo algorithms for fast thermal lattice simulations at criticality, such as the Wolff algorithm, to systems in arbitrary fields, be they linear magnetic vector fields or nonlinear anisotropic ones. By generalizing the ``ghost spin'' representation to one with a ``ghost transformation,'' global invariance to spin symmetry transformations is restored at the cost of an extra degree of freedom which lives in the space of symmetry transformations. The ordinary cluster-building process can then be run on the representation. We show that this extension preserves the scaling of accelerated dynamics in the absence of a field for Ising, Potts, and $\mathrm{O}(n)$ models and demonstrate the method's use in modeling the presence of novel nonlinear fields. We also provide a c++ library for the method's convenient implementation for arbitrary models.

arXiv:1805.04019•Physical review. E•Dec 7, 2018•42 citations

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

Naoki Kawashima

APS•Mar 1, 1998•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.
We introduce a natural way to extend celebrated spin-cluster Monte Carlo algorithms for fast thermal lattice simulations at criticality, such as the Wolff algorithm, to systems in arbitrary fields, be they linear magnetic vector fields or nonlinear anisotropic ones. By generalizing the ``ghost spin'' representation to one with a ``ghost transformation,'' global invariance to spin symmetry transformations is restored at the cost of an extra degree of freedom which lives in the space of symmetry transformations. The ordinary cluster-building process can then be run on the representation. We show that this extension preserves the scaling of accelerated dynamics in the absence of a field for Ising, Potts, and O(n)\mathrm{O}(n)O(n) models and demonstrate the method's use in modeling the presence of novel nonlinear fields. We also provide a c++ library for the method's convenient implementation for arbitrary models.