Quantum Monte Carlo (QMC) Methods

Kaoru Ohno, Keivan Esfarjani, Yoshiyuki Kawazoe

Nandini Trivedi

W. A. Vigor

In this thesis we investigate the recently developed Full Configuration Interaction Quantum Monte Carlo (FCIQMC) method. This method, unlike the traditional methods in Quantum Monte Carlo (QMC), doesn’t require the use of the uncontrolled fixed node approximation and so potentially it can yield far more accurate results. This means that it can be thought of as a hybrid between the methods used by quantum chemists and QMC, and thus has spawned a new field of stochastic quantum chemistry. The work described in this thesis can be split into three distinct but interrelated parts. We begin with an investigation of the underlying FCIQMC stochastic process. We show that FCIQMC is an example of Markov Chain Monte Carlo. This means we can compute a stochastic matrix from which all details about the Monte-Carlo simulation can be obtained. Unfortunately the size of the space scales unfavourably as a function of system size meaning that we have only managed to compute the matrix for the smallest interesting two determinant system. We then use these results to quantify population control bias in FCIQMC for a two determinant system supplementing these analytical results with empirical results to investigate more realistic systems. We then attempt to quantify the efficiency of the FCIQMC algorithms, defining a measure of efficiency. After this we investigate the dependence of our measure on the system size. The error bar of the most efficient FCIQMC algorithm will decay fastest as a function of computer time. We then draw conclusions about the applicability of the FCIQMC method. Finally we describe an implementation of FCIQMC on a novel data flow computer architecture. In our implementation we made a modification to the FCIQMC algorithm to fit the data flow paradigm. We investigate the efficiency of the modified FCIQMC algorithm.

Michael Dzierzawa, X. Zotos

Debashish Das, Richard M. Martin, Malvin H. Kalos

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.

John M. Martyn, Joshua Lin, Neill C. Warrington +2 more

Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.