The density matrix quantum Monte Carlo (DMQMC) set of methods stochastically samples the exact N-body density matrix for interacting electrons at finite temperature. We introduce a simple modification to the interaction picture DMQMC (IP-DMQMC) method that overcomes the limitation of only sampling one inverse temperature point at a time, instead allowing for the sampling of a temperature range within a single calculation, thereby reducing the computational cost. At the target inverse temperature, instead of ending the simulation, we incorporate a change of picture away from the interaction picture. The resulting equations of motion have piecewise functions and use the interaction picture in the first phase of a simulation, followed by the application of the Bloch equation once the target inverse temperature is reached. We find that the performance of this method is similar to or better than the DMQMC and IP-DMQMC algorithms in a variety of molecular test systems.
The density matrix quantum Monte Carlo (DMQMC) set of methods stochastically samples the exact N-body density matrix for interacting electrons at finite temperature. We introduce a simple modification to the interaction picture DMQMC (IP-DMQMC) method that overcomes the limitation of only sampling one inverse temperature point at a time, instead allowing for the sampling of a temperature range within a single calculation, thereby reducing the computational cost. At the target inverse temperature, instead of ending the simulation, we incorporate a change of picture away from the interaction picture. The resulting equations of motion have piecewise functions and use the interaction picture in the first phase of a simulation, followed by the application of the Bloch equation once the target inverse temperature is reached. We find that the performance of this method is similar to or better than the DMQMC and IP-DMQMC algorithms in a variety of molecular test systems.
The recently developed density matrix quantum Monte Carlo (DMQMC) algorithm stochastically samples the N-body thermal density matrix and hence provides access to exact properties of many-particle quantum systems at arbitrary temperatures. We demonstrate that moving to the interaction picture provides substantial benefits when applying DMQMC to interacting fermions. In this first study, we focus on a system of much recent interest: the uniform electron gas in the warm dense regime. The basis set incompleteness error at finite temperature is investigated and extrapolated via a simple Monte Carlo sampling procedure. Finally, we provide benchmark calculations for a four-electron system, comparing our results to previous work where possible.
High Resolution Image Download MS PowerPoint Slide Density matrix quantum Monte Carlo (DMQMC) is a recently developed method for stochastically sampling the N -particle thermal density matrix to obtain exact-on-average energies for model and ab initio systems. We report a systematic numerical study of the sign problem in DMQMC based on simulations of atomic and molecular systems. In DMQMC, the density matrix is written in an outer product basis of Slater determinants. In principle, this means that DMQMC needs to sample a space that scales in the system size, N, as O[(exp(N)) 2 ]. In practice, removing the sign problem requires a total walker population that exceeds a system-dependent critical walker population ( N c ), imposing limitations on both storage and compute time. We establish that N c for DMQMC is the square of N c for FCIQMC. By contrast, the minimum N c in the interaction picture modification of DMQMC (IP-DMQMC) is only linearly related to the N c for FCIQMC. We find that this difference originates from the difference in propagation of IP-DMQMC versus canonical DMQMC: the former is asymmetric, whereas the latter is symmetric. When an asymmetric mode of propagation is used in DMQMC, there is a much greater stochastic error and is thus prohibitively expensive for DMQMC without the interaction picture adaptation. Finally, we find that the equivalence between IP-DMQMC and FCIQMC seems to extend to the initiator approximation, which is often required to study larger systems with large basis sets. This suggests that IP-DMQMC offers a way to ameliorate the cost of moving between a Slater determinant space and an outer product basis.
We here apply the recently developed initiator density matrix quantum Monte Carlo (i-DMQMC) to a variety of atoms and molecules in vacuum. i-DMQMC samples the exact density matrix of a Hamiltonian at finite temperature and combines the accuracy of full configuration interaction quantum Monte Carlo (FCIQMC)—full configuration interaction (FCI) or exact energies in a finite basis set—with finite temperature. In order to explore the applicability of i-DMQMC for molecular systems, we choose to study a recently developed test set by Rubenstein and co-workers: Be, H 2 O, and H 10 at near-equilibrium and stretched geometries. We find that, for Be and H 2 O, i-DMQMC delivers energies with submillihartree accuracy when compared with finite temperature FCI. For H 2 O and both geometries of H 10, we examine the difference between FT-AFQMC and i-DMQMC, which, in turn, estimates the difference in canonical versus grand canonical energies. We close with two discussions: one of simulation settings (initiator error, the interaction picture, and different basis sets), and another of energy difference calculations in the form of specific heat capacity and ionization potential calculations.
We present a quantum Monte Carlo method capable of sampling the full density matrix of a many-particle system at finite temperature. This allows arbitrary reduced density matrix elements and expectation values of complicated nonlocal observables to be evaluated easily. The method resembles full configuration interaction quantum Monte Carlo but works in the space of many-particle operators instead of the space of many-particle wave functions. One simulation provides the density matrix at all temperatures simultaneously, from $T=\ensuremath{\infty}$ to T=0, allowing the temperature dependence of expectation values to be studied. The direct sampling of the density matrix also allows the calculation of some previously inaccessible entanglement measures. We explain the theory underlying the method, describe the algorithm, and introduce an importance-sampling procedure to improve the stochastic efficiency. To demonstrate the potential of our approach, the energy and staggered magnetization of the isotropic antiferromagnetic Heisenberg model on small lattices, the concurrence of one-dimensional spin rings, and the Renyi S2 entanglement entropy of various sublattices of the $6\ifmmode\times\else\texttimes\fi{}6$ Heisenberg model are calculated. The nature of the sign problem in the method is also investigated.
Building on the success of Quantum Monte Carlo techniques such as diffusion Monte Carlo, alternative stochastic approaches to solve electronic structure problems have emerged over the past decade. The full configuration interaction quantum Monte Carlo (FCIQMC) method allows one to systematically approach the exact solution of such problems, for cases where very high accuracy is desired. The introduction of FCIQMC has subsequently led to the development of coupled cluster Monte Carlo (CCMC) and density matrix quantum Monte Carlo (DMQMC), allowing stochastic sampling of the coupled cluster wave function and the exact thermal density matrix, respectively. In this Article, we describe the HANDE-QMC code, an open-source implementation of FCIQMC, CCMC and DMQMC, including initiator and semistochastic adaptations. We describe our code and demonstrate its use on three example systems; a molecule (nitric oxide), a model solid (the uniform electron gas), and a real solid (diamond). An illustrative tutorial is also included.
In this brief article, I introduce the various types of quantum Monte Carlo (QMC) methods, in particular, those that are applicable to systems in extreme regimes of temperature and pressure.We give references to longer articles where detailed discussion of applications and algorithms appear. MOTIVATIONOne does QMC for the same reason as one does classical simulations; there is no other method able to treat exactly the quantum many-body problem aside from the direct simulation method where electrons and ions are directly represented as particles, instead of as a "fluid" as is done in mean-field based methods.However, quantum systems are more difficult than classical systems because one does not know the distribution to be sampled, it must be solved for.In fact, it is not known today which quantum problems can be "solved" with simulation on a classical computer in a reasonable amount of computer time.One knows that certain systems, such as most quantum many-body systems in 1D and most bosonic systems are amenable to solution with Monte Carlo methods, however, the "sign problem" prevents making the same statement for systems with electrons in 3D.Some limitations or approximations are needed in practice.On the other hand, in contrast to simulation of classical systems, one does know the Hamiltonian exactly: namely charged particles interacting with a Coulomb potential.Given sufficient computer resources, the results can be of quite high quality and for systems where there is little reliable experimental data.For this reason, QMC methods, though more expensive, are useful to benchmark and validate results from other methods.The two main applications that we will discuss in this review are the "electronic structure problem"; computing the energy of the an interacting systems of electrons and fixed ions, and the problem of quantum effects of the nuclei. RANDOM WALK AND MARKOV CHAINSMost QMC algorithms are based on random walks, known mathematically as Markov chains.This is a general class of algorithms, introduced in the famous work by Metropolis, the Rosenbluths and the Tellers (1953) for sampling any probability distribution.Let us denote the desired distribution as Π(S), where the variable "S" represents the state of the walk, for example the coordinates of all of the particles.In a random walk, one invents some moving rules (transition probabilities) for changing the state of the system so that the probability of being in state S n+1 in the (n+1) step, given that the random walk was S n is given by T(S n ; S n+1 ).By