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

Journal of Computational Physics

Accelerated Monte Carlo by embedded cluster dynamics

Richard C. Brower, N. A. Gross, Kevin J. M. Moriarty

Published Jul 1, 1991• 3 citations
Publisher

Abstract

We present an overview of the new methods for embedding Ising spins in continuous fields to achieve accelerated cluster Monte Carlo algorithms. The methods of Brower and Tamayo and Wolff are summarized and variations are suggested for the O(N) models based on multiple embedded Z2 spin components and/or correlated projections. Topological features are discussed for the XY model and numerical simulations presented for d=2, d=3 and mean field theory lattices.

DOI
10.1016/0021-9991(91)90257-l

Related papers

Quantum Monte Carlo Methods: Algorithms for Lattice Models

James E. Gubernatis, Naoki Kawashima, Philipp Werner

Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.

Cambridge University Press eBooks•Jan 31, 2016•237 citations

Cluster hybrid Monte Carlo simulation algorithms

J. A. Plascak, Alan M. Ferrenberg, David Paul Landau

We show that addition of Metropolis single spin flips to the Wolff cluster-flipping Monte Carlo procedure leads to a dramatic increase in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the Metropolis or heat bath algorithms in systems where just cluster flipping is not immediately obvious (such as the spin-3/2 Ising model) can substantially reduce the statistical errors of the simulations. A further advantage of these methods is that systematic errors introduced by the use of imperfect random-number generation may be largely healed by hybridizing single spin flips with cluster flipping.

arXiv:cond-mat/0205264•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jun 13, 2002•39 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•43 citations

Continuous-time Monte Carlo methods for quantum impurity models

Emanuel Gull, Andrew J. Millis, Alexander I. Lichtenstein +3 more

Quantum impurity models describe an atom or molecule embedded in a host material with which it can exchange electrons. They are basic to nanoscience as representations of quantum dots and molecular conductors and play an increasingly important role in the theory of ``correlated electron'' materials as auxiliary problems whose solution gives the ``dynamical mean-field'' approximation to the self-energy and local correlation functions. These applications require a method of solution which provides access to both high and low energy scales and is effective for wide classes of physically realistic models. The continuous-time quantum Monte Carlo algorithms reviewed in this article meet this challenge. Derivations and descriptions of the algorithms are presented in enough detail to allow other workers to write their own implementations, discuss the strengths and weaknesses of the methods, summarize the problems to which the new methods have been successfully applied, and outline prospects for future applications.

arXiv:1012.4474•Reviews of Modern Physics•May 5, 2011•1,606 citations

MONTE CARLO METHODS IN SEQUENTIAL AND PARALLEL COMPUTING OF 2D AND 3D ISING MODEL

M. Diaconu, R. Puscasu, Alexandru Stancu +1 more

Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic quantities, such as specific heat and magnetic susceptibility. We studied the differences between these methods. Local MC algorithms (such as Metropolis) perform poorly for large lattices because they update only one spin at a time, so it takes many iterations to get a statistically independent configuration. More recent spin cluster algorithms use clever ways of finding clusters of sites that can be updated at once. The single cluster method is probably the best sequential cluster algorithm. We also used the entropic sampling method to simulate the density of states. This method takes into account all possible configurations, not only the most probable. The entropic method also gives good results in the 3D case. We studied the usefulness of distributed computing for Ising model. We established a parallelization strategy to explore Metropolis Monte Carlo simulation and Swendsen-Wang Monte Carlo simulation of this spin model using the data parallel languages on different platform. After building a computer cluster we made a Monte Carlo estimation of 2D and 3D Ising thermodynamic properties and compare the results with the sequential computing. In the same time we made quantitative analysis such as speed up and efficiency for different sets of combined parameters (e.g. lattice size, parallel algorithms, chosen model).

•Jan 1, 2003•0 citations

The Development of Cluster and Histogram Methods

Robert H. Swendsen

