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/0506020 · Journal of Low Temperature Physics

Permutation Sampling in Path Integral Monte Carlo

Massimo Boninsegni

Published Sep 13, 2005• 58 citations
arXivHTMLPDF
DOI
10.1007/s10909-005-7513-0

Related papers

Path integral Monte Carlo on a lattice

Mark O'Callaghan

•Jan 1, 2016•0 citations

Learning the Fermion sign structure in path-integral Monte Carlo

Jarvist Moore Frost

Starting from a \emph{probabilistic numerics} approach to the Fermion sign problem in path integral Monte Carlo, we recast the arithmetic calculation of a Fermionic observable as a statistical inference problem. We develop approaches that learn the behaviour of Fermion exchange cycles binned by the conjugacy class of the permutation group (which we term `permutation family'). This extends the work of DuBois, Brown and Alder\cite{dubois2017overcoming} to inhomogeneous and more complex systems. Monte Carlo samples are used to train models for both the probability of a permutation family and the energy of this set of exchange permutations. The overall Fermionic energy is then directly inferred from these models, without using a direct ratio estimator on the Monte Carlo samples. By imposing physical understanding as inductive priors, we produce accurate and useful fits that remain robust even in regimes with severe sign problems. We generalise the linear (ideal-gas style) models of DuBois et al. with Bayesian priors that enforce the intuitive models of Feynman\cite{Feynman1953A} at their asymptotic limits. These linear models serve as the baseline for a Long Short-Term Memory (LSTM) neural network, which is tasked with learning only the residual many-body \emph{correlations} on top of the physical model. We develop active important sampling methods driven by these models, which direct the Monte Carlo chains toward undersampled permutation regions, to efficiently reduce the variance in the observable. We apply this framework to small experiments on benchmark systems: the spin-polarised uniform electron gas, and electrons in a 2D harmonic confining potential. In both cases we demonstrate that this inference-based framework can extract stable energies in regimes where direct Monte Carlo sampling fails due to the sign problem.

arXiv:2607.15060•Jul 16, 2026•0 citations

Metropolis Methods for Quantum Monte Carlo Simulations

David M. Ceperley

Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many‐body systems. This paper will consider some of the generalizations of the Metropolis algorithm employed in quantum Monte Carlo: Variational Monte Carlo, dynamical methods for projector monte carlo (i.e. diffusion Monte Carlo with rejection), multilevel sampling in path integral Monte Carlo, the sampling of permutations, cluster methods for lattice models, the penalty method for coupled electron‐ionic systems and the Bayesian analysis of imaginary time correlation functions.

arXiv:physics/0306182•AIP conference proceedings•Jan 1, 2003•23 citations

Path Integral Monte Carlo

Riccardo Fantoni

Springer eBooks•Jan 1, 2025•0 citations

Simple proof that there is no sign problem in path integral Monte Carlo simulations of fermions in one dimension

Siu A. Chin

It is widely known that there is no sign problem in path integral Monte Carlo (PIMC) simulations of fermions in one dimension. As far as the author is aware, there is no direct proof of this in the literature. This work shows that the sign of the N-fermion antisymmetric free propagator is given by the product of all possible pairs of particle separations, or relative displacements. For a nonvanishing closed-loop product of such propagators, as required by PIMC, all relative displacements from adjacent propagators are paired into perfect squares, and therefore the loop product must be positive, but only in one dimension. By comparison, permutation sampling, which does not evaluate the determinant of the antisymmetric propagator exactly, remains plagued by a low-level sign problem, even in one dimension.

arXiv:2407.01618•Physical review. E•Jun 25, 2024•3 citations

Introduction to Configuration Path Integral Monte Carlo

Tim Schoof, Simon Groth, M. Bönitz

arXiv:1408.2011•Springer series on atomic, optical, and plasma physics•Jan 1, 2014•3 citations
Starting from a \emph{probabilistic numerics} approach to the Fermion sign problem in path integral Monte Carlo, we recast the arithmetic calculation of a Fermionic observable as a statistical inference problem. We develop approaches that learn the behaviour of Fermion exchange cycles binned by the conjugacy class of the permutation group (which we term `permutation family'). This extends the work of DuBois, Brown and Alder\cite{dubois2017overcoming} to inhomogeneous and more complex systems. Monte Carlo samples are used to train models for both the probability of a permutation family and the energy of this set of exchange permutations. The overall Fermionic energy is then directly inferred from these models, without using a direct ratio estimator on the Monte Carlo samples. By imposing physical understanding as inductive priors, we produce accurate and useful fits that remain robust even in regimes with severe sign problems. We generalise the linear (ideal-gas style) models of DuBois et al. with Bayesian priors that enforce the intuitive models of Feynman\cite{Feynman1953A} at their asymptotic limits. These linear models serve as the baseline for a Long Short-Term Memory (LSTM) neural network, which is tasked with learning only the residual many-body \emph{correlations} on top of the physical model. We develop active important sampling methods driven by these models, which direct the Monte Carlo chains toward undersampled permutation regions, to efficiently reduce the variance in the observable. We apply this framework to small experiments on benchmark systems: the spin-polarised uniform electron gas, and electrons in a 2D harmonic confining potential. In both cases we demonstrate that this inference-based framework can extract stable energies in regimes where direct Monte Carlo sampling fails due to the sign problem.
Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many‐body systems. This paper will consider some of the generalizations of the Metropolis algorithm employed in quantum Monte Carlo: Variational Monte Carlo, dynamical methods for projector monte carlo (i.e. diffusion Monte Carlo with rejection), multilevel sampling in path integral Monte Carlo, the sampling of permutations, cluster methods for lattice models, the penalty method for coupled electron‐ionic systems and the Bayesian analysis of imaginary time correlation functions.
It is widely known that there is no sign problem in path integral Monte Carlo (PIMC) simulations of fermions in one dimension. As far as the author is aware, there is no direct proof of this in the literature. This work shows that the sign of the N-fermion antisymmetric free propagator is given by the product of all possible pairs of particle separations, or relative displacements. For a nonvanishing closed-loop product of such propagators, as required by PIMC, all relative displacements from adjacent propagators are paired into perfect squares, and therefore the loop product must be positive, but only in one dimension. By comparison, permutation sampling, which does not evaluate the determinant of the antisymmetric propagator exactly, remains plagued by a low-level sign problem, even in one dimension.