Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial wave functions, that is to variational quantum Monte Carlo. Almost all previous implementations employ samples distributed as the physical probability density of the trial wave function, and assume the central limit theorem to be valid. In this paper we provide an analysis of random error in estimation and optimization that leads naturally to new sampling strategies with improved computational and statistical properties. A rigorous lower limit to the random error is derived, and an efficient sampling strategy presented that significantly increases computational efficiency. In addition the infinite variance heavy tailed random errors of optimum parameters in conventional methods are replaced with a Normal random error, strengthening the theoretical basis of optimization. The method is applied to a number of first row systems and compared with previously published results.
Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial wave functions, that is to variational quantum Monte Carlo. Almost all previous implementations employ samples distributed as the physical probability density of the trial wave function, and assume the central limit theorem to be valid. In this paper we provide an analysis of random error in estimation and optimization that leads naturally to new sampling strategies with improved computational and statistical properties. A rigorous lower limit to the random error is derived, and an efficient sampling strategy presented that significantly increases computational efficiency. In addition the infinite variance heavy tailed random errors of optimum parameters in conventional methods are replaced with a Normal random error, strengthening the theoretical basis of optimization. The method is applied to a number of first row systems and compared with previously published results.
Expectation values of physical quantities may accurately be obtained by the evaluation of integrals within many-body quantum mechanics, and these multidimensional integrals may be estimated using Monte Carlo methods. In a previous publication it has been shown that for the simplest, most commonly applied strategy in continuum quantum Monte Carlo, the random error in the resulting estimates is not well controlled. At best the central limit theorem is valid in its weakest form, and at worst it is invalid and replaced by an alternative generalized central limit theorem and non-normal random error. In both cases the random error is not controlled. Here we consider a new "residual sampling strategy" that reintroduces the central limit theorem in its strongest form, and provides full control of the random error in estimates. Estimates of the total energy and the variance of the local energy within variational Monte Carlo are considered in detail, and the approach presented may be generalized to expectation values of other operators, and to other variants of the quantum Monte Carlo method.
The combination of continuum many-body quantum physics and Monte Carlo methods provide a powerful and well established approach to first principles calculations for large systems. Replacing the exact solution of the problem with a statistical estimate requires a measure of the random error in the estimate for it to be useful. Such a measure of confidence is usually provided by assuming the central limit theorem to hold true. In what follows it is demonstrated that, for the most popular implementation of the variational Monte Carlo method, the central limit theorem has limited validity, or is invalid and must be replaced by a generalized central limit theorem. Estimates of the total energy and the variance of the local energy are examined in detail, and shown to exhibit uncontrolled statistical errors through an explicit derivation of the distribution of the random error. Several examples are given of estimated quantities for which the central limit theorem is not valid. The approach used is generally applicable to characterizing the random error of estimates, and to quantum Monte Carlo methods beyond variational Monte Carlo.
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.
Abstract The optimization of trial wavefunctions ‘I/Jr for use in QMC calculations can be accomplished with a fixed set of configurations selected with probabilities proportional to ‘1/Jf, often using Metropolis sampling and occasionally using other methods. By varying the coefficients of ‘I/Jr, one can minimize the variance in local energies for the original set of configurations. This is effective except when coefficients affecting the node locations are varied and occasional very high weighting factors ‘I/J}(new)/’1/J}(original) can give large fluctuations in the variance. In this paper, the authors propose the use of probability density functions p to produce nodeless distributions of points replacing the original ‘1/Jf distributions. This has two advantages: it avoids the unbounded weighting problem allowing nodes to be varied, and it facilitates sampling without a Metropolis walk and its associated serial correlation. To be effective, i.e., for high efficiency, p must be carefully selected, it must at least resemble ‘1/Jf, and its distributions must be easily sampled. Tests were performed for the case of CH with optimization of all parameters of a two-determinant-and-Jastrow trial function. These included basis set exponents, MO coefficients, CI coefficient, and SchmidtMoskowitz Jastrow parameters. The resulting variance in local energy was 0.19 h2, versus 0.25 h2 for optimization of the Jastrow coefficients only. More interesting is the improvement in diffusion QMC energy for the complete optimization including node movement. The energy was lowered by 0.004 hartree, or 2.5 kcal/mol, with recovery of correlation energy increased from 92.8 to 94.8%.
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
In this study, we give an extension of Montanaro's arXiv/archive:1504.06987 quantum Monte Carlo method, tailored for computing expected values of random variables that exhibit infinite variance. This addresses a challenge in analyzing heavy-tailed distributions, which are commonly encountered in various scientific and engineering fields. Our quantum algorithm efficiently estimates means for variables with a finite (1+δ)th moment, where δ lies between 0 and 1. It provides a quadratic speedup over the classical Monte Carlo method in both the accuracy parameter ε and the specified moment of the distribution. We establish both classical and quantum lower bounds, showcasing the near-optimal efficiency of our algorithm among quantum methods. Our work focuses not on creating new algorithms, but on analyzing the execution of existing algorithms with available additional information about the random variable. Additionally, we categorize these scenarios and demonstrate a hierarchy in the types of supplementary information that can be provided.