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

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

Time step bias improvement in diffusion Monte Carlo simulations

Massimo Mella, Gabriele Morosi, Dario Bressanini

Published Feb 1, 2000• 21 citations
Publisher

Abstract

A Makri-Miller approximation to the exact propagator and the improved split-operator propagator proposed by Drozdov are implemented within the diffusion Monte Carlo method for the simulation of boson systems, and confronted with the Trotter formula and with the importance sampling technique. As a preliminary approach, we compute analytically the time step bias of the mean energy for the different propagators in the simple case of the harmonic oscillator. These results indicate the improved split-operator propagator as the most accurate. Simulations on one- and three-dimensional model systems confirm the analytical results showing that this propagator is very efficient in reducing the time step bias, therefore improving the efficiency of the algorithm.

DOI
10.1103/physreve.61.2050

Related papers

Quantum Monte Carlo simulations of many- dimensional harmonic oscillators: A study of 2 nd and 4 th order propagators

Brent-Jon Bjorgvin Magnusson

Because the Schrodinger equation cannot be solved analytically for systems larger than hydrogen, approximate solution methods must be applied to study systems of chemical interest. Quantum Monte Carlo is one of these methods. Quantum Monte Carlo simulations involve the diffusion of walkers through configuration space and necessitate the use of one of two imaginary time propagators, 2nd or 4th order. The choice of the propagator implemented depends on a balance between accuracy and efficiency. Obtaining accurate solutions is the primary objective; once this is accomplished, finding ways to make the simulations efficient is the next intention. Using a model system of a multidimensional harmonic oscillator, this study intends to compare and contrast both 2nd and 4th order propagators' diminished accuracy as the dimensionality of the system is increased. Two phases of the propagation are sampled to determine accuracy: a single propagation step and the asymptotic limit. To test the accuracy after one step, we start a simulation by placing walkers at the origin, moving them forward one time step in imaginary time, creating normalized histograms of their positions and comparing these with the known result for the imaginary time propagation of the delta function centered at x=0. The convergence of the simulation is determined by observing the change in distribution from the known asymptotic limit distribution. This is done by distributing the walkers in the known asymptotic distribution and observing the change in average weight upon further propagation. A converged distribution’s average weight will not change.

•Jan 1, 2008•0 citations

Improved Feynman’s path integral method with a large time step: Formalism and applications

Alexander N. Drozdov

We describe an efficient path integral scheme for calculating the propagator of an arbitrary quantum system, as well as that of a stochastic system in special cases where the Fokker–Planck equation obeys strict detailed balance. The basic idea is to split the respective Hamiltonian into two exactly solvable parts and then to employ a symmetric decomposition of the time evolution operator, which is exact up to a high order in the time step. The resulting single step propagator allows rather large time steps in a path integral and leads to convergence with fewer time slices. Because it involves no system-specific reference system, the algorithm is amenable to all known numerical schemes available for evaluating quantum path integrals. In this way one obtains a highly accurate method, which is simultaneously fast, stable, and computationally simple. Numerical applications to the real time quantum dynamics in a double well and to the stochastic dynamics of a bistable system coupled to a harmonic mode show our method to be superior over the approach developed by the Makri group in their quasiadiabatic propagator representation, to say nothing about the propagation scheme based on the standard Trotter splitting.

The Journal of Chemical Physics•Apr 22, 1998•15 citations

Development of a pure diffusion quantum Monte Carlo method using a full generalized Feynman-Kac formula. I and II

Michel Caffarel, P. Claverie

