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

Random Walk Beyond Hartree-Fock

James E. Gubernatis, M. Guerrero

Published Jan 1, 2000• 0 citations
OpenAlex

Abstract

We give a brief discussion of the recently developed Constrained-Path Monte Carlo Method. This method is a quantum Monte Carlo technique that eliminates the fermion sign problem plaguing simulations of systems of interacting electrons. The elimination is accomplished by trading an exact procedure for an approximate one that has been demonstrated to give very accurate estimates of energies and manybody correlation functions. We also give a short review of its applications, a discussion of several strategies for parallelizing it, and some speculation of its future extensions. 1

Related papers

Constrained path Monte Carlo method for fermion ground states

Shiwei Zhang, Joseph Carlson, James E. Gubernatis

We describe and discuss a recently proposed quantum Monte Carlo algorithm to compute the ground-state properties of various systems of interacting fermions. In this method, the ground state is projected from an initial wave function by a branching random walk in an overcomplete basis of Slater determinants. By constraining the determinants according to a trial wave function |${\mathrm{\ensuremath{\psi}}}_{\mathrm{T}}$〉, we remove the exponential decay of signal-to-noise ratio characteristic of the sign problem. The method is variational and is exact if |${\mathrm{\ensuremath{\psi}}}_{\mathrm{T}}$〉 is exact. We illustrate the method by describing in detail its implementation for the two-dimensional one-band Hubbard model. We show results for lattice sizes up to 16\ifmmode\times\else\texttimes\fi{}16 and for various electron fillings and interaction strengths. With simple single-determinant wave functions as |${\mathrm{\ensuremath{\psi}}}_{\mathrm{T}}$〉, the method yields accurate (often to within a few percent) estimates of the ground-state energy as well as correlation functions, such as those for electron pairing. We conclude by discussing possible extensions of the algorithm.

arXiv:cond-mat/9607062•Physical review. B, Condensed matter•Mar 15, 1997•388 citations

Fermion ground state methods

James E. Gubernatis, Naoki Kawashima, Philipp Werner

In this chapter, we discuss the fixed-node and constrained-path Monte Carlo methods for computing the ground state properties of systems of interacting electrons. These methods are arguably the two most powerful ones presently available for doing such calculations, but they are approximate. By sacrificing exactness, they avoid the exponential scaling of the Monte Carlo errors with system size that typically accompanies the simulation of systems of interacting electrons. This exponential scaling is called the Fermion sign problem . After a few general comments about the sign problem, we outline both methods, noting points of similarity and difference, plus points of strength and weakness. We also discuss the constrained-phase method, an extension of the constrained-path method, which controls the phase problem that develops when the ground state wave function cannot be real. Sign problem The “sign problem” refers to the exponential increase of the Monte Carlo errors with increasing system size or decreasing temperature (e.g., Loh et al., 1990, 2005; Gubernatis and Zhang, 1994) that often accompanies a Markov chain simulation whose limiting distribution is not everywhere positive. Such a case generally arises in simulations of Fermion and frustrated quantum-spin systems. It seems so inherent to Monte Carlo simulations of Fermion systems that the phrase “the sign problem” to many seems almost synonymous with the phrase “the Fermion sign problem.” Explanations for the cause of the sign problem vary and are still debated. In this chapter, we choose to summarize two explanations that seem to connect the causes in ground state Fermion simulations in the continuum and on the lattice. The sign problem, of course, is not limited to ground state calculations or even to Fermion simulations. While the cause we discuss in Sections 11.2 and 11.3 focuses on the low-lying states of diffusion-like operators, several topological pictures have been proposed (Muramatsu et al., 1992; Samson, 1993; Gubernatis and Zhang, 1994; Samson, 1995). Some of these discussions are done in the context of the zero- and finite-temperature determinant methods (Muramatsu et al., 1992; Gubernatis and Zhang, 1994). Others are done more analytically from a Feynman path-integral point of view (Samson, 1993, 1995). Some are for particles with statistics other than Fermions. The presentation of the sign problem in this chapter is appropriate for the Monte Carlo methods discussed in this chapter.

Cambridge University Press eBooks•Jan 31, 2016•0 citations

