Random Batch Algorithms for Quantum Monte Carlo simulations

Abstract

Random batch algorithms are constructed for quantum Monte Carlo simulations. The main objective is to alleviate the computational cost associated with the calculations of two-body interactions, including the pairwise interactions in the potential energy, and the two-body terms in the Jastrow factor. In the framework of variational Monte Carlo methods, the random batch algorithm is constructed based on the over-damped Langevin dynamics, so that updating the position of each particle in an $N$-particle system only requires $\mathcal{O}(1)$ operations, thus for each time step the computational cost for $N$ particles is reduced from $\mathcal{O}(N^2)$ to $\mathcal{O}(N)$. For diffusion Monte Carlo methods, the random batch algorithm uses an energy decomposition to avoid the computation of the total energy in the branching step. The effectiveness of the random batch method is demonstrated using a system of liquid ${}^4$He atoms interacting with a graphite surface.

References in corpus (8)

• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• Solving Many-Electron Schrödinger Equation Using Deep Neural Networks
• On the Random Batch Method for second order interacting particle systems
• Solving high-dimensional eigenvalue problems using deep neural networks: A diffusion Monte Carlo like approach
• Observation of a structure in $e^{+}{e}^{-}\to \varphi {\eta }^{\prime }$ at $\sqrt{s}$ from 2.05 to 3.08 GeV
• A stochastic version of Stein Variational Gradient Descent for efficient sampling
• Model predictive control with random batch methods for a guiding problem
• Convergence of Random Batch Method for interacting particles with disparate species and weights

Cited by in corpus (3)

• On the Random Batch Method for second order interacting particle systems
• Stochastic Algorithms for Self-consistent Calculations of Electronic Structures
• A splitting Hamiltonian Monte Carlo method for efficient sampling