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

Designing algorithms for improving quantum chemical calculations

Aisha ElSherbiny

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

This work involves studying and developing new algorithms for molecular numerical integration used for density functional theory and new algorithms for Hartree-Fock method. -- New insight about molecular numerical integration is presented through a detailed study of the performance of some of the well known grids in addition to our implementation of the most recently developed MultiExp grid. A comprehensive study of numerical integration was conducted by evaluating several molecular properties: number of electrons, dipole moment, potential energy, and Coulomb repulsion energy using fifteen grids including a large benchmark grid. The standard grid (SG-1) and a slightly modified version of the Treutler and Alhrichs (TA) grid performed reasonably well. The MultiExp grid, which is more efficient, was studied as well and found to be less accurate. -- Studying large molecules using Hartree-Fock method is a challenge both in terms of CPU time and memory requirements. However, there is a high demand to perform quantum chemical calculations for large molecules. Projection from a smaller basis set to a larger basis set was studied in detail. It was found that projection from the STO-3G basis set to the 6-31G basis set performed well. Projection was used to develop a new version of a divide and conquer algorithm. Our divide and conquer algorithm was used to calculate the protonation energy for a series of peptides. Algorithms to skip calculating two-electron integrals of zero or negligible values are presented in addition to an algorithm to generate a better initial guess.

Related papers

Development of Efficient Algorithms for Quantum Chemistry Calculations of Large Molecules

和也 石村, カズヤ イシムラ, Kazuya Ishimura

