Cluster algorithms with empahsis on quantum spin systems [electronic resource].
- Washington, D.C. : United States. Dept. of Energy, 1995.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
- Physical Description:
- 20 pages : digital, PDF file
- Additional Creators:
- Los Alamos National Laboratory
United States. Department of Energy
United States. Department of Energy. Office of Scientific and Technical Information
- 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.
- Published through SciTech Connect.
Euroconference on computer simulation on physics and chemistry, Como (Italy), 3-28 Jul 1995.
Gubernatis, J.E.; Kawashima, Naoki.
- Funding Information:
View MARC record | catkey: 14353818