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

arXiv:0906.4354 · The Journal of Chemical Physics

A fast and efficient algorithm for Slater determinant updates in quantum Monte Carlo simulations

Phani K. V. V. Nukala, Paul R. C. Kent

Published May 28, 2009• 31 citations
arXivHTMLPDF

Abstract

We present an efficient low-rank updating algorithm for updating the trial wave functions used in quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational complexity of the algorithm is O(kN) during the kth step compared to traditional algorithms that require O(N(2)) computations, where N is the system size. For single determinant trial wave functions the new algorithm is faster than the traditional O(N(2)) Sherman-Morrison algorithm for up to O(N) updates. For multideterminant configuration-interaction-type trial wave functions of M+1 determinants, the new algorithm is significantly more efficient, saving both O(MN(2)) work and O(MN(2)) storage. The algorithm enables more accurate and significantly more efficient QMC calculations using configuration-interaction-type wave functions.

DOI
10.1063/1.3142703

Related papers

A High-Efficiency Delayed Update Algorithm for Evaluating Slater Determinants in Quantum Monte Carlo

Ye Luo, Jeongnim Kim, Paul R. C. Kent

For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [ J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. In this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.

Journal of Chemical Theory and Computation•Dec 1, 2025•0 citations

Computing the energy of a water molecule using multideterminants: A simple, efficient algorithm

Bryan K. Clark, Miguel A. Morales, Jeremy McMinis +2 more

Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.

arXiv:1106.2456•The Journal of Chemical Physics•Dec 27, 2011•71 citations

Optimization of Large Determinant Expansions in Quantum Monte Carlo

Abdallah Ammar, Emmanuel Giner, Anthony Scemama

We present a new method for the optimization of large configuration interaction (CI) expansions in the quantum Monte Carlo (QMC) framework. The central idea here is to replace the nonorthogonal variational optimization of CI coefficients performed in usual QMC calculations by an orthogonal non-Hermitian optimization thanks to the so-called transcorrelated (TC) framework, the two methods yielding the same results in the limit of a complete basis set. By rewriting the TC equations as an effective self-consistent Hermitian problem, our approach requires the sampling of a single quantity per Slater determinant, leading to minimal memory requirements in the QMC code. Using analytical quantities obtained from both the TC framework and the usual CI-type calculations, we also propose improved estimators which reduce the statistical fluctuations of the sampled quantities by more than an order of magnitude. We demonstrate the efficiency of this method on wave functions containing 10 5 –10 6 Slater determinants, using effective core potentials or all-electron calculations. In all the cases, a sub-milli-Hartree convergence is reached within only two or three iterations of optimization.

arXiv:2205.12851•Journal of Chemical Theory and Computation•Aug 23, 2022•12 citations

Fast update algorithm for the quantum Monte Carlo simulation of the Hubbard model

Phani K. V. V. Nukala, Thomas Maier, Michael S. Summers +2 more

This paper presents an efficient algorithm for computing the transition probability in auxiliary field quantum Monte Carlo simulations of strongly correlated electron systems using a Hubbard model. This algorithm is based on a low rank updating of the underlying linear algebra problem, and results in significant computational savings. The computational complexity of computing the transition probability and Green's function update reduces to $\mathcal{O}({k}^{2})$ during the $k\text{th}$ step, where $k$ is the number of accepted spin flips, and results in an algorithm that is faster than the competing delayed update algorithm. Moreover, this algorithm is orders of magnitude faster than traditional algorithms that use naive updating of the Green's function matrix.

Physical Review B•Nov 17, 2009•29 citations

Computing the energy of a water molecule using MultiDeterminants: A simple, efficient algorithm

Clark, B K, Morales, M A, McMinis, J +2 more

Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.

•May 3, 2011•60 citations

Influence of single particle orbital sets and configuration selection on multideterminant wavefunctions in quantum Monte Carlo

Raymond C. Clay, Miguel A. Morales

Multideterminant wavefunctions, while having a long history in quantum chemistry, are increasingly being used in highly accurate quantum Monte Carlo calculations. Since the accuracy of QMC is ultimately limited by the quality of the trial wavefunction, multi-Slater determinants wavefunctions offer an attractive alternative to Slater-Jastrow and more sophisticated wavefunction ansatz for several reasons. They can be efficiently calculated, straightforwardly optimized, and systematically improved by increasing the number of included determinants. In spite of their potential, however, the convergence properties of multi-Slater determinant wavefunctions with respect to orbital set choice and excited determinant selection are poorly understood, which hinders the application of these wavefunctions to large systems and solids. In this paper, by performing QMC calculations on the equilibrium and stretched carbon dimer, we find that convergence of the recovered correlation energy with respect to number of determinants can depend quite strongly on basis set and determinant selection methods, especially where there is strong correlation. We demonstrate that properly chosen orbital sets and determinant selection techniques from quantum chemistry methods can dramatically reduce the required number of determinants (and thus the computational cost) to reach a given accuracy, which we argue shows clear need for an automatic QMC-only method for selecting determinants and generating optimal orbital sets.

The Journal of Chemical Physics•Jun 16, 2015•23 citations
We present an efficient low-rank updating algorithm for updating the trial wave functions used in quantum Monte Carlo (QMC) simulations. The algorithm is based on low-rank updating of the Slater determinants. In particular, the computational complexity of the algorithm is O(kN) during the kth step compared to traditional algorithms that require O(N(2)) computations, where N is the system size. For single determinant trial wave functions the new algorithm is faster than the traditional O(N(2)) Sherman-Morrison algorithm for up to O(N) updates. For multideterminant configuration-interaction-type trial wave functions of M+1 determinants, the new algorithm is significantly more efficient, saving both O(MN(2)) work and O(MN(2)) storage. The algorithm enables more accurate and significantly more efficient QMC calculations using configuration-interaction-type wave functions.
For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [ J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. In this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.
Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.
We present a new method for the optimization of large configuration interaction (CI) expansions in the quantum Monte Carlo (QMC) framework. The central idea here is to replace the nonorthogonal variational optimization of CI coefficients performed in usual QMC calculations by an orthogonal non-Hermitian optimization thanks to the so-called transcorrelated (TC) framework, the two methods yielding the same results in the limit of a complete basis set. By rewriting the TC equations as an effective self-consistent Hermitian problem, our approach requires the sampling of a single quantity per Slater determinant, leading to minimal memory requirements in the QMC code. Using analytical quantities obtained from both the TC framework and the usual CI-type calculations, we also propose improved estimators which reduce the statistical fluctuations of the sampled quantities by more than an order of magnitude. We demonstrate the efficiency of this method on wave functions containing 10 5 –10 6 Slater determinants, using effective core potentials or all-electron calculations. In all the cases, a sub-milli-Hartree convergence is reached within only two or three iterations of optimization.
This paper presents an efficient algorithm for computing the transition probability in auxiliary field quantum Monte Carlo simulations of strongly correlated electron systems using a Hubbard model. This algorithm is based on a low rank updating of the underlying linear algebra problem, and results in significant computational savings. The computational complexity of computing the transition probability and Green's function update reduces to O(k2)\mathcal{O}({k}^{2})O(k2) during the kthk\text{th}kth step, where kkk is the number of accepted spin flips, and results in an algorithm that is faster than the competing delayed update algorithm. Moreover, this algorithm is orders of magnitude faster than traditional algorithms that use naive updating of the Green's function matrix.
Quantum Monte Carlo (QMC) methods such as variational Monte Carlo and fixed node diffusion Monte Carlo depend heavily on the quality of the trial wave function. Although Slater-Jastrow wave functions are the most commonly used variational ansatz in electronic structure, more sophisticated wave functions are critical to ascertaining new physics. One such wave function is the multi-Slater-Jastrow wave function which consists of a Jastrow function multiplied by the sum of Slater determinants. In this paper we describe a method for working with these wave functions in QMC codes that is easy to implement, efficient both in computational speed as well as memory, and easily parallelized. The computational cost scales quadratically with particle number making this scaling no worse than the single determinant case and linear with the total number of excitations. Additionally, we implement this method and use it to compute the ground state energy of a water molecule.
Multideterminant wavefunctions, while having a long history in quantum chemistry, are increasingly being used in highly accurate quantum Monte Carlo calculations. Since the accuracy of QMC is ultimately limited by the quality of the trial wavefunction, multi-Slater determinants wavefunctions offer an attractive alternative to Slater-Jastrow and more sophisticated wavefunction ansatz for several reasons. They can be efficiently calculated, straightforwardly optimized, and systematically improved by increasing the number of included determinants. In spite of their potential, however, the convergence properties of multi-Slater determinant wavefunctions with respect to orbital set choice and excited determinant selection are poorly understood, which hinders the application of these wavefunctions to large systems and solids. In this paper, by performing QMC calculations on the equilibrium and stretched carbon dimer, we find that convergence of the recovered correlation energy with respect to number of determinants can depend quite strongly on basis set and determinant selection methods, especially where there is strong correlation. We demonstrate that properly chosen orbital sets and determinant selection techniques from quantum chemistry methods can dramatically reduce the required number of determinants (and thus the computational cost) to reach a given accuracy, which we argue shows clear need for an automatic QMC-only method for selecting determinants and generating optimal orbital sets.