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

Chinese Physics Letters

Monte Carlo Simulations of the Quantum X-Y Model by a Loop-Cluster Algorithm

JI DA-REN, He-Ping Ying

Published Jan 1, 1994• 4 citations
Publisher

Abstract

The quantum X-Y model of interacting spins on square lattices is simulated by a loop-cluster algorithm. It is shown that the method can be used to simulate the systems efficiently at low temperatures for lattices as large as 32×32×200.
DOI
10.1088/0256-307x/11/1/014

Related papers

Short-loop algorithm for quantum Monte Carlo simulations

Ying-Jer Kao, Roger G. Melko

We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where nonlocal cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase simulation efficiency in cases where conventional loops become very large, do not close altogether, or otherwise behave poorly. We demonstrate and characterize some aspects of the short loop on a square lattice spin-1/2 XXZ model where, remarkably, a significant increase in simulation efficiency is observed in some parameter regimes. The simplicity of the model provides a prototype for the use of short loops on more complicated quantum systems.

arXiv:0709.1718•Physical Review E•Mar 25, 2008•2 citations

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.

•Jun 24, 2016•47 citations

Efficient Monte Carlo Algorithm in Quasi-One-Dimensional Ising Spin Systems

Tota Nakamura

We develop an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with highly anisotropic exchange interactions. Both correlation time and real CPU time are reduced drastically. The algorithm is demonstrated in the layered triangular-lattice antiferromagnetic Ising model. We have obtained the relation between the transition temperature and the exchange interaction parameters, which modifies the result of the chain-mean-field theory.

arXiv:0809.2969•Physical Review Letters•Nov 20, 2008•20 citations

Quantum Monte Carlo Methods

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•205 citations

Transition-Matrix Monte Carlo Method for Quantum Systems

Chiaki Yamaguchi, Naoki Kawashima, Yutaka Okabe

We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole range of temperature. The method is based on several recent findings in Monte Carlo techniques, such as the loop algorithm and the transition matrix Monte Carlo method. In particular, we derive an exact relation between the DOS and the expectation value of the transition probability for quantum systems, which turns out to be useful in reducing the statistical errors in various estimates.

arXiv:cond-mat/0312645•Journal of the Physical Society of Japan•Jul 15, 2004•4 citations

Loop algorithms for quantum simulations of fermion models on lattices

Naoki Kawashima, James E. Gubernatis, Hans Gerd Evertz

Two cluster algorithms, based on constructing and flipping loops, are presented for world-line quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip and loop-exchange algorithms. For these two algorithms and the standard world-line algorithm, we calculated the autocorrelation times for various physical quantities and found that the ordinary world-line algorithm, which uses only local moves, suffers from very long correlation times that makes not only the estimate of the error difficult but also the estimate of the average values themselves difficult. These difficulties are especially severe in the low-temperature, large-U regime. In contrast, we find that new algorithms, when used alone or in combinations with themselves and the standard algorithm, can have significantly smaller autocorrelation times, in some cases being smaller by three orders of magnitude. The new algorithms, which use nonlocal moves, are discussed from the point of view of a general prescription for developing cluster algorithms. The loop-flip algorithm is also shown to be ergodic and to belong to the grand canonical ensemble. Extensions to other models and higher dimensions are briefly discussed.

arXiv:cond-mat/9403082•Physical review. B, Condensed matter•Jul 1, 1994•56 citations
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where nonlocal cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase simulation efficiency in cases where conventional loops become very large, do not close altogether, or otherwise behave poorly. We demonstrate and characterize some aspects of the short loop on a square lattice spin-1/2 XXZ model where, remarkably, a significant increase in simulation efficiency is observed in some parameter regimes. The simplicity of the model provides a prototype for the use of short loops on more complicated quantum systems.
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 develop an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with highly anisotropic exchange interactions. Both correlation time and real CPU time are reduced drastically. The algorithm is demonstrated in the layered triangular-lattice antiferromagnetic Ising model. We have obtained the relation between the transition temperature and the exchange interaction parameters, which modifies the result of the chain-mean-field theory.
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 propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole range of temperature. The method is based on several recent findings in Monte Carlo techniques, such as the loop algorithm and the transition matrix Monte Carlo method. In particular, we derive an exact relation between the DOS and the expectation value of the transition probability for quantum systems, which turns out to be useful in reducing the statistical errors in various estimates.
Two cluster algorithms, based on constructing and flipping loops, are presented for world-line quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip and loop-exchange algorithms. For these two algorithms and the standard world-line algorithm, we calculated the autocorrelation times for various physical quantities and found that the ordinary world-line algorithm, which uses only local moves, suffers from very long correlation times that makes not only the estimate of the error difficult but also the estimate of the average values themselves difficult. These difficulties are especially severe in the low-temperature, large-U regime. In contrast, we find that new algorithms, when used alone or in combinations with themselves and the standard algorithm, can have significantly smaller autocorrelation times, in some cases being smaller by three orders of magnitude. The new algorithms, which use nonlocal moves, are discussed from the point of view of a general prescription for developing cluster algorithms. The loop-flip algorithm is also shown to be ergodic and to belong to the grand canonical ensemble. Extensions to other models and higher dimensions are briefly discussed.