Path Integral Monte Carlo Methods for Fermions

Ethan Brown

In general, Quantum Monte Carlo methods suffer from a sign problem when simulating fermionic systems. This causes the efficiency of a simulation to decrease exponentially with the number of particles and inverse temperature. To circumvent this issue, a nodal constraint is often implemented, restricting the Monte Carlo procedure from sampling paths that cause the many-body density matrix to change sign. Unfortunately, this high-dimensional nodal surface is not a priori known unless the system is exactly solvable, resulting in uncontrolled errors. We will discuss two possible routes to extend the applicability of finite-temperatue path integral Monte Carlo. First we extend the regime where signful simulations are possible through a novel permutation sampling scheme. Afterwards, we discuss a method to variationally improve the nodal surface by minimizing a free energy during simulation. Applications of these methods will include both free and interacting electron gases, concluding with discussion concerning extension to inhomogeneous systems.

•Jan 1, 2014•0 citations

Constrained Path Quantum Monte Carlo Method for Fermion Ground States

Shiwei Zhang, Joseph Carlson, James E. Gubernatis

We propose a new quantum Monte Carlo algorithm to compute fermion ground-state properties. The ground state is projected from an initial wave function by a branching random walk in an over-complete basis space of Slater determinants. By constraining the determinants according to a trial wave function $|{\ensuremath{\Psi}}_{T}〉$, we remove the exponential decay of signal-to-noise ratio characteristic of the sign problem. The method is variational and is exact if $|{\ensuremath{\Psi}}_{T}〉$ is exact. We report results on the two-dimensional Hubbard model up to size $16\ifmmode\times\else\texttimes\fi{}16$, for various electron fillings and interaction strengths.

arXiv:cond-mat/9503055•Physical Review Letters•May 1, 1995•226 citations

Issues and observations on applications of the constrained-path Monte Carlo method to many-fermion systems

Joseph Carlson, James E. Gubernatis, Gerardo Ortíz +1 more

We report several important observations that underscore the distinctions between the constrained-path Monte Carlo method and the continuum and lattice versions of the fixed-node method. The main distinctions stem from the differences in the state space in which the random walk occurs and in the manner in which the random walkers are constrained. One consequence is that in the constrained-path method the so-called mixed estimator for the energy is not an upper bound to the exact energy, as previously claimed. Several ways of producing an energy upper bound are given, and relevant methodological aspects are illustrated with simple examples.

arXiv:cond-mat/9901029•Physical review. B, Condensed matter•May 15, 1999•61 citations

Quantum Monte Carlo simulations of interacting electrons

Ryszard Olchawa

A brief introduction to the Monte Carlo methods and the most common types of Quantum Monte Carlo, Variational Monte Carlo and Diffusion Monte Carlo are presented. The fermion sign problem in Diffusion Monte Carlo is outlined and a way of bypassing the fixed-node approximation is discussed.

