Quantum Averages and Statistical Samplings In this chapter, we discuss the general framework in which the variational Monte Carlo methods are defined and few important implementations for interacting systems of bosons and fermions on the lattice. The main advantage of considering this approach relies on the variational principle that has been shown in section 1.4: the energy of a given quantum state is always bounded from below by the exact ground-state one, giving us the route to obtain the best possible solution to the problem. In most cases, a suitable parametrization of the variational wave function allows us to consider a wide range of different quantum phases (e.g., metals, superconductors, and insulators). By performing an optimization of the parameters, we can reach the lowest-energy state, which is expected to capture the correct ground-state behavior. Therefore, variational wave functions represent a flexible and valuable approach to get important insights into the low-energy properties of models that cannot be solved by exact methods. By contrast, the main limitation of this approach is the fact that it is based on a given Ansatz , which may contain a relevant bias that cannot be removed within the chosen parametrization. We also mention that variational wave functions can be easily defined and treated for a wide class of models, irrespective of the range of interactions and the dimension of the local (i.e., single-site) Hilbert space, which can be even infinite and does not need the use of an uncontrolled cutoff to work with a finite-dimensional space. In this respect, variational Monte Carlo is better than other methods, like densitymatrix renormalization group or tensor-network methods in which the complexity dramatically increases with both the range of the interaction and the dimension of the local Hilbert space (White, 1992; Schollwöck, 2005, 2011). Let us start by describing the general framework in which variational Monte Carlo methods are defined. First of all, we fix a complete basis set in the Hilbert space, in which (for simplicity) the states are taken to be orthogonal and normalized such that: Then, any quantum state can be written as: In turn, the expectation value of an operator over a given variational wave function takes the following form: The main problem in evaluating the expectation value is that the number of configurations in the sum is exponentially large with the number of particles.
Quantum Averages and Statistical Samplings In this chapter, we discuss the general framework in which the variational Monte Carlo methods are defined and few important implementations for interacting systems of bosons and fermions on the lattice. The main advantage of considering this approach relies on the variational principle that has been shown in section 1.4: the energy of a given quantum state is always bounded from below by the exact ground-state one, giving us the route to obtain the best possible solution to the problem. In most cases, a suitable parametrization of the variational wave function allows us to consider a wide range of different quantum phases (e.g., metals, superconductors, and insulators). By performing an optimization of the parameters, we can reach the lowest-energy state, which is expected to capture the correct ground-state behavior. Therefore, variational wave functions represent a flexible and valuable approach to get important insights into the low-energy properties of models that cannot be solved by exact methods. By contrast, the main limitation of this approach is the fact that it is based on a given Ansatz , which may contain a relevant bias that cannot be removed within the chosen parametrization. We also mention that variational wave functions can be easily defined and treated for a wide class of models, irrespective of the range of interactions and the dimension of the local (i.e., single-site) Hilbert space, which can be even infinite and does not need the use of an uncontrolled cutoff to work with a finite-dimensional space. In this respect, variational Monte Carlo is better than other methods, like densitymatrix renormalization group or tensor-network methods in which the complexity dramatically increases with both the range of the interaction and the dimension of the local Hilbert space (White, 1992; Schollwöck, 2005, 2011). Let us start by describing the general framework in which variational Monte Carlo methods are defined. First of all, we fix a complete basis set in the Hilbert space, in which (for simplicity) the states are taken to be orthogonal and normalized such that: Then, any quantum state can be written as: In turn, the expectation value of an operator over a given variational wave function takes the following form: The main problem in evaluating the expectation value is that the number of configurations in the sum is exponentially large with the number of particles.
Since the form of PN is the same as that occurring in the statistical mechanics of the classical gas (replace f 2 ( r ij ) by exp[- V ( r ij /kT ]), we can use the same integration techniques that are used in the classical problem. W. L. McMillan, 1965 Summary Building on the random walk methods developed in the previous chapter, we show how to compute properties of many-body trial wavefunctions using a random walk. This method, called variational Monte Carlo, is the simplest stochastic quantum many-body technique. Whereas mean-field methods are usually limited to single determinants, variational Monte Carlo can treat any correlated trial function, as long as its values are computable. We discuss how to optimize such trial wavefunctions, how to compute their momentum distribution, how to use non-local pseudopotentials, how to compute excited states, and how to correct for the finite size of the simulation cell. Deterministic quantum methods have difficulties. For example, the Hartree–Fock method assumes the wavefunction is a single Slater determinant, neglecting correlation. If one expands as a sum of determinants, it is very difficult to have the results size-consistent since the number of determinants needed will grow exponentially with the system size. As we have seen, the DMFT method introduced in Ch. 16 assumes locality. In Ch. 6 we discussed general properties of many-body wavefunctions. Using Monte Carlo methods, we can directly incorporate correlation into a wavefunction, without having to make any further approximations other than the form of the correlation factors. In many cases the energy and other properties are very close to the exact results. Some of the usual restrictions on the form of the many-body wavefunction are not an issue in variational Monte Carlo. The most important generalization of the HF wavefunction is to put correlation directly into the wavefunction via the “Jastrow” factor. At next order, one can use the “backflow” wavefunction, in which correlation is also built into the determinant. The variational Monte Carlo method (VMC) was first used by McMillan [44] to calculate the ground-state properties of superfluid 4 He. One of the key problems at that time was whether the observed superfluid properties were a consequence of Bose condensation.
Introduction In Chapters 1 to 4 we studied methods for solving the Schrödinger equation for many-electron systems. Many of the techniques described there carry over to other quantum many-particle systems, such as liquid helium, and the protons and neutrons in a nucleus. The techniques which we discussed there were, however, all of a mean-field type and therefore correlation effects could not be taken into account without introducing approximations. In this chapter, we consider more accurate techniques, which are similar to those studied in Chapter 10 and are based on using (pseudo-)random numbers – hence the name ‘Monte Carlo’ for these methods. In Chapter 10 we applied Monte Carlo techniques to classical many-particle systems; here we use these techniques for studying quantum problems involving many particles. In the next section we shall see how we can apply Monte Carlo techniques to the problem of calculating the quantum mechanical expectation value of the ground state energy. This is used in order to optimise this expectation value by adjusting a trial wave function in a variational type of approach, hence the name variational Monte Carlo (VMC). In the following section we use the similarity between the Schrödinger equation and the diffusion equation in order to calculate the properties of a collection of interacting quantum mechanical particles by simulating a classical particle diffusion process. The resulting method is called diffusion Monte Carlo (DMC).
Solving the Schrodinger equation and finding excited states for quantum mechanical many-body systems is a fundamental problem. If this problem is formulated in terms of integrals, the dimensionality of the configuration space is often too high to perform the integrations required directly. This is because the volume of configuration space increases exponentially with dimension quickly, making its complete exploration impossible. Monte Carlo methods provide a way to estimate these integrals by statistically sampling a subset of configuration space, and these methods provide 1/√ N convergence regardless of dimension. For many problems involving the quantum mechanics of molecules there exists a large time scale separation between the high-frequency internal vibrations, and low-frequency intermolecular motions. This separation motivates the rigid-body approximation which freezes internal degrees of freedom in order to study intermolecular effects. The reduction in the dimensionality of configuration space further increases the range of accessible problems. This thesis is devoted to the construction and implementation of algorithms which incorporate the rigid-body approximation into existing Monte Carlo methods for solving the quantum mechanical many-body problem. Monte Carlo estimators are constructed as averages over samples drawn from some probability distribution. If this distribution is known in closed form the samples can be generated by application of the Metropolis algorithm. In most cases the distribution is not known in closed form or even representable with a finite number of variables. If this distribution is the dominant eigenstate of some known operator then a stochastic implementation of the power method can be used to generate the required samples. For the quantum mechanical problem this operator can be taken to be the imaginary-time evolution operator and its application can be represented in terms of random walks. For rigid bodies, this method involves the implementation of rotational Brownian motion. The use of quaternion algebra to implement this rotational motion enhances simplicity, performance, and numerical stability. The method described above can be generalized to investigate excited state properties using correlation function Monte Carlo which is a Monte Carlo implementation of the Rayleigh-Ritz variational method. This generalization requires the construction of a trial subspace which is then subjected to the variational method resulting in a generalized eigenvalue problem. It is important to represent optimized trial states accurately and efficiently. For this purpose, we write trial states as functions of invariant polynomials of the interparticle distances. By reducing the number of free interparticle distances, the rigid-body approximation greatly simplifies
… a general method, suitable for electronic computing machines, of calculating the properties of any substance which may be considered as composed of interacting individual molecules. N. Metropolis et al. , 1953 Summary Quantum Monte Carlo methods have been very useful in providing exact results, or, at least, exact constraints on properties of electronic systems, in particular for the homogeneous electron gas. The results are, in many cases, more accurate than those from other quantum many-body methods, and provide unique capabilities and insights. In this chapter we introduce the general properties of stochastic methods and motivate their use on the quantum many-body problem. In particular, we discuss Markov chains and the computation of error estimates. The methods that we introduce in the next four chapters are quite different from those in Parts II and III: stochastic or quantum Monte Carlo methods. In stochastic methods, instead of solving deterministically for properties of the quantum many-body system, one sets up a random walk that samples for the properties. Historically the most important role of QMC for the electronic structure field has been to provide input into the other methods, most notably the QMC calculation of the HEG [109], used for the exchange– correlation functional in DFT. A second important role has been as benchmarks for other methods such asGW. There are systems for which QMC is uniquely suited, for example the Wigner transition in the low-density electron gas, see Sec. 3.1. In this chapter we introduce general properties of simulations, in particular Markov chains, and error estimates. In the following chapters we will apply this theory to three general classes of quantum Monte Carlo algorithms, namely variational (Ch. 23), projector (Ch. 24), and path-integral Monte Carlo (Ch. 25); Ch. 18 already introduced the QMC calculation of the impurity Green's function used in the dynamical mean-field method.We note that there are a variety of other QMC methods not covered in this book. Simulations First let us define what we mean by a simulation, since the word has other meanings in applied science. The dimensionality of phase space (i.e., the Hilbert space for a quantum system) is large or infinite. Even a classical system requires the positions and momenta of all particles, and, hence, the phase space for N classical particles has dimensionality 6 N .
Trial wave function based quantum Monte Carlo is a promising family of methods for the solution of quantum mechanical Hamiltonians. These fundamentally non-perturbative methods can be used to treat bosons or fermions in weakly or strong interacting systems and in any phase. Properties computed for particles with bosonic statistics can be converged to their exact value at relatively moderate computational cost using diffusion quantum Monte Carlo. For fermions the problem is slightly more complicated. Exact methods, such as released-node diffusion quantum Monte Carlo, exist for computing unbiased fermion properties, however their computational expense increases rapidly with the Bose-Fermi energy gap and system size. It is possible to use a fixed-node version of diffusion quantum Monte Carlo, but it introduces a bias due to the nodes of the trial wave function. In this thesis we work towards reducing trial wave function bias in fixed-node calculations and then perform several benchmark studies. We begin with a pedagogical overview of the three methods used throughout the thesis, variational, diffusion, and reptation quantum Monte Carlo. Then we discuss the problem, trial wave function bias in the energy and other observables. Next we outline the Hamiltonians we are typically interested in for electronic systems and trial wave function forms used to solve them. The algorithm used to optimize the trial wave functions is presented along with special considerations for some particular cases. Next we present three studies of the pressure of the electron gas using improved estimators in variational, diffusion, and reptation quantum Monte Carlo. Benchmark results for a set of molecules are then presented for the massive multi-determinant expansion and optimization algorithm tailored to suit it. We conclude with two studies of the interacting Fermi liquid, one on the momentum properties of the electron gas in three dimensions and another on the entanglement properties of interacting Fermi liquids in two dimensions.
… 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.