We reexamine some fundamental Quantum Monte Carlo (QMC) algorithms with the goal of making QMC more mainstream and efficient. Two major themes exist: (1) Make QMC faster and cheaper, and (2) Make QMC more robust and easier to use. A fast "on-the-fly" algorithm to extract uncorrelated estimators from serially correlated data on a huge network is presented, DDDA. A very efficient manager-worker algorithm for QMC parallelization is presented, QMC-MW. Reduced expense VMC optimization procedure is presented to better guess initial Jastrow parameter sets for hydrocarbons, GJ. I also examine the formation and decomposition of aminomethanol using a variety of methods including a test of the hydrocarbon GJ set on these oxygen- and nitrogen-containing systems. The QMC program suite QMcBeaver is available from the authors in its entirety while a user's and developer's manual is attached as supplementary material.
We reexamine some fundamental Quantum Monte Carlo (QMC) algorithms with the goal of making QMC more mainstream and efficient. Two major themes exist: (1) Make QMC faster and cheaper, and (2) Make QMC more robust and easier to use. A fast "on-the-fly" algorithm to extract uncorrelated estimators from serially correlated data on a huge network is presented, DDDA. A very efficient manager-worker algorithm for QMC parallelization is presented, QMC-MW. Reduced expense VMC optimization procedure is presented to better guess initial Jastrow parameter sets for hydrocarbons, GJ. I also examine the formation and decomposition of aminomethanol using a variety of methods including a test of the hydrocarbon GJ set on these oxygen- and nitrogen-containing systems. The QMC program suite QMcBeaver is available from the authors in its entirety while a user's and developer's manual is attached as supplementary material.
The exponential growth in computer power over the past few decades has been a huge boon to computational chemistry, physics, biology, and materials science. Now, a standard workstation or Linux cluster can calculate semi-quantitative properties of moderately sized systems. The next step in computational science is developing better algorithms which allow quantitative calculations of a system's properties. A relatively new class of algorithms, known collectively as Quantum Monte Carlo (QMC), has the potential to quantitatively calculate the properties of molecular systems. Furthermore, QMC scales as O(N3) or better. This makes possible very high-level calculations on systems that are too large to be examined using standard high-level methods. This thesis develops (1) an efficient algorithm for determining "on-the-fly" the statistical error in serially correlated data, (2) a manager-worker parallelization algorithm for QMC that allows calculations to run on heterogeneous parallel computers and computational grids, (3) a robust algorithm for optimizing Jastrow functions which have singularities for some parameter values, and (4) a proof-of-concept demonstrating that it is possible to find transferable parameter sets for large classes of compounds.
Quantum Monte Carlo (QMC) is a powerful computational tool to study correlated systems of electrons, allowing us to explicitly treat many-body interactions with favorable scaling in the number of particles. It has been regarded as a benchmark tool for condensed matter systems containing elements from the first and second row of the periodic table. It holds particular promise for the more complicated transition metals, because QMC treats the correlations between electrons explicitly, and has a computational cost that scales well with the system size.
We have developed a QMC framework that is capable of simulating systems containing many electrons efficiently, through advanced algorithms and parallel operation. This framework includes a QMC program using state of the art methods that make many interesting quantities available.
We apply a method of finding the minimum and other properties of the potential energy surface in the face of stochastic noise using Bayesian inference and the total energy. We apply these developments to several transition metal systems, including the first five transition metal monoxide molecules and two interesting ABO3 perovskite solids: BaTiO3 and BiFeO3.
Where experiment is available, QMC is generally in agreement with a few exceptions that are discussed. In the case where experiment is unavailable, it makes predictions that can help us understand somewhat ambiguous experimental results.
A manager-worker-based parallelization algorithm for Quantum Monte Carlo (QMC-MW) is presented and compared with the pure iterative parallelization algorithm, which is in common use. The new manager-worker algorithm performs automatic load balancing, allowing it to perform near the theoretical maximal speed even on heterogeneous parallel computers. Furthermore, the new algorithm performs as well as the pure iterative algorithm on homogeneous parallel computers. When combined with the dynamic distributable decorrelation algorithm (DDDA) [Feldmann et al., J Comput Chem 28, 2309 (2007)], the new manager-worker algorithm allows QMC calculations to be terminated at a prespecified level of convergence rather than upon a prespecified number of steps (the common practice). This allows a guaranteed level of precision at the least cost. Additionally, we show (by both analytic derivation and experimental verification) that standard QMC implementations are not "perfectly parallel" as is often claimed.
Quantum Monte Carlo (QMC) methods sample the wave function, in principle the exact one, instead of optimizing analytical functions as standard ab initio approaches. They have emerged as suitable alternative to ab initio methods to deal with the dynamical correlation in the description of the electronic structure of atoms and molecules. Differently from standard quantum chemistry approaches, QMC enjoys several features that make it the method of choice for complicated systems. Among these features, it is important to notice its intrinsically parallelizable nature, the slow (˜N 3 ) scaling of the computational cost with number of particles N, the limited amount of memory required and its ability to deal with substantially different systems within the same theoretical/algorithmic structure (e.g. it can be easily applied to both bosons and fermions, to the description of systems containing electrons and positrons as well as of vibrational properties of molecules). One of the strongest points characterizing QMC is the fact that it may use any kind of basis sets, albeit uncommon ones, depending on the species. This fact allows QMC either to quickly converge to the exact answer in the case of bosonic systems, or to easily recover 90–95% of the correlation energy in electronic species without the inverse cubic convergence with respect to the size of the basis set that plagues more common ab initio methods. Thanks to these characteristics, different flavours of QMC have been applied to a wide set of species/problems spanning a range that stretches from molecules as small as water up to pieces of bulk matter as large as silicon and germanium crystals and that includes molecules such as porphyrins and C 20 . Despite the strong points highlighted, QMC suffers from a relatively high computational cost mainly due to the necessity of evaluating many times a reference wave function. Thus, a substantial reduction of this cost may come from central processing units (CPU) particularly tailored to compute exponentials, polynomials and rational functions, from better algorithms that require less function evaluations and from variance reduction techniques. Besides, more robust approaches to reduce the so called “nodal error” would help improve the already appreciable accuracy afforded by QMC. With the above issues improved, there are several avenues that would become possible to pursue on a routine basis. Among these, we foresee the calculations of intermolecular interactions for very large systems (e.g. parts of DNA with or without interacting species), the calculation of nuclear magnetic resonance (NMR) parameters for difficult systems, the automatic optimization of molecular structures and, even better, the chance of running molecular dynamics simulation à la Car–Parrinello using QMC computed atomic forces. In these circumstances, the study of phase transitions, bulk matter, interfaces and large biological systems may reach an unexpected level of accuracy that is currently unavailable due to methodological limitations.
Computing accurate yet efficient approximations to the solutions of the electronic Schrödinger equation has been a paramount challenge of computational chemistry for decades. Quantum Monte Carlo methods are a promising avenue of development as their core algorithm exhibits a number of favorable properties: it is highly parallel and scales favorably with the considered system size, with an accuracy that is limited only by the choice of the wave function Ansatz. The recently introduced machine-learned parametrizations of quantum Monte Carlo Ansätze rely on the efficiency of neural networks as universal function approximators to achieve state of the art accuracy on a variety of molecular systems. With interest in the field growing rapidly, there is a clear need for easy to use, modular, and extendable software libraries facilitating the development and adoption of this new class of methods. In this contribution, the DeepQMC program package is introduced, in an attempt to provide a common framework for future investigations by unifying many of the currently available deep-learning quantum Monte Carlo architectures. Furthermore, the manuscript provides a brief introduction to the methodology of variational quantum Monte Carlo in real space, highlights some technical challenges of optimizing neural network wave functions, and presents example black-box applications of the program package. We thereby intend to make this novel field accessible to a broader class of practitioners from both the quantum chemistry and the machine learning communities.
Quantum Monte Carlo (QMC) is one of the most promising methods for solving quantum many-body problems. QMC combines known analytical properties of wave functions, results from other methods, and stochastic techniques, into a powerful tool for investigation of the electronic structure of real materials. Furthermore, the method has a favorable scaling ( O[N3] in the number of electrons), perfect scalability on parallel architectures, and can be applied to a wide range of systems. Our work has focused both on expanding the capabilities of QMC for calculation of quantities beyond energies, such as interatomic forces, and on application of the method to challenging problems in nanostructure materials research. For the calculation of interatomic forces we have implemented a finite difference correlated sampling method. The correlated sampling enables us to avoid the problem of statistical noise in evaluating the energy differences and allows us to obtain forces with an average 1% error. We have analyzed the effect of the method's main approximations on the estimate of the forces, both by theoretical arguments and by performing a variety of tests on small systems. Furthermore, we have used this newly developed method for estimating equilibrium geometries in a problem where other methods have failed. QMC enabled us to treat the electron correlation effects with high accuracy and to provide accurate predictions in a number of interesting applications. In particular, for carbon rings of C4N+2 stoichiometry we have resolved a long-standing problem regarding the competition between the aromaticity and second order Jahn-Teller effects. We have found that the dominant mechanism at small and intermediate sizes, which stabilizes the bond angle and bond length alternated geometries, is the secondorder Jahn-Teller effect while the aromatic isomer is always found to be a transition state. These high accuracy calculations which have involved multi-reference wave functions, extensive variational optimizations, and the use of massively parallel platforms demonstrate clearly the unique capabilities of the QMC approach.