The standard method of quantum Monte Carlo for the solution of the Schrödinger equation in configuration space can be described quite generally as devising a random walk that generates-at least asymptotically-populations of random walkers whose probability density is proportional to the wave function of the system being studied. While, in principle, the energy eigenvalue of the Hamiltonian can be calculated with high accuracy, estimators of operators that do not commute the Hamiltonian cannot. Bilinear quantum Monte Carlo (BQMC) is an alternative in which the square of the wave function is sampled in a somewhat indirect way. More specifically, one uses a pair of walkers at positions x and y and introduces stochastic dynamics to sample phi(i)(x)t(x,y)phi(j)(y), where phi(i)(x) and phi(j)(y) are eigenfunctions of (possibly different) Hamiltonians, and t(x,y) is a kernel that correlates positions x and y. Using different Hamiltonians permits the accurate computation of small energy differences. We review the conceptual basis of BQMC, discuss qualitatively and analytically the problem of the fluctuations in the branching, and present partial solutions to that problem. Finally we exhibit numerical results for some model systems including harmonic oscillators and the hydrogen and helium atoms. Further research will be necessary to make this a practical and generally applicable scheme.
The standard method of quantum Monte Carlo for the solution of the Schrödinger equation in configuration space can be described quite generally as devising a random walk that generates-at least asymptotically-populations of random walkers whose probability density is proportional to the wave function of the system being studied. While, in principle, the energy eigenvalue of the Hamiltonian can be calculated with high accuracy, estimators of operators that do not commute the Hamiltonian cannot. Bilinear quantum Monte Carlo (BQMC) is an alternative in which the square of the wave function is sampled in a somewhat indirect way. More specifically, one uses a pair of walkers at positions x and y and introduces stochastic dynamics to sample phi(i)(x)t(x,y)phi(j)(y), where phi(i)(x) and phi(j)(y) are eigenfunctions of (possibly different) Hamiltonians, and t(x,y) is a kernel that correlates positions x and y. Using different Hamiltonians permits the accurate computation of small energy differences. We review the conceptual basis of BQMC, discuss qualitatively and analytically the problem of the fluctuations in the branching, and present partial solutions to that problem. Finally we exhibit numerical results for some model systems including harmonic oscillators and the hydrogen and helium atoms. Further research will be necessary to make this a practical and generally applicable scheme.
We propose a bilinear sampling algorithm in Green’s function Monte Carlo for expectation values of operators that do not commute with the Hamiltonian and for differences between eigenvalues of different Hamiltonians. The integral representations of the Schroedinger equations are transformed into two equations whose solution has the form ψa(x)t(x, y)ψb(y), where ψa and ψb are the wavefunctions for the two related systems and t(x, y) is a kernel chosen to couple x and y. The Monte Carlo process, with random walkers on the enlarged configuration space x ⊗ y, solves these equations by generating densities whose asymptotic form is the above bilinear distribution. With such a distribution, exact Monte Carlo estimators can be obtained for the expectation values of quantum operators and for energy differences. We present results of these methods applied to several test problems, including a model integral equation, and the hydrogen atom. Key words: algorithm; bilinear sampling; energy difference; Green’s function Monte Carlo; quantum expectations; random walk. 1 I.
Quantum Monte Carlo (QMC) methods represent a powerful family of computational techniques for tackling complex quantum many-body problems and performing calculations of stationary state properties. QMC is among the most accurate and powerful approaches to the study of electronic structure, but its application is often hindered by a steep learning curve; hence it is rarely addressed in undergraduate and postgraduate classes. This tutorial is a step toward filling this gap. We offer an introduction to the diffusion Monte Carlo (DMC) method, which aims to solve the imaginary time Schrödinger equation through stochastic sampling of the configuration space. Starting from the theoretical foundations, the discussion leads naturally to the formulation of a step-by-step algorithm. To illustrate how the method works in simplified scenarios, examples such as the harmonic oscillator and the hydrogen atom are provided. The discussion extends to the fixed-node approximation, a crucial approach for addressing the fermionic sign problem in multi-electron systems. In particular, we examine the influence of trial wave function nodal surfaces on the accuracy of DMC energy by evaluating results from a non-interacting two-fermion system. Extending the method to excited states is feasible in principle, but some additional considerations are needed, supported by practical insights. By addressing the fundamental concepts from a hands-on perspective, we hope this tutorial will serve as a valuable guide for researchers and students approaching DMC for the first time.
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.
The quantum Monte Carlo (QMC) technique is an extremely powerful method to treat many-body systems. Usually the quantum Monte Carlo method has been applied in cases where the interaction potential has a simple analytic form, like the 1/r Coulomb potential. However, in a complicated environment as in a semiconductor heterostructure, the evaluation of the interaction itself becomes a nontrivial problem. Obtaining the potential from any grid-based finite-difference method for every walker and every step is infeasible. We demonstrate an alternative approach of solving the Poisson equation by a classical Monte Carlo calculation within the overall quantum Monte Carlo scheme. We have developed a modified "walk on spheres" algorithm using Green's function techniques, which can efficiently account for the interaction energy of walker configurations, typical of quantum Monte Carlo algorithms. This stochastically obtained potential can be easily incorporated with variational, diffusion, and other Monte Carlo techniques. We demonstrate the validity of this method by studying a simple problem, the polarization of a helium atom in the electric field of an infinite capacitor.
… as suggested by Fermi, the time-independent Schrödinger equation … can be interpreted as describing the behavior of a system of particles each of which performs a random walk, i.e., diffuses isotropically and at the same time is subject to multiplication, which is determined by the value of the point function V. N. Metropolis and S. Ulam, 1949 Summary In the projector quantum Monte Carlo method, one uses a function of the hamiltonian to sample a distribution proportional to the exact ground-state wavefunction, and thereby computes exact matrix elements of it. An importance sampling transformation makes the algorithm much more efficient. In this chapter we introduce and develop the diffusion Monte Carlo method, which involves drifting, branching random walks. For any excited state, including any system with more than two electrons, one encounters the sign problem, limiting the direct application of these algorithms for most fermion systems. Instead, by using approximate fixed-node or fixed-phase boundary conditions, one can achieve efficiency similar to variational Monte Carlo. We also discuss the application of the projector method in a basis of Slater determinants. In this chapter, we discuss a different quantum Monte Carlo method, projector Monte Carlo (PMC). This general method was first suggested by Fermi [1049]; see the quote at the start of this chapter by two of the inventors of the Monte Carlo method. An implementation of PMC was tried out in the early days of computing [1050]. Advances in methodology, in particular importance sampling, resulted in a significant large-scale application: the exact calculation of the ground-state properties of 256 hard-sphere bosons by Kalos, Levesque, and Verlet [1051] in 1974. Calculations for electronic systems and the fixednode approximation were introduced by Anderson [1052, 1053]. One of the most important projector MC algorithms, the diffusion Monte Carlo algorithm with importance sampling for fermions, was used to compute the correlation energy of homogeneous electron gas by Ceperley and Alder [109] in 1980; the resulting HEG correlation energy was crucial in the development of density functional calculations. Types and properties of projectors In this method, a many-body projector G ( R , R ) = Ĝ is repeatedly applied to filter out the exact many-body ground state from an initial state; the operation of the projector is carried out with a random walk, hence the name of this class of methods.
Quantum Monte Carlo (QMC) is an extremely powerful method to treat many-body systems. Usually quantum Monte Carlo has been applied in cases where the interaction potential has a simple analytic form, like the 1/r Coulomb potential. However, in a complicated environment as in a semiconductor heterostructure, the evaluation of the interaction itself becomes a non-trivial problem. Obtaining the potential from any grid-based finite-difference method, for every walker and every step is unfeasible. We demonstrate an alternative approach of solving the Poisson equation by a classical Monte Carlo within the overall quantum Monte Carlo scheme. We have developed a modified ''Walk On Spheres'' algorithm using Green's function techniques, which can efficiently account for the interaction energy of walker configurations, typical of quantum Monte Carlo algorithms. This stochastically obtained potential can be easily incorporated within popular quantum Monte Carlo techniques like variational Monte Carlo (VMC) or diffusion Monte Carlo (DMC). We demonstrate the validity of this method by studying a simple problem, the polarization of a helium atom in the electric field of an infinite capacitor.