Abstract These two papers describe the development of a variant of diffusion QMC with importance sampling and its applications to a few simple systems. The method is based on the generalized FeynmanKac path integral formalisma and is termed the “full generalized Feynman-Kac” or FGFK method. Its major advantage, relative to other diffusion-based methods, is the elimination of branching or multiplication of walkers. Its major disadvantage is a greater complexity. The basic implementation is very nearly the same as that of standard diffusion QMC with importance sampling, and it incorporates diffusion with drift in the same way. The uses of trial functions, fixed nodes, extrapolation to zero time-step size, and other procedures except for branching are identical. However, the evaluation of mean quantities can be carried out in terms of ‘lj;2 sampling to obtain energies and other properties based on the FGFK formula. The applications described include ground and excited states of the harmonic oscillator and the helium atom and the ground state of the hydrogen molecule. For these the energies as well as a dozen other observables such as the averages of interelectron distances were determined. The results were found to be in good agreement with accepted values. A combination of FGFK with the released-node method was investigated for the case of the one-dimensional harmonic oscillator and found to be successful for that case.

Oxford University Press eBooks•Jun 18, 2007•0 citations

Extrapolation of the time‐step bias in diffusion quantum Monte Carlo by a differential sampling technique

David R. Garmer

Abstract A new method of eliminating the finite‐time‐step error inherent in diffusion quantum Monte Carlo is presented, utilizing an improved version of the existing differential techniques. An implementation is described and results of several small but representative calculations are discussed. The pertinent computation requirements on these systems were reduced by up to a factor of five by the new algorithm. It is speculated that this method may be easily applied to other quantum Monte Carlo and discretized path integral Monte Carlo techniques having related finite step‐size errors with a possibility of obtaining similar good results.

Journal of Computational Chemistry•Mar 1, 1989•4 citations

Persistent Population Biases in Branching Random Walk Algorithms

David J. Geroski

We explore the existence of a residual population bias in Diffusion Monte Carlo algorithms. We develop a model problem, which mimics the single-particle, one dimensional simple harmonic oscillator of unitary ground state energy, to study these biases. We then apply an importance sampling algorithms with a population of a single random walker to calculate the ground state energy and wavefunction of our modeled system in cases of both perfect and imperfect importance sampling. In the former case, we perfectly calculate both the ground state energy and corresponding wavefunction of our system, thus validating our calculations and assumed answer. In the latter case, we show the existence of a residual population bias for populations of small numbers of random walkers. We demonstrate the convergence of our small population calculations and show that we cannot remove this bias through a number of single walker methods. Finally, we demonstrate the overall decay of this residual population bias as the population of random walkers expands, allowing our calculations to converge to the true answer. Key Words: Diffusion Monte Carlo, Population Dynamics, Random Walk

•Jan 1, 2015•0 citations

Grid-based diffusion Monte Carlo for fermions without the fixed-node approximation

Alexander A. Kunitsa, So Hirata

A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. The method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015E_{h} of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10^{-5}E_{h} without an importance sampling or Jastrow factor.