Quantum chemistry plays an important role in elucidating molecular geometries, electronic states, and reaction mechanisms, because of the developments of a variety of theoretical methods, such as Hartree-Fock (HF), Møler-Plesset (MP) perturbation, configuration interaction (CI), coupled-cluster (CC), and density functional theory (DFT) methods. Electronic structure calculations have been carried out by not only theoretical chemists but also experimental chemists. DFT is currently most widely used to investigate large molecules in the ground state as well as small molecules because of the low computational cost. However, the generally used functionals fail to describe correctly non-covalent interactions that are important for host-guest molecules, self-assembly, and molecular recognition, and they tend to underestimate reaction barriers. Many attempts have been made to develop new functionals and add semiempirical or empirical correction terms to standard functionals, but no generally accepted DFT method has emerged yet. Second-order Møler-Plesset perturbation theory (MP2) is the simplest method that includes electron correlation important for non-covalent interactions and reaction barriers nonempirically. However, the computational cost of MP2 is considerably higher than that of DFT. In addition, much larger sizes of fast memory and hard disk are required in MP2 calculations. These make MP2 calculations increasingly difficult for larger molecules. Since workstation or personal computer (PC) clusters have become popular for quantum chemistry calculations, an efficient parallel calculation is a solution of the problem. Therefore, new parallel algorithms for MP2 energy and gradient calculations are presented in this thesis. Furthermore, an efficient algorithm for the generation of two-electron repulsion integrals (ERIs) which is important in quantum chemistry calculations is also presented. For the calculations of excited states, different approaches are required: for example, CI, multi-configuration self-consistent field (MCSCF), time-dependent DFT (TDDFT), and symmetry adapted cluster (SAC)/SAC-CI methods. One of the most accurate methods is SAC/SAC-CI, as demonstrated for many molecules. In this thesis, SAC/SAC-CI calculations of ground, ionized, and excited states are presented. This thesis consists of five chapters: a new algorithm of two-electron repulsion integral calculations (Chapter I), a new parallel algorithm of MP2 energy calculations (Chapter II), a new parallel algorithm of MP2 energy gradient calculations (Chapter III), applications of MP2 calculations (Chapter IV), and SAC/SAC-CI calculations of ionized and excited states (Chapter V). In quantum chemistry calculations, the generation of ERIs is one of the most basic subjects and is the most time-consuming step especially in direct SCF calculations. Many algorithms have been developed to reduce the computational cost. In Pople-Hehre algorithm, Cartesian axes are rotated to make several coordinate components zero or constant, so that these components are skipped in the generation of ERIs. In McMurchie-Davidson algorithm, ERIs are generated from (ss|ss) type integrals using a recurrence relation derived from Hermite polynomials. By combining these two algorithms, a new algorithm is developed in Chapter I. The results show that the new algorithm reduces the computational cost by 10 - 40%, as compared with the original algorithms. It is notable that the generation of ERIs including d functions is considerably fast. The program implemented officially in GAMESS in 2004 has been used all over the world. In quantum mechanics, perturbation methods can be used for adding corrections to reference solutions. In the MP perturbation method, a sum over Fock operators is used as the reference term, and the exact two-electron repulsion operator minus twice the average two-electron repulsion operator is used as the perturbation term. It is the advantage that the MP perturbation method is size consistent and size extensive, unlike truncated CI methods. The zero-order wave function is the HF Slater determinant, and the zero-order energy is expressed as a sum of occupied molecular orbital (MO) energies. The first-order perturbation is the correction for the overcounting of two-electron repulsions at zero-order, and the first-order energy corresponds to the HF energy. The MP correlation starts at second-order. In general, second-order (MP2) accounts for 80 - 90% of electron correlation. Therefore, MP2 is focused in this thesis since it is applicable to large molecules with considerable reliability and low computational cost. The formal computational scaling of MP2 energy calculations with respect to molecular size is fifth order, much higher than that of DFT energy calculations. Therefore, less expensive methods, such as Local MP2, density fitting (resolution of identity, RI) MP2, and Laplace Transform MP2, have been developed. However, all of these methods include approximations or cut-offs that need to be checked against full MP2 energies. An alternative approach to reduce the computational cost is to parallelize MP2 energy calculations. A number of papers on parallel MP2 energy calculations have been published. Almost all of them are based on simple parallelization methods that distribute only atomic orbital (AO) or MO indices to each processor. These methods have a disadvantage since intermediate integrals are broadcasted to all CPUs or the same AO ERIs are generated in all processors. Baker and Pulay developed a new parallel algorithm using SaebøAlmlöf integral transformation method. This algorithm parallelizes the first half transformation by AO indices and the second half transformation by MO indices. The advantages are that the total amount of network communication is independent of the number of processors and the AO integrals are generated only once. The disadvantage is the I/O overhead for the sorting of half-transformed integrals. A new parallel algorithm for MP2 energy calculations based on the two-step parallelization idea is presented in Chapter II. In this algorithm, AO indices are distributed in the AO integral generation and the first three quarter transformation, and MO indices are distributed in the last quarter transformation and MP2 energy calculation. Because the algorithm makes the sorting of intermediate integrals very simple, the parallel efficiency is highly improved and the I/O overhead is removed. Furthermore, the algorithm reduces highly the floating point operation (FLOP) count as well as the required memory and hard disk space, in comparison with other algorithms. Test calculations of taxol (C47H51NO14) and luciferin (C11H8N2O3S2) were performed on a cluster of Pentium 4 computers connected by gigabit Ethernet. The parallel scaling of the developed code is excellent up to the largest number of processors we have tested. For instance, the elapsed time for the MP2 energy calculations on 16 processors is on average 15.4 times faster than that on the single-processor. Determination of molecular geometries and reaction paths is a fundamental task in quantum chemistry and requires energy gradients with respect to nuclear coordinates. In Chapter III, a new parallel algorithm for MP2 energy gradient calculations is presented. The algorithm consists of 5 steps, the integral transformation, the MP2 amplitude calculation, the MP2 Lagrangian calculation, the coupled-perturbed HF calculation, and the integral derivative calculation. All steps are parallelized by distributing AO or MO indices. The algorithm also reduces the FLOP count, the required memory, and hard disk space. Test calculations of MP2 energy gradients were performed for taxol and luciferin on a cluster of Pentium 4 computers. The speedups are very good up to 80 CPU cores we have tested. For instance, the speedup ratios are 28.2 - 33.0 on 32 processors, corresponding to 88% - 103% of linear speedup. This indicates the high parallel efficiency of the present algorithm. The calculation of taxol with 6-31G(d) (1032 contracted basis functions) finishes within 2 hours on 32 processors, which requires only 1.8GB memory and 13.4GB hard disk per processor. Therefore, geometry optimization of molecules with 1000 basis functions can be easily performed using standard PC clusters. In Chapter IV, several applications of MP2 are performed using the program developed in Chapters II and III. Some molecules that DFT cannot treat well are optimized at the MP2 level. Geometry optimization is also carried out using the spin-component scaled (SCS) MP2 method. In this method, a different scaling is employed for the same and opposite spin components of the MP2 energy, so that SCS-MP2 performs as well as the much more costly CCSD(T) method at a high level of theory. SAC theory is developed for ground states and based on CC theory that describes higher-order electron correlation. The main factor of electron correlation is collisions of two electrons. In CC theory, most collisions of four electrons can be taken in as the product of collisions of tw

