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

Physics Letters A

“Worm” algorithm in quantum Monte Carlo simulations

Nikolay V. Prokof'ev, Boris V. Svistunov, I. S. Tupitsyn

Published Feb 1, 1998• 273 citations
Publisher
DOI
10.1016/s0375-9601(97)00957-2

Related papers

Parallelized Multi-Worm Algorithm for Large Scale Quantum Monte-Carlo simulations

Takafumi J. Suzuki, Akiko Masaki-Kato, Kenji Harada +2 more

Bulletin of the American Physical Society•Mar 3, 2014•0 citations

Valence-bond quantum Monte Carlo algorithms defined on trees

Andreas Deschner, Erik Schwartz Sørensen

We present a class of algorithms for performing valence-bond quantum Monte Carlo of quantum spin models. Valence-bond quantum Monte Carlo is a projective T=0 Monte Carlo method based on sampling of a set of operator strings that can be viewed as forming a treelike structure. The algorithms presented here utilize the notion of a worm that moves up and down this tree and changes the associated operator string. In quite general terms, we derive a set of equations whose solutions correspond to a whole class of algorithms. As specific examples of this class of algorithms, we focus on two cases. The bouncing worm algorithm, for which updates are always accepted by allowing the worm to bounce up and down the tree, and the driven worm algorithm, where a single parameter controls how far up the tree the worm reaches before turning around. The latter algorithm involves only a single bounce where the worm turns from going up the tree to going down. The presence of the control parameter necessitates the introduction of an acceptance probability for the update.

arXiv:1401.7592•Physical Review E•Sep 10, 2014•0 citations

Quantum Monte Carlo Simulations

Matthias Troyer, Philipp Werner, Adolfo Avella +1 more

AIP conference proceedings•Jan 1, 2009•14 citations

Quantum Monte Carlo simulations

Hyeonseong Jung, Shiho Kim

Advances in computers•Aug 18, 2025•0 citations

Quantum Monte Carlo Simulations: An Introduction

Kurt Binder, Dieter W. Heermann

Graduate texts in physics•Jan 1, 2010•2 citations

Worm Algorithm for Continuous-Space Path Integral Monte Carlo Simulations

Massimo Boninsegni, Nikolay V. Prokof'ev, Boris V. Svistunov

We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient computation of thermodynamic properties, including winding numbers and off-diagonal correlations, for systems of much greater size than that accessible to conventional PIMC simulations. As an illustrative application of the method, we simulate the superfluid transition of 4He in two dimensions.

arXiv:cond-mat/0510214•Physical Review Letters•Feb 23, 2006•405 citations
We present a class of algorithms for performing valence-bond quantum Monte Carlo of quantum spin models. Valence-bond quantum Monte Carlo is a projective T=0 Monte Carlo method based on sampling of a set of operator strings that can be viewed as forming a treelike structure. The algorithms presented here utilize the notion of a worm that moves up and down this tree and changes the associated operator string. In quite general terms, we derive a set of equations whose solutions correspond to a whole class of algorithms. As specific examples of this class of algorithms, we focus on two cases. The bouncing worm algorithm, for which updates are always accepted by allowing the worm to bounce up and down the tree, and the driven worm algorithm, where a single parameter controls how far up the tree the worm reaches before turning around. The latter algorithm involves only a single bounce where the worm turns from going up the tree to going down. The presence of the control parameter necessitates the introduction of an acceptance probability for the update.
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient computation of thermodynamic properties, including winding numbers and off-diagonal correlations, for systems of much greater size than that accessible to conventional PIMC simulations. As an illustrative application of the method, we simulate the superfluid transition of 4He in two dimensions.