Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Chemical Theory and Computation

Stochastic Effective Core Potentials, toward Efficient Quantum Monte Carlo Simulations of Molecules with Large Atomic Numbers

Jonas Feldt, Roland Assaraf

Published Feb 11, 2021• 6 citations
Publisher

Abstract

We propose a Monte Carlo method which exploits that core regions are physically independent in a molecule to almost remove their contribution to the numerical cost. The method is tantamount to computing an effective core potential on the fly, by efficiently subsampling the core regions with independent sidewalks. The removal of fluctuations in the core region enables also the dynamic in the valence region to be accelerated using a process with two time steps. As a function of the total number of electrons N the numerical overhead O ( N ) is negligible in comparison to the overall scaling O ( N 3 ) (due to the evaluation of determinants). Tests are presented on atoms, alkane chains, and clusters of silicons. We report a transferability of the parameters of the method from atoms to molecules, enabling a calibration using only single atoms. These tests display a gain in numerical efficiency between one and two orders of magnitude for large N .

DOI
10.1021/acs.jctc.0c01069

Related papers

Subsampling the core region, towards efficient all-electron Monte Carlo calculations in molecules

Jonas Feldt, Roland Assaraf

We propose a method to remove the large statistical fluctuations coming from the core regions when applying an all-electron Variational Monte Carlo method to a molecule. It is based on an efficient subsampling approach which performs sidewalks in these regions. The gain in variance is displayed for a series of atoms and we show that this gain is transferable to molecules on alkane chains and clusters of silicon. For these systems the gain in numerical efficiency is presented, and can be extrapolated to ∼ 22 and ∼ 420 for larger systems when computing the variational energy with a Slater determinant. These results are a proof of concept for numerically affordable all-electron quantum Monte Carlo calculations on molecules with large atomic charges.

•Dec 15, 2020•0 citations

Faster and lower scaling orbital-space Variational Monte Carlo

Iliya Sabzevari, Sandeep Sharma

In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that by appropriately screening the one- and two-electron integrals of the Hamiltonian one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the resulting algorithm scales as the second power of the system size $O(N^2)$, down from the fourth power $O(N^4)$. Using numerical results, we demonstrate that the practical scaling obtained is in fact $O(N^{1.5})$ for a chain of Hydrogen atoms, and $O(N^{1.2})$ for the Hubbard model. Second, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. CTMC is usually prohibitively expensive because of the need to calculate a large number of intermediates. Here, we take advantage of the fact that these intermediates are already calculated during the evaluation of the local energy and consequently, just by storing them one can use the CTCM algorithm with virtually no overhead. Third, we show that by using the adaptive stochastic gradient descent algorithm called AMSGrad one can optimize the wavefunction energies robustly and efficiently. The combination of these three improvements allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wavefunction containing $\sim 2\times 10^5$ variational parameters with an accuracy of 1 $mE_h$/particle at a cost of just 25 CPU hours, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wavefunctions, represents a highly effective method for calculating the electronic structure of model and \emph{ab initio} systems.

arXiv:1807.10633•Jul 27, 2018•2 citations

Overcoming the large-Z problem in quantum monte carlo

PETER J. REYNOLDS

The Z6 scaling of computational effort in quantum Monte Carlo (QMC) results in part from a type of critical slowing down. This insight leads to an attack based on acceleration algorithms which modify the dynamics in Langevin-based simulations without changing the steady-state. Configuration space is more rapidly sampled and steps are inherently more decorrelated. A second approach uses a hybrid Metropolis–Green function Monte Carlo method which factors the core and valence wave function, and treats the former variationally with accurate trial functions, and the latter exactly in the presence of the variationally evoling core. This allows separation of the relevant core and valence time scales, and has sped up quantum simulations by over three orders of magnitude.

International Journal of Quantum Chemistry•Mar 17, 1990•7 citations

Improved Speed and Scaling in Orbital Space Variational Monte Carlo

Iliya Sabzevari, Sandeep Sharma