•Sep 28, 2007•0 citations

Efficient Evaluation of Coulomb Interactions for Large-Scale Quantum Chemistry

Rui Li

Evaluating the Coulomb interaction remains a fundamental computational bottleneck in electronic structure theory, dictating the scaling and efficiency of quantum chemical simulations. While recent advancements in graphics processing units (GPUs) offer immense theoretical peak performance, translating traditional, memory-intensive CPU algorithms for evaluating electron repulsion integrals to GPU architectures presents significant challenges due to memory bandwidth limitations and warp divergence. This thesis presents the development of algorithms to efficiently evaluate Coulomb interactions across diverse chemical systems. Chapter 2 describes the GPU implementation of Coulomb interaction for molecular systems at Hartree-Fock level of theory. Chapter 3 shows how multigrid Gaussian-Plane-Wave algorithm can better utilize GPU compute performance by a two-level parallelization scheme and grid-based screening of orbital pairs in the real space. Chapter 4 illustrates the issues of the original modified Coulomb potential from GFN-xTB in periodic systems, and the effectiveness of a new generalized Ewald summation scheme for the potential in X23 molecular crystal dataset and a range of prototypical bulk semiconductors.

•May 14, 2026•0 citations

Benchmark all-electron ab initio quantum Monte Carlo calculations for small molecules

Norbert Nemec, Michael D. Towler, Richard J. Needs

We study the efficiency, precision and accuracy of all-electron variational and diffusion quantum Monte Carlo calculations using Slater basis sets. Starting from wave functions generated by Hartree-Fock and density functional theory, we describe an algorithm to enforce the electron-nucleus cusp condition by linear projection. For the 55 molecules in the G2 set, the diffusion quantum Monte Carlo calculations recovers an average of 95% of the correlation energy and reproduces bond energies to a mean absolute deviation of 3.2 kcal/mol. Comparing the individual total energies with essentially exact values, we investigate the error cancellation in atomization and chemical reaction path energies, giving additional insight into the sizes of nodal surface errors.

arXiv:0908.2041•The Journal of Chemical Physics•Jan 21, 2010•82 citations

Tensor numerical methods in quantum chemistry: from Hartree–Fock to excitation energies

Venera Khoromskaia, Boris N. Khoromskij

We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely grid-based tensor-structured 3D Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core Hamiltonian and two-electron integrals (TEI) in O(n log n) complexity using the rank-structured approximation of basis functions, electron densities and convolution integral operators all represented on 3D n × n × n Cartesian grids. The algorithm for calculating TEI tensor in a form of the Cholesky decomposition is based on multiple factorizations using algebraic 1D "density fitting" scheme, which yield an almost irreducible number of product basis functions involved in the 3D convolution integrals, depending on a threshold ε > 0. The basis functions are not restricted to separable Gaussians, since the analytical integration is substituted by high-precision tensor-structured numerical quadratures. The tensor approaches to post-Hartree-Fock calculations for the MP2 energy correction and for the Bethe-Salpeter excitation energies, based on using low-rank factorizations and the reduced basis method, were recently introduced. Another direction is towards the tensor-based Hartree-Fock numerical scheme for finite lattices, where one of the numerical challenges is the summation of electrostatic potentials of a large number of nuclei. The 3D grid-based tensor method for calculation of a potential sum on a L × L × L lattice manifests the linear in L computational work, O(L), instead of the usual O(L(3) log L) scaling by the Ewald-type approaches.

arXiv:1504.06289•Physical Chemistry Chemical Physics•Jan 1, 2015•71 citations

