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

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

Victor Chudnovsky

Published Mar 1, 2000• 1 citation
Publisher
DOI
10.1016/s0920-5632(00)91776-6

Related papers

Correlation functions from quantum cluster algorithms: application to U(1) quantum spin and quantum link models

A. Tsapalis

arXiv:hep-lat/9810001•Nuclear Physics B - Proceedings Supplements•Mar 1, 1999•0 citations

A surface cluster algorithm for the U(1) quantum link model

Bernard B. Beard

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

Cluster algorithms for anisotropic quantum spin models

Naoki Kawashima

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

Quantum Cluster Algorithm Monte Carlo Method and Its Application to Higher-Spin Heisenberg Antiferromagnets

Synge Todo

The quantum Monte Carlo technique for quantum magnets has been greatly improved during the last decade. In this paper, we review the quantum cluster algorithm (loop algorithm) for higher-spin Heisenberg antiferromagnets, together with some technical aspects including parallelization technique and with its application to low-dimensional Heisenberg antiferromagnets.

Progress of Theoretical Physics Supplement•Jan 1, 2002•3 citations

Quantum Spin Lattice Models: A Coupled-Cluster Treatment

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

Springer eBooks•Jan 1, 1991•1 citation

Cluster algorithms with empahsis on quantum spin systems

James E. Gubernatis, Naoki Kawashima

The purpose of this lecture is to discuss in detail the generalized approach of Kawashima and Gubernatis for the construction of cluster algorithms. We first present a brief refresher on the Monte Carlo method, describe the Swendsen-Wang algorithm, show how this algorithm follows from the Fortuin-Kastelyn transformation, and re=interpret this transformation in a form which is the basis of the generalized approach. We then derive the essential equations of the generalized approach. This derivation is remarkably simple if done from the viewpoint of probability theory, and the essential assumptions will be clearly stated. These assumptions are implicit in all useful cluster algorithms of which we are aware. They lead to a quite different perspective on cluster algorithms than found in the seminal works and in Ising model applications. Next, we illustrate how the generalized approach leads to a cluster algorithm for world-line quantum Monte Carlo simulations of Heisenberg models with S = 1/2. More succinctly, we also discuss the generalization of the Fortuin- Kasetelyn transformation to higher spin models and illustrate the essential steps for a S = 1 Heisenberg model. Finally, we summarize how to go beyond S = 1 to a general spin, XYZ model.

•Oct 6, 1995•0 citations
The purpose of this lecture is to discuss in detail the generalized approach of Kawashima and Gubernatis for the construction of cluster algorithms. We first present a brief refresher on the Monte Carlo method, describe the Swendsen-Wang algorithm, show how this algorithm follows from the Fortuin-Kastelyn transformation, and re=interpret this transformation in a form which is the basis of the generalized approach. We then derive the essential equations of the generalized approach. This derivation is remarkably simple if done from the viewpoint of probability theory, and the essential assumptions will be clearly stated. These assumptions are implicit in all useful cluster algorithms of which we are aware. They lead to a quite different perspective on cluster algorithms than found in the seminal works and in Ising model applications. Next, we illustrate how the generalized approach leads to a cluster algorithm for world-line quantum Monte Carlo simulations of Heisenberg models with S = 1/2. More succinctly, we also discuss the generalization of the Fortuin- Kasetelyn transformation to higher spin models and illustrate the essential steps for a S = 1 Heisenberg model. Finally, we summarize how to go beyond S = 1 to a general spin, XYZ model.