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:physics/0306128 · AIP conference proceedings

Non-local Updates for Quantum Monte Carlo Simulations

Matthias Troyer

Published Jan 1, 2003• 29 citations
arXivHTMLPDF

Abstract

We review the development of update schemes for quantum lattice models simulated using world line quantum Monte Carlo algorithms. Starting from the Suzuki‐Trotter mapping we discuss limitations of local update algorithms and highlight the main developments beyond Metropolis‐style local updates: the development of cluster algorithms, their generalization to continuous time, the worm and directed‐loop algorithms and finally a generalization of the flat histogram method of Wang and Landau to quantum systems.

DOI
10.1063/1.1632126

Related papers

Recent Developments of World-Line Monte Carlo Methods

Naoki Kawashima, Kenji Harada

World-line quantum Monte Carlo methods are reviewed with an emphasis on breakthroughs made in recent years. In particular, three algorithms -- the loop algorithm, the worm algorithm, and the directed-loop algorithm -- for updating world-line configurations are presented in a unified perspective. Detailed descriptions of the algorithms in specific cases are also given.

arXiv:cond-mat/0312675•Journal of the Physical Society of Japan•Jun 15, 2004•130 citations

Towards a quantum Monte Carlo for lattice systems

S. Figueroa-Manrique, Karen Rodríguez

In this work we build the foundations of a quantum Monte Carlo as a stochastic numerical method to solve lattice many-body quantum systems with nearest-neighbor interactions at most. As motivation, we briefly describe the bilinear-biquadratic Heisenberg model with an external field, for spin-1 particles, as an effective Hamiltonian of the Bose-Hubbard model with an external quadratic Zeeman field in the Mott insulator phase at unit filling. Then, we discuss how to implement the world line Monte Carlo with local updates to circumvent the difficulties that arise on these type of systems by mapping the quantum partition function into the one of an effective classical model, in one additional dimension, given by the imaginary time evolution of the system. Such a mapping is performed by means of the Suzuki-Trotter decomposition, which transforms the original partition function into a summation of weights given by the classical configurations. Later, we present a set of observables that can be measured through this method and show how to use a Metropolis update scheme to accomplish the measurements. At last, we present the maximization of the configuration weights for three parameter sets as the first and relevant step to perform future measurements.

Suplemento de la Revista Mexicana de Física•Aug 22, 2020•0 citations

World-Line Monte Carlo Methods

Naoki Kawashima, Kenji Harada

World-line quantum Monte Carlo methods are reviewed with an emphasis on breakthroughs made in recent years. In particular, three algorithms -- the loop algorithm, the worm algorithm, and the directed-loop algorithm -- for updating world-line configurations are presented in a unified perspective. Detailed descriptions of the algorithms in specific cases are also given.

•Dec 29, 2003•0 citations

Improved directed loop method for Quantum Monte Carlo simulations

Fabien Alet

Efficient schemes called directed loops for cluster updates in Quantum Monte Carlo simulations have recently been proposed, which improve both the efficiency and precision for simulations of quantum models. In this work we show that local detailed balance is not necessary in order to fulfill global detailed balance during the construction of these loops. We therefore propose to insert additional degrees of freedom into the directed loop equations, resulting in even more efficient algorithms. Our approach works directly in the natural representation of an extended space where the matrix elements of the operators defining the worm (broken worldline segments) are taken into account.

AIP conference proceedings•Jan 1, 2003•0 citations

QUANTUM MONTE CARLO AND RELATED METHODS — RECENT DEVELOPMENTS —

Naomichi Hatano, Masuo Suzuki

Quantum Monte Carlo methods are reviewed with emphasis on their methodological aspects. Methods based on the Suzuki-Trotter approximation, namely the world-line approach and the auxiliary-field approach, are mainly described. The transfer-matrix method, which is closely related to the quantum Monte Carlo methods, is also reviewed. Recently developed arguments on the negative-sign problem are presented.

WORLD SCIENTIFIC eBooks•Dec 1, 1993•13 citations

Generalized directed loop method for quantum Monte Carlo simulations

Fabien Alet, Stefan Weßel, Matthias Troyer