Better accuracy with fewer qubits: Single-particle basis set optimization for quantum chemistry on quantum computers

Subimal Deb, V. S. Prasannaa

In spite of recent advances, quantum computers are expected to be sufficiently noisy in the coming few years to the extent of limiting quantum chemical calculations to relatively small number of orbitals. However, even with reasonable quality single particle basis sets, small active spaces with limited orbitals can result in a significant fraction of correlation energy being lost, motivating the design of moderate quality qubit-efficient basis sets for quantum algorithms. We begin by reoptimizing the existing minimal basis sets using a genetic algorithm-inspired approach in conjunction with aggressive refinement strategies, and generate modified minimal basis sets (MSTO-kG basis; k = 2-11) for atoms from H through F. The ground state energies of H through F using our MSTO bases at FCI level of theory yield ground state energies that are comparable or sometimes even lower than those obtained using 6-31G basis sets. In the case of Li, the MSTO bases surpass the performance of cc-pVQZ bases. Thus, we obtain better atomic energies with same number of qubits relative to STO bases, and better/comparable energies with fewer qubits relative to higher quality bases. In the case of molecules, H2 performs poorly; a finding that is consistent with an earlier work in literature. For other molecules, Li2, C2, LiH, BeH and BeH2, the FCI results (except C2 for which we employ CISD) from our bases are comparable to/outperform those from 6-31G basis. Finally, we compare the resources required between different bases and find that MSTO bases yield better energies than the competing basis sets while incurring fewer qubits and two-qubit gates with VQE, QPE, and HHL. The logical T-gate counts are also found to be considerably lower for QPE and HHL respectively. Overall, our work paves way for more accurate yet less qubit-hungry quantum chemical calculations using near-term quantum computers.

quant-pharXiv:2608.02119•Aug 4, 2026•1 citation

Quantum Chemistry on Graphical Processing Units. 1. Strategies for Two-Electron Integral Evaluation

Ivan S. Ufimtsev, Todd J. Martínez

Modern videogames place increasing demands on the computational and graphical hardware, leading to novel architectures that have great potential in the context of high performance computing and molecular simulation. We demonstrate that Graphical Processing Units (GPUs) can be used very efficiently to calculate two-electron repulsion integrals over Gaussian basis functions [Formula: see text] the first step in most quantum chemistry calculations. A benchmark test performed for the evaluation of approximately 10(6) (ss|ss) integrals over contracted s-orbitals showed that a naïve algorithm implemented on the GPU achieves up to 130-fold speedup over a traditional CPU implementation on an AMD Opteron. Subsequent calculations of the Coulomb operator for a 256-atom DNA strand show that the GPU advantage is maintained for basis sets including higher angular momentum functions.