This talk will review the history of both cluster and histogram methods for Monte Carlo simulations. Cluster methods are based on the famous exact mapping by Fortuin and Kasteleyn from general Potts models onto a percolation representation. I will discuss the Swendsen‐Wang algorithm, as well as its improvement and extension to more general spin models by Wolff. The Replica Monte Carlo method further extended cluster simulations to deal with frustrated systems. The history of histograms is quite extensive, and can only be summarized briefly in this talk. It goes back at least to work by Salsburg et al. in 1959. Since then, it has been forgotten and rediscovered several times. The modern use of the method has exploited its ability to efficiently determine the location and height of peaks in various quantities, which is of prime importance in the analysis of critical phenomena. The extensions of this approach to the multiple histogram method and multicanonical ensembles have allowed information to be obtained over a broad range of parameters. Histogram simulations and analyses have become standard techniques in Monte Carlo simulations.

AIP conference proceedings•Jan 1, 2003•0 citations
We present an overview of the new methods for embedding Ising spins in continuous fields to achieve accelerated cluster Monte Carlo algorithms. The methods of Brower and Tamayo and Wolff are summarized and variations are suggested for the O(N) models based on multiple embedded Z2 spin components and/or correlated projections. Topological features are discussed for the XY model and numerical simulations presented for d=2, d=3 and mean field theory lattices.
Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in quantum Monte Carlo techniques.
We show that addition of Metropolis single spin flips to the Wolff cluster-flipping Monte Carlo procedure leads to a dramatic increase in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the Metropolis or heat bath algorithms in systems where just cluster flipping is not immediately obvious (such as the spin-3/2 Ising model) can substantially reduce the statistical errors of the simulations. A further advantage of these methods is that systematic errors introduced by the use of imperfect random-number generation may be largely healed by hybridizing single spin flips with cluster flipping.
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.
Quantum impurity models describe an atom or molecule embedded in a host material with which it can exchange electrons. They are basic to nanoscience as representations of quantum dots and molecular conductors and play an increasingly important role in the theory of ``correlated electron'' materials as auxiliary problems whose solution gives the ``dynamical mean-field'' approximation to the self-energy and local correlation functions. These applications require a method of solution which provides access to both high and low energy scales and is effective for wide classes of physically realistic models. The continuous-time quantum Monte Carlo algorithms reviewed in this article meet this challenge. Derivations and descriptions of the algorithms are presented in enough detail to allow other workers to write their own implementations, discuss the strengths and weaknesses of the methods, summarize the problems to which the new methods have been successfully applied, and outline prospects for future applications.
Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic quantities, such as specific heat and magnetic susceptibility. We studied the differences between these methods. Local MC algorithms (such as Metropolis) perform poorly for large lattices because they update only one spin at a time, so it takes many iterations to get a statistically independent configuration. More recent spin cluster algorithms use clever ways of finding clusters of sites that can be updated at once. The single cluster method is probably the best sequential cluster algorithm. We also used the entropic sampling method to simulate the density of states. This method takes into account all possible configurations, not only the most probable. The entropic method also gives good results in the 3D case. We studied the usefulness of distributed computing for Ising model. We established a parallelization strategy to explore Metropolis Monte Carlo simulation and Swendsen-Wang Monte Carlo simulation of this spin model using the data parallel languages on different platform. After building a computer cluster we made a Monte Carlo estimation of 2D and 3D Ising thermodynamic properties and compare the results with the sequential computing. In the same time we made quantitative analysis such as speed up and efficiency for different sets of combined parameters (e.g. lattice size, parallel algorithms, chosen model).
This talk will review the history of both cluster and histogram methods for Monte Carlo simulations. Cluster methods are based on the famous exact mapping by Fortuin and Kasteleyn from general Potts models onto a percolation representation. I will discuss the Swendsen‐Wang algorithm, as well as its improvement and extension to more general spin models by Wolff. The Replica Monte Carlo method further extended cluster simulations to deal with frustrated systems. The history of histograms is quite extensive, and can only be summarized briefly in this talk. It goes back at least to work by Salsburg et al. in 1959. Since then, it has been forgotten and rediscovered several times. The modern use of the method has exploited its ability to efficiently determine the location and height of peaks in various quantities, which is of prime importance in the analysis of critical phenomena. The extensions of this approach to the multiple histogram method and multicanonical ensembles have allowed information to be obtained over a broad range of parameters. Histogram simulations and analyses have become standard techniques in Monte Carlo simulations.