Journal of Physics Conference Series•Feb 28, 2006•1 citation
We give a brief discussion of the recently developed Constrained-Path Monte Carlo Method. This method is a quantum Monte Carlo technique that eliminates the fermion sign problem plaguing simulations of systems of interacting electrons. The elimination is accomplished by trading an exact procedure for an approximate one that has been demonstrated to give very accurate estimates of energies and manybody correlation functions. We also give a short review of its applications, a discussion of several strategies for parallelizing it, and some speculation of its future extensions. 1
We describe and discuss a recently proposed quantum Monte Carlo algorithm to compute the ground-state properties of various systems of interacting fermions. In this method, the ground state is projected from an initial wave function by a branching random walk in an overcomplete basis of Slater determinants. By constraining the determinants according to a trial wave function |${\mathrm{\ensuremath{\psi}}}_{\mathrm{T}}$〉, we remove the exponential decay of signal-to-noise ratio characteristic of the sign problem. The method is variational and is exact if |${\mathrm{\ensuremath{\psi}}}_{\mathrm{T}}$〉 is exact. We illustrate the method by describing in detail its implementation for the two-dimensional one-band Hubbard model. We show results for lattice sizes up to 16\ifmmode\times\else\texttimes\fi{}16 and for various electron fillings and interaction strengths. With simple single-determinant wave functions as |${\mathrm{\ensuremath{\psi}}}_{\mathrm{T}}$〉, the method yields accurate (often to within a few percent) estimates of the ground-state energy as well as correlation functions, such as those for electron pairing. We conclude by discussing possible extensions of the algorithm.
In this chapter, we discuss the fixed-node and constrained-path Monte Carlo methods for computing the ground state properties of systems of interacting electrons. These methods are arguably the two most powerful ones presently available for doing such calculations, but they are approximate. By sacrificing exactness, they avoid the exponential scaling of the Monte Carlo errors with system size that typically accompanies the simulation of systems of interacting electrons. This exponential scaling is called the Fermion sign problem . After a few general comments about the sign problem, we outline both methods, noting points of similarity and difference, plus points of strength and weakness. We also discuss the constrained-phase method, an extension of the constrained-path method, which controls the phase problem that develops when the ground state wave function cannot be real. Sign problem The “sign problem” refers to the exponential increase of the Monte Carlo errors with increasing system size or decreasing temperature (e.g., Loh et al., 1990, 2005; Gubernatis and Zhang, 1994) that often accompanies a Markov chain simulation whose limiting distribution is not everywhere positive. Such a case generally arises in simulations of Fermion and frustrated quantum-spin systems. It seems so inherent to Monte Carlo simulations of Fermion systems that the phrase “the sign problem” to many seems almost synonymous with the phrase “the Fermion sign problem.” Explanations for the cause of the sign problem vary and are still debated. In this chapter, we choose to summarize two explanations that seem to connect the causes in ground state Fermion simulations in the continuum and on the lattice. The sign problem, of course, is not limited to ground state calculations or even to Fermion simulations. While the cause we discuss in Sections 11.2 and 11.3 focuses on the low-lying states of diffusion-like operators, several topological pictures have been proposed (Muramatsu et al., 1992; Samson, 1993; Gubernatis and Zhang, 1994; Samson, 1995). Some of these discussions are done in the context of the zero- and finite-temperature determinant methods (Muramatsu et al., 1992; Gubernatis and Zhang, 1994). Others are done more analytically from a Feynman path-integral point of view (Samson, 1993, 1995). Some are for particles with statistics other than Fermions. The presentation of the sign problem in this chapter is appropriate for the Monte Carlo methods discussed in this chapter.
In general, Quantum Monte Carlo methods suffer from a sign problem when simulating fermionic systems. This causes the efficiency of a simulation to decrease exponentially with the number of particles and inverse temperature. To circumvent this issue, a nodal constraint is often implemented, restricting the Monte Carlo procedure from sampling paths that cause the many-body density matrix to change sign. Unfortunately, this high-dimensional nodal surface is not a priori known unless the system is exactly solvable, resulting in uncontrolled errors. We will discuss two possible routes to extend the applicability of finite-temperatue path integral Monte Carlo. First we extend the regime where signful simulations are possible through a novel permutation sampling scheme. Afterwards, we discuss a method to variationally improve the nodal surface by minimizing a free energy during simulation. Applications of these methods will include both free and interacting electron gases, concluding with discussion concerning extension to inhomogeneous systems.
We propose a new quantum Monte Carlo algorithm to compute fermion ground-state properties. The ground state is projected from an initial wave function by a branching random walk in an over-complete basis space of Slater determinants. By constraining the determinants according to a trial wave function $|{\ensuremath{\Psi}}_{T}〉$, we remove the exponential decay of signal-to-noise ratio characteristic of the sign problem. The method is variational and is exact if $|{\ensuremath{\Psi}}_{T}〉$ is exact. We report results on the two-dimensional Hubbard model up to size $16\ifmmode\times\else\texttimes\fi{}16$, for various electron fillings and interaction strengths.
We report several important observations that underscore the distinctions between the constrained-path Monte Carlo method and the continuum and lattice versions of the fixed-node method. The main distinctions stem from the differences in the state space in which the random walk occurs and in the manner in which the random walkers are constrained. One consequence is that in the constrained-path method the so-called mixed estimator for the energy is not an upper bound to the exact energy, as previously claimed. Several ways of producing an energy upper bound are given, and relevant methodological aspects are illustrated with simple examples.