{'fraction_non_alphanumeric': 0.02473299606520517, 'fraction_numerical': 0.007307476110174255, 'mean_word_length': 5.768060836501901, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Quantum Monte Carlo with very large multideterminant wavefunctions

An algorithm to compute efficiently the first two derivatives of (very) large multideterminant wavefunctions for quantum Monte Carlo calculations is presented. The calculation of determinants and their derivatives is performed using the Sherman–Morrison formula for updating the inverse Slater matrix. An improved implementation based on the reduction of the number of column substitutions and on a very efficient implementation of the calculation of the scalar products involved is presented. It is emphasized that multideterminant expansions contain in general a large number of identical spin‐specific determinants: for typical configuration interaction‐type wavefunctions the number of unique spin‐specific determinants Ndetσ ( σ=↑,↓ ) with a non‐negligible weight in the expansion is of order O(Ndet) . We show that a careful implementation of the calculation of the Ndet ‐dependent contributions can make this step negligible enough so that in practice the algorithm scales as the total number of unique spin‐specific determinants,  Ndet↑+Ndet↓ , over a wide range of total number of determinants (here, Ndet up to about one million), thus greatly reducing the total computational cost. Finally, a new truncation scheme for the multideterminant expansion is proposed so that larger expansions can be considered without increasing the computational time. The algorithm is illustrated with all‐electron fixed‐node diffusion Monte Carlo calculations of the total energy of the chlorine atom. Calculations using a trial wavefunction including about 750,000 determinants with a computational increase of ∼400 compared to a single‐determinant calculation are shown to be feasible. © 2016 Wiley Periodicals, Inc.