arXiv:1811.03000•Physical review. E•Jan 27, 2020•12 citations
A Makri-Miller approximation to the exact propagator and the improved split-operator propagator proposed by Drozdov are implemented within the diffusion Monte Carlo method for the simulation of boson systems, and confronted with the Trotter formula and with the importance sampling technique. As a preliminary approach, we compute analytically the time step bias of the mean energy for the different propagators in the simple case of the harmonic oscillator. These results indicate the improved split-operator propagator as the most accurate. Simulations on one- and three-dimensional model systems confirm the analytical results showing that this propagator is very efficient in reducing the time step bias, therefore improving the efficiency of the algorithm.
Because the Schrodinger equation cannot be solved analytically for systems larger than hydrogen, approximate solution methods must be applied to study systems of chemical interest. Quantum Monte Carlo is one of these methods. Quantum Monte Carlo simulations involve the diffusion of walkers through configuration space and necessitate the use of one of two imaginary time propagators, 2nd or 4th order. The choice of the propagator implemented depends on a balance between accuracy and efficiency. Obtaining accurate solutions is the primary objective; once this is accomplished, finding ways to make the simulations efficient is the next intention. Using a model system of a multidimensional harmonic oscillator, this study intends to compare and contrast both 2nd and 4th order propagators' diminished accuracy as the dimensionality of the system is increased. Two phases of the propagation are sampled to determine accuracy: a single propagation step and the asymptotic limit. To test the accuracy after one step, we start a simulation by placing walkers at the origin, moving them forward one time step in imaginary time, creating normalized histograms of their positions and comparing these with the known result for the imaginary time propagation of the delta function centered at x=0. The convergence of the simulation is determined by observing the change in distribution from the known asymptotic limit distribution. This is done by distributing the walkers in the known asymptotic distribution and observing the change in average weight upon further propagation. A converged distribution’s average weight will not change.
We describe an efficient path integral scheme for calculating the propagator of an arbitrary quantum system, as well as that of a stochastic system in special cases where the Fokker–Planck equation obeys strict detailed balance. The basic idea is to split the respective Hamiltonian into two exactly solvable parts and then to employ a symmetric decomposition of the time evolution operator, which is exact up to a high order in the time step. The resulting single step propagator allows rather large time steps in a path integral and leads to convergence with fewer time slices. Because it involves no system-specific reference system, the algorithm is amenable to all known numerical schemes available for evaluating quantum path integrals. In this way one obtains a highly accurate method, which is simultaneously fast, stable, and computationally simple. Numerical applications to the real time quantum dynamics in a double well and to the stochastic dynamics of a bistable system coupled to a harmonic mode show our method to be superior over the approach developed by the Makri group in their quasiadiabatic propagator representation, to say nothing about the propagation scheme based on the standard Trotter splitting.
Abstract These two papers describe the development of a variant of diffusion QMC with importance sampling and its applications to a few simple systems. The method is based on the generalized FeynmanKac path integral formalisma and is termed the “full generalized Feynman-Kac” or FGFK method. Its major advantage, relative to other diffusion-based methods, is the elimination of branching or multiplication of walkers. Its major disadvantage is a greater complexity. The basic implementation is very nearly the same as that of standard diffusion QMC with importance sampling, and it incorporates diffusion with drift in the same way. The uses of trial functions, fixed nodes, extrapolation to zero time-step size, and other procedures except for branching are identical. However, the evaluation of mean quantities can be carried out in terms of ‘lj;2 sampling to obtain energies and other properties based on the FGFK formula. The applications described include ground and excited states of the harmonic oscillator and the helium atom and the ground state of the hydrogen molecule. For these the energies as well as a dozen other observables such as the averages of interelectron distances were determined. The results were found to be in good agreement with accepted values. A combination of FGFK with the released-node method was investigated for the case of the one-dimensional harmonic oscillator and found to be successful for that case.
Abstract A new method of eliminating the finite‐time‐step error inherent in diffusion quantum Monte Carlo is presented, utilizing an improved version of the existing differential techniques. An implementation is described and results of several small but representative calculations are discussed. The pertinent computation requirements on these systems were reduced by up to a factor of five by the new algorithm. It is speculated that this method may be easily applied to other quantum Monte Carlo and discretized path integral Monte Carlo techniques having related finite step‐size errors with a possibility of obtaining similar good results.
We explore the existence of a residual population bias in Diffusion Monte Carlo algorithms. We develop a model problem, which mimics the single-particle, one dimensional simple harmonic oscillator of unitary ground state energy, to study these biases. We then apply an importance sampling algorithms with a population of a single random walker to calculate the ground state energy and wavefunction of our modeled system in cases of both perfect and imperfect importance sampling. In the former case, we perfectly calculate both the ground state energy and corresponding wavefunction of our system, thus validating our calculations and assumed answer. In the latter case, we show the existence of a residual population bias for populations of small numbers of random walkers. We demonstrate the convergence of our small population calculations and show that we cannot remove this bias through a number of single walker methods. Finally, we demonstrate the overall decay of this residual population bias as the population of random walkers expands, allowing our calculations to converge to the true answer. Key Words: Diffusion Monte Carlo, Population Dynamics, Random Walk
A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. The method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015E_{h} of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10^{-5}E_{h} without an importance sampling or Jastrow factor.