In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that, by appropriately screening the one- and two-electron integrals of the Hamiltonian, one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the cost of obtaining a constant error per electron scales as the second power of the system size O ( N 2 ), down from the fourth power O ( N 4 ). Using numerical results, we demonstrate that the practical scaling obtained is, in fact, O ( N 1.5 ) for a chain of hydrogen atoms. Second, we show that, by using the adaptive stochastic gradient descent algorithm called AMSGrad, one can optimize the wave function energies robustly and efficiently. Remarkably, AMSGrad is almost as inexpensive as the simple stochastic gradient descent but delivers a convergence rate that is comparable to that of the Stochastic Reconfiguration algorithm, which is significantly more expensive and has a worse scaling with the system size. Third, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. Unlike the first two improvements, CTMC does come at an overhead that the local energy must be calculated at every Monte Carlo step. However, this overhead is mitigated to a large extent because of the reduced scaling algorithm, which ensures that the asymptotic cost of calculating the local energy is equal to that of updating the walker. The resulting algorithm allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wave function containing ∼2 × 10 5 variational parameters with an accuracy of 1 mE h /particle at a cost of just 25 CPU h, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wave functions, represents a highly effective method for calculating the electronic structure of model and ab initio systems.

Journal of Chemical Theory and Computation•Nov 12, 2018•42 citations

Systematic lowering of the scaling of Monte Carlo calculations by partitioning and subsampling

Antoine Bienvenu, Jonas Feldt, Julien Toulouse +1 more

We propose to compute physical properties by Monte Carlo calculations using conditional expectation values. The latter are obtained on top of the usual Monte Carlo sampling by partitioning the physical space in several subspaces or fragments, and subsampling each fragment (i.e., performing side walks) while freezing the environment. No bias is introduced and a zero-variance principle holds in the limit of separability, i.e., when the fragments are independent. In practice, the usual bottleneck of Monte Carlo calculations-the scaling of the statistical fluctuations as a function of the number of particles N-is relieved for extensive observables. We illustrate the method in variational Monte Carlo on the two-dimensional Hubbard model and on metallic hydrogen chains using Jastrow-Slater wave functions. A factor O(N) is gained in numerical efficiency.

arXiv:2205.00677•Physical review. E•Aug 1, 2022•2 citations

Linear-Scaling Quantum Monte Carlo Calculations

Andrew Williamson, Randolph Q. Hood, Jeffrey C. Grossman

A method is presented for using truncated, maximally localized Wannier functions to introduce sparsity into the Slater determinant part of the trial wave function in quantum Monte Carlo calculations. When combined with an efficient numerical evaluation of these localized orbitals, the dominant cost in the calculation, namely, the evaluation of the Slater determinant, scales linearly with system size. This technique is applied to accurate total energy calculation of hydrogenated silicon clusters and carbon fullerenes containing 20-1000 valence electrons.

