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

Recent Progress in Many-Body Theories

Fermion Monte Carlo Algorithms for Quantum Fluids

Robert M. Panoff

Published Jan 1, 1990• 1 citation
Publisher
DOI
10.1007/978-1-4615-3798-4_19

Related papers

Continuous-Time Quantum Monte Carlo Algorithms for Fermions

Emanuel Gull

•Jan 1, 2008•22 citations

Monte-Carlo algorithm for non-relativistic many-fermion systems

B. L. G. Bakker, M. I. Polikarpov, Alexander I. Veselov

Nuclear Physics B - Proceedings Supplements•Mar 1, 1993•0 citations

Static Response of Homogeneous Quantum Fluids by Diffusion Monte Carlo

Gaetano Senatore, Saverio Moroni, David M. Ceperley

Springer eBooks•Jan 1, 1999•3 citations

Quantum-Monte-Carlo simulations for fermionic systems

I. Morgenstern

The European Physical Journal B•Jun 1, 1989•14 citations

Fermion Monte Carlo

Francesco Pederiva, Malvin H. Kalos

We review the fundamental challenge of fermion Monte Carlo for continuous systems, the “sign problem”. We seek that eigenfunction of the many-body Schrödinger equation that is antisymmetric under interchange of the coordinates of pairs of particles. We describe methods that depend upon the use of correlated dynamics for pairs of correlated walkers that carry opposite signs. There is an algorithmic symmetry between such walkers that must be broken to create a method that is both exact and as effective as for symmetric functions. In our new method, it is broken by using different “guiding” functions for walkers of opposite signs, and a geometric correlation between steps of their walks. With a specific process of cancellation of the walkers, overlaps with antisymmetric test functions are preserved. Finally, we describe the progress in treating free-fermion systems and a fermion fluid with 14 3He atoms.

Computer Physics Communications•Sep 1, 1999•0 citations

The fermion Monte Carlo revisited

Roland Assaraf, Michel Caffarel, Anatole Khélif

In this work we present a detailed study of the fermion Monte Carlo algorithm (FMC), a recently proposed stochastic method for calculating fermionic ground-state energies. A proof that the FMC method is an exact method is given. In this work the stability of the method is related to the difference between the lowest (bosonic-type) eigenvalue of the FMC diffusion operator and the exact Fermi energy. It is shown that within a FMC framework the lowest eigenvalue of the new diffusion operator is no longer the bosonic ground-state eigenvalue as in standard exact diffusion Monte Carlo (DMC) schemes but a modified value which is strictly greater. Accordingly, FMC can be viewed as an exact DMC method built from a correlated diffusion process having a reduced Bose–Fermi gap. As a consequence, the FMC method is more stable than any transient method (or nodal release-type approaches). It is shown that the most recent ingredient of the FMC approach (Kalos M H and Pederiva F 2000 Phys. Rev. Lett. 85 3547), namely the introduction of non-symmetric guiding functions, does not necessarily improve the stability of the algorithm. We argue that the stability observed with such guiding functions is in general a finite-size population effect disappearing for a very large population of walkers. The counterpart of this stability is a control population error which is different in nature from the standard diffusion Monte Carlo algorithm and which is at the origin of an uncontrolled approximation in FMC. We illustrate the various ideas presented in this work with calculations performed on a very simple model having only nine states but a full ‘sign problem’. Already for this toy model it is clearly seen that FMC calculations are inherently uncontrolled.

arXiv:cond-mat/0611264•Journal of Physics A Mathematical and Theoretical•Jan 23, 2007•19 citations
We review the fundamental challenge of fermion Monte Carlo for continuous systems, the “sign problem”. We seek that eigenfunction of the many-body Schrödinger equation that is antisymmetric under interchange of the coordinates of pairs of particles. We describe methods that depend upon the use of correlated dynamics for pairs of correlated walkers that carry opposite signs. There is an algorithmic symmetry between such walkers that must be broken to create a method that is both exact and as effective as for symmetric functions. In our new method, it is broken by using different “guiding” functions for walkers of opposite signs, and a geometric correlation between steps of their walks. With a specific process of cancellation of the walkers, overlaps with antisymmetric test functions are preserved. Finally, we describe the progress in treating free-fermion systems and a fermion fluid with 14 3He atoms.
In this work we present a detailed study of the fermion Monte Carlo algorithm (FMC), a recently proposed stochastic method for calculating fermionic ground-state energies. A proof that the FMC method is an exact method is given. In this work the stability of the method is related to the difference between the lowest (bosonic-type) eigenvalue of the FMC diffusion operator and the exact Fermi energy. It is shown that within a FMC framework the lowest eigenvalue of the new diffusion operator is no longer the bosonic ground-state eigenvalue as in standard exact diffusion Monte Carlo (DMC) schemes but a modified value which is strictly greater. Accordingly, FMC can be viewed as an exact DMC method built from a correlated diffusion process having a reduced Bose–Fermi gap. As a consequence, the FMC method is more stable than any transient method (or nodal release-type approaches). It is shown that the most recent ingredient of the FMC approach (Kalos M H and Pederiva F 2000 Phys. Rev. Lett. 85 3547), namely the introduction of non-symmetric guiding functions, does not necessarily improve the stability of the algorithm. We argue that the stability observed with such guiding functions is in general a finite-size population effect disappearing for a very large population of walkers. The counterpart of this stability is a control population error which is different in nature from the standard diffusion Monte Carlo algorithm and which is at the origin of an uncontrolled approximation in FMC. We illustrate the various ideas presented in this work with calculations performed on a very simple model having only nine states but a full ‘sign problem’. Already for this toy model it is clearly seen that FMC calculations are inherently uncontrolled.