Efficient quantum Monte Carlo update schemes called directed loops have recently been proposed, which improve the efficiency of simulations of quantum lattice models. We propose to generalize the detailed balance equations at the local level during the loop construction by accounting for the matrix elements of the operators associated with open world-line segments. Using linear programming techniques to solve the generalized equations, we look for optimal construction schemes for directed loops. This also allows for an extension of the directed loop scheme to general lattice models, such as high-spin or bosonic models. The resulting algorithms are bounce free in larger regions of parameter space than the original directed loop algorithm. The generalized directed loop method is applied to the magnetization process of spin chains in order to compare its efficiency to that of previous directed loop schemes. In contrast to general expectations, we find that minimizing bounces alone does not always lead to more efficient algorithms in terms of autocorrelations of physical observables, because of the nonuniqueness of the bounce-free solutions. We therefore propose different general strategies to further minimize autocorrelations, which can be used as supplementary requirements in any directed loop scheme. We show by calculating autocorrelation times for different observables that such strategies indeed lead to improved efficiency; however, we find that the optimal strategy depends not only on the model parameters but also on the observable of interest.

arXiv:cond-mat/0308495•Physical Review E•Mar 22, 2005•258 citations
We review the development of update schemes for quantum lattice models simulated using world line quantum Monte Carlo algorithms. Starting from the Suzuki‐Trotter mapping we discuss limitations of local update algorithms and highlight the main developments beyond Metropolis‐style local updates: the development of cluster algorithms, their generalization to continuous time, the worm and directed‐loop algorithms and finally a generalization of the flat histogram method of Wang and Landau to quantum systems.
In this work we build the foundations of a quantum Monte Carlo as a stochastic numerical method to solve lattice many-body quantum systems with nearest-neighbor interactions at most. As motivation, we briefly describe the bilinear-biquadratic Heisenberg model with an external field, for spin-1 particles, as an effective Hamiltonian of the Bose-Hubbard model with an external quadratic Zeeman field in the Mott insulator phase at unit filling. Then, we discuss how to implement the world line Monte Carlo with local updates to circumvent the difficulties that arise on these type of systems by mapping the quantum partition function into the one of an effective classical model, in one additional dimension, given by the imaginary time evolution of the system. Such a mapping is performed by means of the Suzuki-Trotter decomposition, which transforms the original partition function into a summation of weights given by the classical configurations. Later, we present a set of observables that can be measured through this method and show how to use a Metropolis update scheme to accomplish the measurements. At last, we present the maximization of the configuration weights for three parameter sets as the first and relevant step to perform future measurements.
Efficient schemes called directed loops for cluster updates in Quantum Monte Carlo simulations have recently been proposed, which improve both the efficiency and precision for simulations of quantum models. In this work we show that local detailed balance is not necessary in order to fulfill global detailed balance during the construction of these loops. We therefore propose to insert additional degrees of freedom into the directed loop equations, resulting in even more efficient algorithms. Our approach works directly in the natural representation of an extended space where the matrix elements of the operators defining the worm (broken worldline segments) are taken into account.
Efficient quantum Monte Carlo update schemes called directed loops have recently been proposed, which improve the efficiency of simulations of quantum lattice models. We propose to generalize the detailed balance equations at the local level during the loop construction by accounting for the matrix elements of the operators associated with open world-line segments. Using linear programming techniques to solve the generalized equations, we look for optimal construction schemes for directed loops. This also allows for an extension of the directed loop scheme to general lattice models, such as high-spin or bosonic models. The resulting algorithms are bounce free in larger regions of parameter space than the original directed loop algorithm. The generalized directed loop method is applied to the magnetization process of spin chains in order to compare its efficiency to that of previous directed loop schemes. In contrast to general expectations, we find that minimizing bounces alone does not always lead to more efficient algorithms in terms of autocorrelations of physical observables, because of the nonuniqueness of the bounce-free solutions. We therefore propose different general strategies to further minimize autocorrelations, which can be used as supplementary requirements in any directed loop scheme. We show by calculating autocorrelation times for different observables that such strategies indeed lead to improved efficiency; however, we find that the optimal strategy depends not only on the model parameters but also on the observable of interest.