Physical Review Letters•Nov 26, 2001•157 citations
We propose a Monte Carlo method which exploits that core regions are physically independent in a molecule to almost remove their contribution to the numerical cost. The method is tantamount to computing an effective core potential on the fly, by efficiently subsampling the core regions with independent sidewalks. The removal of fluctuations in the core region enables also the dynamic in the valence region to be accelerated using a process with two time steps. As a function of the total number of electrons N the numerical overhead O ( N ) is negligible in comparison to the overall scaling O ( N 3 ) (due to the evaluation of determinants). Tests are presented on atoms, alkane chains, and clusters of silicons. We report a transferability of the parameters of the method from atoms to molecules, enabling a calibration using only single atoms. These tests display a gain in numerical efficiency between one and two orders of magnitude for large N .
We propose a method to remove the large statistical fluctuations coming from the core regions when applying an all-electron Variational Monte Carlo method to a molecule. It is based on an efficient subsampling approach which performs sidewalks in these regions. The gain in variance is displayed for a series of atoms and we show that this gain is transferable to molecules on alkane chains and clusters of silicon. For these systems the gain in numerical efficiency is presented, and can be extrapolated to ∼ 22 and ∼ 420 for larger systems when computing the variational energy with a Slater determinant. These results are a proof of concept for numerically affordable all-electron quantum Monte Carlo calculations on molecules with large atomic charges.
In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that by appropriately screening the one- and two-electron integrals of the Hamiltonian one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the resulting algorithm scales as the second power of the system size O(N2)O(N^2)O(N2), down from the fourth power O(N4)O(N^4)O(N4). Using numerical results, we demonstrate that the practical scaling obtained is in fact O(N1.5)O(N^{1.5})O(N1.5) for a chain of Hydrogen atoms, and O(N1.2)O(N^{1.2})O(N1.2) for the Hubbard model. Second, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. CTMC is usually prohibitively expensive because of the need to calculate a large number of intermediates. Here, we take advantage of the fact that these intermediates are already calculated during the evaluation of the local energy and consequently, just by storing them one can use the CTCM algorithm with virtually no overhead. Third, we show that by using the adaptive stochastic gradient descent algorithm called AMSGrad one can optimize the wavefunction energies robustly and efficiently. The combination of these three improvements allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wavefunction containing ∼2×105\sim 2\times 10^5∼2×105 variational parameters with an accuracy of 1 mEhmE_hmEh​/particle at a cost of just 25 CPU hours, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wavefunctions, represents a highly effective method for calculating the electronic structure of model and \emph{ab initio} systems.
The Z6 scaling of computational effort in quantum Monte Carlo (QMC) results in part from a type of critical slowing down. This insight leads to an attack based on acceleration algorithms which modify the dynamics in Langevin-based simulations without changing the steady-state. Configuration space is more rapidly sampled and steps are inherently more decorrelated. A second approach uses a hybrid Metropolis–Green function Monte Carlo method which factors the core and valence wave function, and treats the former variationally with accurate trial functions, and the latter exactly in the presence of the variationally evoling core. This allows separation of the relevant core and valence time scales, and has sped up quantum simulations by over three orders of magnitude.
In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that, by appropriately screening the one- and two-electron integrals of the Hamiltonian, one can improve the efficiency of the algorithm by several orders of magnitude. This improved efficiency comes with the added benefit that the cost of obtaining a constant error per electron scales as the second power of the system size O ( N 2 ), down from the fourth power O ( N 4 ). Using numerical results, we demonstrate that the practical scaling obtained is, in fact, O ( N 1.5 ) for a chain of hydrogen atoms. Second, we show that, by using the adaptive stochastic gradient descent algorithm called AMSGrad, one can optimize the wave function energies robustly and efficiently. Remarkably, AMSGrad is almost as inexpensive as the simple stochastic gradient descent but delivers a convergence rate that is comparable to that of the Stochastic Reconfiguration algorithm, which is significantly more expensive and has a worse scaling with the system size. Third, we introduce the use of the rejection-free continuous time Monte Carlo (CTMC) to sample the determinants. Unlike the first two improvements, CTMC does come at an overhead that the local energy must be calculated at every Monte Carlo step. However, this overhead is mitigated to a large extent because of the reduced scaling algorithm, which ensures that the asymptotic cost of calculating the local energy is equal to that of updating the walker. The resulting algorithm allows us to calculate the ground state energy of a chain of 160 hydrogen atoms using a wave function containing ∼2 × 10 5 variational parameters with an accuracy of 1 mE h /particle at a cost of just 25 CPU h, which when split over 2 nodes of 24 processors each amounts to only about half hour of wall time. This low cost coupled with embarrassing parallelizability of the VMC algorithm and great freedom in the forms of usable wave functions, represents a highly effective method for calculating the electronic structure of model and ab initio systems.
We propose to compute physical properties by Monte Carlo calculations using conditional expectation values. The latter are obtained on top of the usual Monte Carlo sampling by partitioning the physical space in several subspaces or fragments, and subsampling each fragment (i.e., performing side walks) while freezing the environment. No bias is introduced and a zero-variance principle holds in the limit of separability, i.e., when the fragments are independent. In practice, the usual bottleneck of Monte Carlo calculations-the scaling of the statistical fluctuations as a function of the number of particles N-is relieved for extensive observables. We illustrate the method in variational Monte Carlo on the two-dimensional Hubbard model and on metallic hydrogen chains using Jastrow-Slater wave functions. A factor O(N) is gained in numerical efficiency.
A method is presented for using truncated, maximally localized Wannier functions to introduce sparsity into the Slater determinant part of the trial wave function in quantum Monte Carlo calculations. When combined with an efficient numerical evaluation of these localized orbitals, the dominant cost in the calculation, namely, the evaluation of the Slater determinant, scales linearly with system size. This technique is applied to accurate total energy calculation of hydrogenated silicon clusters and carbon fullerenes containing 20-1000 valence electrons.