Journal of Chemical Theory and Computation•Jan 25, 2008•615 citations
This work involves studying and developing new algorithms for molecular numerical integration used for density functional theory and new algorithms for Hartree-Fock method. -- New insight about molecular numerical integration is presented through a detailed study of the performance of some of the well known grids in addition to our implementation of the most recently developed MultiExp grid. A comprehensive study of numerical integration was conducted by evaluating several molecular properties: number of electrons, dipole moment, potential energy, and Coulomb repulsion energy using fifteen grids including a large benchmark grid. The standard grid (SG-1) and a slightly modified version of the Treutler and Alhrichs (TA) grid performed reasonably well. The MultiExp grid, which is more efficient, was studied as well and found to be less accurate. -- Studying large molecules using Hartree-Fock method is a challenge both in terms of CPU time and memory requirements. However, there is a high demand to perform quantum chemical calculations for large molecules. Projection from a smaller basis set to a larger basis set was studied in detail. It was found that projection from the STO-3G basis set to the 6-31G basis set performed well. Projection was used to develop a new version of a divide and conquer algorithm. Our divide and conquer algorithm was used to calculate the protonation energy for a series of peptides. Algorithms to skip calculating two-electron integrals of zero or negligible values are presented in addition to an algorithm to generate a better initial guess.
Quantum chemistry plays an important role in elucidating molecular geometries, electronic states, and reaction mechanisms, because of the developments of a variety of theoretical methods, such as Hartree-Fock (HF), Møler-Plesset (MP) perturbation, configuration interaction (CI), coupled-cluster (CC), and density functional theory (DFT) methods. Electronic structure calculations have been carried out by not only theoretical chemists but also experimental chemists. DFT is currently most widely used to investigate large molecules in the ground state as well as small molecules because of the low computational cost. However, the generally used functionals fail to describe correctly non-covalent interactions that are important for host-guest molecules, self-assembly, and molecular recognition, and they tend to underestimate reaction barriers. Many attempts have been made to develop new functionals and add semiempirical or empirical correction terms to standard functionals, but no generally accepted DFT method has emerged yet. Second-order Møler-Plesset perturbation theory (MP2) is the simplest method that includes electron correlation important for non-covalent interactions and reaction barriers nonempirically. However, the computational cost of MP2 is considerably higher than that of DFT. In addition, much larger sizes of fast memory and hard disk are required in MP2 calculations. These make MP2 calculations increasingly difficult for larger molecules. Since workstation or personal computer (PC) clusters have become popular for quantum chemistry calculations, an efficient parallel calculation is a solution of the problem. Therefore, new parallel algorithms for MP2 energy and gradient calculations are presented in this thesis. Furthermore, an efficient algorithm for the generation of two-electron repulsion integrals (ERIs) which is important in quantum chemistry calculations is also presented. For the calculations of excited states, different approaches are required: for example, CI, multi-configuration self-consistent field (MCSCF), time-dependent DFT (TDDFT), and symmetry adapted cluster (SAC)/SAC-CI methods. One of the most accurate methods is SAC/SAC-CI, as demonstrated for many molecules. In this thesis, SAC/SAC-CI calculations of ground, ionized, and excited states are presented. This thesis consists of five chapters: a new algorithm of two-electron repulsion integral calculations (Chapter I), a new parallel algorithm of MP2 energy calculations (Chapter II), a new parallel algorithm of MP2 energy gradient calculations (Chapter III), applications of MP2 calculations (Chapter IV), and SAC/SAC-CI calculations of ionized and excited states (Chapter V). In quantum chemistry calculations, the generation of ERIs is one of the most basic subjects and is the most time-consuming step especially in direct SCF calculations. Many algorithms have been developed to reduce the computational cost. In Pople-Hehre algorithm, Cartesian axes are rotated to make several coordinate components zero or constant, so that these components are skipped in the generation of ERIs. In McMurchie-Davidson algorithm, ERIs are generated from (ss|ss) type integrals using a recurrence relation derived from Hermite polynomials. By combining these two algorithms, a new algorithm is developed in Chapter I. The results show that the new algorithm reduces the computational cost by 10 - 40%, as compared with the original algorithms. It is notable that the generation of ERIs including d functions is considerably fast. The program implemented officially in GAMESS in 2004 has been used all over the world. In quantum mechanics, perturbation methods can be used for adding corrections to reference solutions. In the MP perturbation method, a sum over Fock operators is used as the reference term, and the exact two-electron repulsion operator minus twice the average two-electron repulsion operator is used as the perturbation term. It is the advantage that the MP perturbation method is size consistent and size extensive, unlike truncated CI methods. The zero-order wave function is the HF Slater determinant, and the zero-order energy is expressed as a sum of occupied molecular orbital (MO) energies. The first-order perturbation is the correction for the overcounting of two-electron repulsions at zero-order, and the first-order energy corresponds to the HF energy. The MP correlation starts at second-order. In general, second-order (MP2) accounts for 80 - 90% of electron correlation. Therefore, MP2 is focused in this thesis since it is applicable to large molecules with considerable reliability and low computational cost. The formal computational scaling of MP2 energy calculations with respect to molecular size is fifth order, much higher than that of DFT energy calculations. Therefore, less expensive methods, such as Local MP2, density fitting (resolution of identity, RI) MP2, and Laplace Transform MP2, have been developed. However, all of these methods include approximations or cut-offs that need to be checked against full MP2 energies. An alternative approach to reduce the computational cost is to parallelize MP2 energy calculations. A number of papers on parallel MP2 energy calculations have been published. Almost all of them are based on simple parallelization methods that distribute only atomic orbital (AO) or MO indices to each processor. These methods have a disadvantage since intermediate integrals are broadcasted to all CPUs or the same AO ERIs are generated in all processors. Baker and Pulay developed a new parallel algorithm using SaebøAlmlöf integral transformation method. This algorithm parallelizes the first half transformation by AO indices and the second half transformation by MO indices. The advantages are that the total amount of network communication is independent of the number of processors and the AO integrals are generated only once. The disadvantage is the I/O overhead for the sorting of half-transformed integrals. A new parallel algorithm for MP2 energy calculations based on the two-step parallelization idea is presented in Chapter II. In this algorithm, AO indices are distributed in the AO integral generation and the first three quarter transformation, and MO indices are distributed in the last quarter transformation and MP2 energy calculation. Because the algorithm makes the sorting of intermediate integrals very simple, the parallel efficiency is highly improved and the I/O overhead is removed. Furthermore, the algorithm reduces highly the floating point operation (FLOP) count as well as the required memory and hard disk space, in comparison with other algorithms. Test calculations of taxol (C47H51NO14) and luciferin (C11H8N2O3S2) were performed on a cluster of Pentium 4 computers connected by gigabit Ethernet. The parallel scaling of the developed code is excellent up to the largest number of processors we have tested. For instance, the elapsed time for the MP2 energy calculations on 16 processors is on average 15.4 times faster than that on the single-processor. Determination of molecular geometries and reaction paths is a fundamental task in quantum chemistry and requires energy gradients with respect to nuclear coordinates. In Chapter III, a new parallel algorithm for MP2 energy gradient calculations is presented. The algorithm consists of 5 steps, the integral transformation, the MP2 amplitude calculation, the MP2 Lagrangian calculation, the coupled-perturbed HF calculation, and the integral derivative calculation. All steps are parallelized by distributing AO or MO indices. The algorithm also reduces the FLOP count, the required memory, and hard disk space. Test calculations of MP2 energy gradients were performed for taxol and luciferin on a cluster of Pentium 4 computers. The speedups are very good up to 80 CPU cores we have tested. For instance, the speedup ratios are 28.2 - 33.0 on 32 processors, corresponding to 88% - 103% of linear speedup. This indicates the high parallel efficiency of the present algorithm. The calculation of taxol with 6-31G(d) (1032 contracted basis functions) finishes within 2 hours on 32 processors, which requires only 1.8GB memory and 13.4GB hard disk per processor. Therefore, geometry optimization of molecules with 1000 basis functions can be easily performed using standard PC clusters. In Chapter IV, several applications of MP2 are performed using the program developed in Chapters II and III. Some molecules that DFT cannot treat well are optimized at the MP2 level. Geometry optimization is also carried out using the spin-component scaled (SCS) MP2 method. In this method, a different scaling is employed for the same and opposite spin components of the MP2 energy, so that SCS-MP2 performs as well as the much more costly CCSD(T) method at a high level of theory. SAC theory is developed for ground states and based on CC theory that describes higher-order electron correlation. The main factor of electron correlation is collisions of two electrons. In CC theory, most collisions of four electrons can be taken in as the product of collisions of tw
Evaluating the Coulomb interaction remains a fundamental computational bottleneck in electronic structure theory, dictating the scaling and efficiency of quantum chemical simulations. While recent advancements in graphics processing units (GPUs) offer immense theoretical peak performance, translating traditional, memory-intensive CPU algorithms for evaluating electron repulsion integrals to GPU architectures presents significant challenges due to memory bandwidth limitations and warp divergence. This thesis presents the development of algorithms to efficiently evaluate Coulomb interactions across diverse chemical systems. Chapter 2 describes the GPU implementation of Coulomb interaction for molecular systems at Hartree-Fock level of theory. Chapter 3 shows how multigrid Gaussian-Plane-Wave algorithm can better utilize GPU compute performance by a two-level parallelization scheme and grid-based screening of orbital pairs in the real space. Chapter 4 illustrates the issues of the original modified Coulomb potential from GFN-xTB in periodic systems, and the effectiveness of a new generalized Ewald summation scheme for the potential in X23 molecular crystal dataset and a range of prototypical bulk semiconductors.
We study the efficiency, precision and accuracy of all-electron variational and diffusion quantum Monte Carlo calculations using Slater basis sets. Starting from wave functions generated by Hartree-Fock and density functional theory, we describe an algorithm to enforce the electron-nucleus cusp condition by linear projection. For the 55 molecules in the G2 set, the diffusion quantum Monte Carlo calculations recovers an average of 95% of the correlation energy and reproduces bond energies to a mean absolute deviation of 3.2 kcal/mol. Comparing the individual total energies with essentially exact values, we investigate the error cancellation in atomization and chemical reaction path energies, giving additional insight into the sizes of nodal surface errors.
We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely grid-based tensor-structured 3D Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core Hamiltonian and two-electron integrals (TEI) in O(n log n) complexity using the rank-structured approximation of basis functions, electron densities and convolution integral operators all represented on 3D n × n × n Cartesian grids. The algorithm for calculating TEI tensor in a form of the Cholesky decomposition is based on multiple factorizations using algebraic 1D "density fitting" scheme, which yield an almost irreducible number of product basis functions involved in the 3D convolution integrals, depending on a threshold ε > 0. The basis functions are not restricted to separable Gaussians, since the analytical integration is substituted by high-precision tensor-structured numerical quadratures. The tensor approaches to post-Hartree-Fock calculations for the MP2 energy correction and for the Bethe-Salpeter excitation energies, based on using low-rank factorizations and the reduced basis method, were recently introduced. Another direction is towards the tensor-based Hartree-Fock numerical scheme for finite lattices, where one of the numerical challenges is the summation of electrostatic potentials of a large number of nuclei. The 3D grid-based tensor method for calculation of a potential sum on a L × L × L lattice manifests the linear in L computational work, O(L), instead of the usual O(L(3) log L) scaling by the Ewald-type approaches.
In spite of recent advances, quantum computers are expected to be sufficiently noisy in the coming few years to the extent of limiting quantum chemical calculations to relatively small number of orbitals. However, even with reasonable quality single particle basis sets, small active spaces with limited orbitals can result in a significant fraction of correlation energy being lost, motivating the design of moderate quality qubit-efficient basis sets for quantum algorithms. We begin by reoptimizing the existing minimal basis sets using a genetic algorithm-inspired approach in conjunction with aggressive refinement strategies, and generate modified minimal basis sets (MSTO-kG basis; k = 2-11) for atoms from H through F. The ground state energies of H through F using our MSTO bases at FCI level of theory yield ground state energies that are comparable or sometimes even lower than those obtained using 6-31G basis sets. In the case of Li, the MSTO bases surpass the performance of cc-pVQZ bases. Thus, we obtain better atomic energies with same number of qubits relative to STO bases, and better/comparable energies with fewer qubits relative to higher quality bases. In the case of molecules, H2 performs poorly; a finding that is consistent with an earlier work in literature. For other molecules, Li2, C2, LiH, BeH and BeH2, the FCI results (except C2 for which we employ CISD) from our bases are comparable to/outperform those from 6-31G basis. Finally, we compare the resources required between different bases and find that MSTO bases yield better energies than the competing basis sets while incurring fewer qubits and two-qubit gates with VQE, QPE, and HHL. The logical T-gate counts are also found to be considerably lower for QPE and HHL respectively. Overall, our work paves way for more accurate yet less qubit-hungry quantum chemical calculations using near-term quantum computers.
Modern videogames place increasing demands on the computational and graphical hardware, leading to novel architectures that have great potential in the context of high performance computing and molecular simulation. We demonstrate that Graphical Processing Units (GPUs) can be used very efficiently to calculate two-electron repulsion integrals over Gaussian basis functions [Formula: see text] the first step in most quantum chemistry calculations. A benchmark test performed for the evaluation of approximately 10(6) (ss|ss) integrals over contracted s-orbitals showed that a naïve algorithm implemented on the GPU achieves up to 130-fold speedup over a traditional CPU implementation on an AMD Opteron. Subsequent calculations of the Coulomb operator for a 256-atom DNA strand show that the GPU advantage is maintained for basis sets including higher angular momentum functions.