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

Accelerating Dynamic Correlation Algorithms for Quantum Chemistry

Mikael Kovtun

Published Jan 1, 2026• 0 citations
OpenAlex

Abstract

Relativistic quantum mechanics provides a fundamental description of virtually all chemical phenomena, though in practice quantum chemistry is formulated through approximate solutions of the Dirac equation.Among systematic approaches, configuration interaction (CI) yields the exact solution in the complete-basis-set limit but suffers from factorial growth in computer memory requirements, restricting its application to the smallest systems. The recently developed small tensor product distributed active space (STP-DAS) CI framework significantly shrinks these resource requirements, yet large correlated calculations remain out of reach. In contrast, density functional theory (DFT) offers an approximate solution with much more favorable scaling. While not systematically improvable, DFT is widely used for large molecular systems where CI is not tractable. The landscape of scientific computing today is moving away from traditional processors in favor of graphics processing units (GPUs). GPUs offer the potential of tremendous speedup, but their unique computing paradigm requires careful algorithmic design to maximize their effectiveness. In this dissertation, we present two GPU-accelerated algorithms that accelerate critical rate-limiting steps in DFT and STP-DAS CI calculations, enabling faster correlated methods across length scales. We describe the design considerations of these algorithms, contextualize their role in chemical applications, and demonstrate their performance on large systems.

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

Tensor-Structured Techniques for Electronic Structure Calculations

Lin, Ian

Electronic structure calculations have been one of the most successful scientific fields in the past 50 years. Density functional theory (DFT) with its nice balance between accuracy and efficiency has now become the standard technique for many materials research. On the other hand, the size of systems that wavefunction-based methods can handle has also been improved thanks to the recent developments in both computation power and more advanced methodologies. However, these methods are still suffering from the curse of dimensionality. The cubic scaling of a typical DFT calculation restricts the handleable system size of DFT to only a few thousand electrons. To this end, tensor-structured techniques provide a route to constructing a reduced-order algorithm and hence are promising to improve the computational efficiency. In this dissertation work, we aim at exploring the applications of the tensor-structured techniques on different aspects of electronic structure calculations. In the first part of this work, we present a tensor-structured algorithm for efficient large-scale DFT calculations by constructing a Tucker tensor basis that is adapted to the Kohn–Sham Hamiltonian and localized in real-space. The proposed approach uses an additive separable approximation to the Kohn–Sham Hamiltonian and an L1 localization technique to generate the 1-D localized functions that constitute the Tucker tensor basis. Numerical results show that the resulting Tucker tensor basis exhibits exponential convergence in the ground-state energy with increasing Tucker rank. Further, the proposed tensor-structured algorithm demonstrated sub-quadratic scaling with system-size for both systems with and without a gap, and involving many thousands of atoms. This reduced-order scaling has also resulted in the proposed approach outperforming plane-wave DFT implementation for systems beyond 2000 electrons. In the second part of this work, we present an acceleration scheme for the proposed tensor-structured algorithm. In the proposed algorithm, the discrete Kohn-Sham problem is solved using the Chebyshev filtering subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. The computational performance of the GPU accelerated code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms. Finally, we present a computation kernel using tensor-structured techniques to evaluate the one-electron and two-electron integrals, which are the central quantities to construct the Hamiltonian matrix of a full configuration interaction (FCI) calculation, for any molecular orbitals projected on a tensor-structured finite-element mesh. The proposed computation kernel is used to compute the integrals using Hartree-Fock molecular orbitals, which is subsequently used to perform an FCI calculation. In our numerical study, the FCI energy using integrals from the proposed computation kernel is confirmed to be consistent with a standard FCI calculation using the same Hartree-Fock orbitals. The proposed computation kernel provides a useful tool to investigate the behavior of Kohn-Sham orbitals as a basis for FCI calculations in the future, which could be a route to construct a reduced-order basis for an FCI calculation to reduce the computational cost and enable FCI calculation for the previously computationally inaccessible systems.

•Jan 1, 2022•0 citations

Accelerating fundamental components of a quantum chemical multilevel workflow by means of GPU offloading

Pit Steinbach

The dynamic rearrangement of a molecule at finite temperature is not captured by a single static input geometry to a quantum chemical calculation. Multilevel workflows have established themselves as standard procedures to capture the dependence of the molecule’s configuration on computed properties. Each step within this workflow uses an electronic structure theory method that features the optimal computational time to accuracy ratio. For exploratory steps the computational expense of a method needs to be minimal as several thousand energy and nuclear gradient evaluations are needed. Semiempirical tight binding methods, such as GFN2-xTB are often used for such purposes. However, these methods usually lack the accuracy to rank conformers relative to each other within chemical accuracy (2 kcal/mol). Therefore, so-called “low-cost” DFT methods are commonly used for geometry optimizations and conformer ranking. The combination of (semi)empirical correction models with small basis sets leads to good accuracy at moderate computational cost. However, even these highly efficient methods reach the limits of feasibility for very large systems (> 200 atoms). This work proposes solutions to partially alleviate those restrictions and allow routine calculations of these system sizes outside of large high-performance computing facilities. The key to unlock those calculations is to combine tailored algorithmic developments with consumer-grade GPUs. A GPU-enabled linear algebra library is developed to accelerate further development and make the entry to GPU-accelerated software development easier. To demonstrate the ease of implementation, the addition of Mulliken-approximated exchange to GFN2-xTB will be shown. In most semiempirical methods, the general eigenvalue solver algorithm becomes the computational bottleneck, dominating the walltime with increasing system size. A density matrix purification algorithm is tailored to give up to six-fold acceleration of GFN2-xTB calculations using a mixed-precision approach. Lastly, 3c-methods are added to the GPU-accelerated TeraChem software package. In combination with the “mixed-precision” scheme for computing the electron repulsion integrals, this addition decreases the runtime of DFT calculations by up to an order of magnitude on mid-level consumer hardware. The overall goal of these projects is to make GPU-accelerated calculations in quantum chemistry more available. This achieve by exposing algorithmic developments that are performant on reasonably priced hardware and making GPU computing more accessible to non-experts.

•Jan 1, 2026•0 citations

One programming model to rule them all: High-performance computational chemistry and applications via OpenMP offloading mode

Melisa Alkan

This dissertation is focused around enabling large-scale quantum chemistry calculations by developing novel algorithms on new heterogeneous hardware architectures. Section 2 contains a study on assessing the importance of many-body dispersion phenomena in molecular clusters and understanding the need to incorporate the phenomena into existing quantum chemistry methods to accurately capture long-range interactions. It is known that highly accurate quantum chemistry methods are computationally expensive; therefore, there is a need for new computer algorithms that will be able to vastly improve the time to solution and enable correlated quantum chemistry calculations on large molecular systems. Sections 3 and 4 focus on the development and implementation of various algorithms that enable quantum chemistry calculations on molecules of unprecedent sizes. Specifically, Section 3 describes a novel CUDA-based algorithm that enables GPU-acceleration of the main parts of the Self-Consistent Field (SCF) cycle, resulting in the fastest SCF code to date. Section 4 introduces a novel OpenMP-based implementation of the Fock build formation, which enables GPU-accelerated calculations on all existing GPU and CPU hardware. Section 5 expands upon the OpenMP work and describes a new GPU-accelerated library named LibERI for evaluating molecular integrals – often the main computational bottleneck in many quantum chemistry methods. LibERI is intended to serve as a library for fast quantum chemistry calculations that can be interfaced with any existing quantum chemistry software packages through the MolSSI Driver Interface (MDI). MDI is a standard interface between scientific computational codes. One of LibERI’s objectives is to seamlessly integrate with a Molecular Mechanics (MM) package using MDI to enable fast QM/MM calculations. This integration would allow for efficient GPU-accelerated treatment of large QM regions via LibERI. Lastly, Section 6 concludes this dissertation with a study that applies existing quantum chemistry methods to unravel the mechanism of a Pd-catalyzed carboacylation reaction involving the activation of ester C-O bonds.

•Jan 1, 2023•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

Quantum-Accelerated Density Functional Theory with Adaptive Basis Set Compression for Materials Discovery

Freederia AI Researcher

**Abstract:** This paper introduces a novel computational framework for accelerating Density Functional Theory (DFT) calculations, a cornerstone of materials discovery research, through the integration of quantum-accelerated linear algebra and adaptive basis set compression. Our approach, termed Quantum-Accelerated Adaptive DFT (QAADFT), leverages variational quantum eigensolvers (VQEs) for optimized solution to the Kohn-Sham equations, coupled with a dynamically adjusting basis set tailored to the evolving electron density. This synergistic combination leads to significant computational speedups, particularly for complex materials exhibiting strongly correlated electronic behavior, while maintaining accuracy comparable to conventional DFT methods. The system is designed for immediate commercial application in materials design, offering a 5-10x reduction in computational time and enabling more comprehensive exploration of chemical spaces for targeted material properties.

•Nov 24, 2025•0 citations
Relativistic quantum mechanics provides a fundamental description of virtually all chemical phenomena, though in practice quantum chemistry is formulated through approximate solutions of the Dirac equation.Among systematic approaches, configuration interaction (CI) yields the exact solution in the complete-basis-set limit but suffers from factorial growth in computer memory requirements, restricting its application to the smallest systems. The recently developed small tensor product distributed active space (STP-DAS) CI framework significantly shrinks these resource requirements, yet large correlated calculations remain out of reach. In contrast, density functional theory (DFT) offers an approximate solution with much more favorable scaling. While not systematically improvable, DFT is widely used for large molecular systems where CI is not tractable. The landscape of scientific computing today is moving away from traditional processors in favor of graphics processing units (GPUs). GPUs offer the potential of tremendous speedup, but their unique computing paradigm requires careful algorithmic design to maximize their effectiveness. In this dissertation, we present two GPU-accelerated algorithms that accelerate critical rate-limiting steps in DFT and STP-DAS CI calculations, enabling faster correlated methods across length scales. We describe the design considerations of these algorithms, contextualize their role in chemical applications, and demonstrate their performance on large systems.
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
Electronic structure calculations have been one of the most successful scientific fields in the past 50 years. Density functional theory (DFT) with its nice balance between accuracy and efficiency has now become the standard technique for many materials research. On the other hand, the size of systems that wavefunction-based methods can handle has also been improved thanks to the recent developments in both computation power and more advanced methodologies. However, these methods are still suffering from the curse of dimensionality. The cubic scaling of a typical DFT calculation restricts the handleable system size of DFT to only a few thousand electrons. To this end, tensor-structured techniques provide a route to constructing a reduced-order algorithm and hence are promising to improve the computational efficiency. In this dissertation work, we aim at exploring the applications of the tensor-structured techniques on different aspects of electronic structure calculations. In the first part of this work, we present a tensor-structured algorithm for efficient large-scale DFT calculations by constructing a Tucker tensor basis that is adapted to the Kohn–Sham Hamiltonian and localized in real-space. The proposed approach uses an additive separable approximation to the Kohn–Sham Hamiltonian and an L1 localization technique to generate the 1-D localized functions that constitute the Tucker tensor basis. Numerical results show that the resulting Tucker tensor basis exhibits exponential convergence in the ground-state energy with increasing Tucker rank. Further, the proposed tensor-structured algorithm demonstrated sub-quadratic scaling with system-size for both systems with and without a gap, and involving many thousands of atoms. This reduced-order scaling has also resulted in the proposed approach outperforming plane-wave DFT implementation for systems beyond 2000 electrons. In the second part of this work, we present an acceleration scheme for the proposed tensor-structured algorithm. In the proposed algorithm, the discrete Kohn-Sham problem is solved using the Chebyshev filtering subspace iteration method that relies on matrix-matrix multiplications of a sparse symmetric Hamiltonian matrix and a dense wavefunction matrix, expressed in the localized Tucker tensor basis. These matrix-matrix multiplication operations, which constitute the most computationally intensive step of the solution procedure, are GPU accelerated providing ~8-fold GPU-CPU speedup for these operations on the largest systems studied. The computational performance of the GPU accelerated code is presented using benchmark studies on aluminum nano-particles and silicon quantum dots with system sizes ranging up to ~7,000 atoms. Finally, we present a computation kernel using tensor-structured techniques to evaluate the one-electron and two-electron integrals, which are the central quantities to construct the Hamiltonian matrix of a full configuration interaction (FCI) calculation, for any molecular orbitals projected on a tensor-structured finite-element mesh. The proposed computation kernel is used to compute the integrals using Hartree-Fock molecular orbitals, which is subsequently used to perform an FCI calculation. In our numerical study, the FCI energy using integrals from the proposed computation kernel is confirmed to be consistent with a standard FCI calculation using the same Hartree-Fock orbitals. The proposed computation kernel provides a useful tool to investigate the behavior of Kohn-Sham orbitals as a basis for FCI calculations in the future, which could be a route to construct a reduced-order basis for an FCI calculation to reduce the computational cost and enable FCI calculation for the previously computationally inaccessible systems.
The dynamic rearrangement of a molecule at finite temperature is not captured by a single static input geometry to a quantum chemical calculation. Multilevel workflows have established themselves as standard procedures to capture the dependence of the molecule’s configuration on computed properties. Each step within this workflow uses an electronic structure theory method that features the optimal computational time to accuracy ratio. For exploratory steps the computational expense of a method needs to be minimal as several thousand energy and nuclear gradient evaluations are needed. Semiempirical tight binding methods, such as GFN2-xTB are often used for such purposes. However, these methods usually lack the accuracy to rank conformers relative to each other within chemical accuracy (2 kcal/mol). Therefore, so-called “low-cost” DFT methods are commonly used for geometry optimizations and conformer ranking. The combination of (semi)empirical correction models with small basis sets leads to good accuracy at moderate computational cost. However, even these highly efficient methods reach the limits of feasibility for very large systems (> 200 atoms). This work proposes solutions to partially alleviate those restrictions and allow routine calculations of these system sizes outside of large high-performance computing facilities. The key to unlock those calculations is to combine tailored algorithmic developments with consumer-grade GPUs. A GPU-enabled linear algebra library is developed to accelerate further development and make the entry to GPU-accelerated software development easier. To demonstrate the ease of implementation, the addition of Mulliken-approximated exchange to GFN2-xTB will be shown. In most semiempirical methods, the general eigenvalue solver algorithm becomes the computational bottleneck, dominating the walltime with increasing system size. A density matrix purification algorithm is tailored to give up to six-fold acceleration of GFN2-xTB calculations using a mixed-precision approach. Lastly, 3c-methods are added to the GPU-accelerated TeraChem software package. In combination with the “mixed-precision” scheme for computing the electron repulsion integrals, this addition decreases the runtime of DFT calculations by up to an order of magnitude on mid-level consumer hardware. The overall goal of these projects is to make GPU-accelerated calculations in quantum chemistry more available. This achieve by exposing algorithmic developments that are performant on reasonably priced hardware and making GPU computing more accessible to non-experts.
This dissertation is focused around enabling large-scale quantum chemistry calculations by developing novel algorithms on new heterogeneous hardware architectures. Section 2 contains a study on assessing the importance of many-body dispersion phenomena in molecular clusters and understanding the need to incorporate the phenomena into existing quantum chemistry methods to accurately capture long-range interactions. It is known that highly accurate quantum chemistry methods are computationally expensive; therefore, there is a need for new computer algorithms that will be able to vastly improve the time to solution and enable correlated quantum chemistry calculations on large molecular systems. Sections 3 and 4 focus on the development and implementation of various algorithms that enable quantum chemistry calculations on molecules of unprecedent sizes. Specifically, Section 3 describes a novel CUDA-based algorithm that enables GPU-acceleration of the main parts of the Self-Consistent Field (SCF) cycle, resulting in the fastest SCF code to date. Section 4 introduces a novel OpenMP-based implementation of the Fock build formation, which enables GPU-accelerated calculations on all existing GPU and CPU hardware. Section 5 expands upon the OpenMP work and describes a new GPU-accelerated library named LibERI for evaluating molecular integrals – often the main computational bottleneck in many quantum chemistry methods. LibERI is intended to serve as a library for fast quantum chemistry calculations that can be interfaced with any existing quantum chemistry software packages through the MolSSI Driver Interface (MDI). MDI is a standard interface between scientific computational codes. One of LibERI’s objectives is to seamlessly integrate with a Molecular Mechanics (MM) package using MDI to enable fast QM/MM calculations. This integration would allow for efficient GPU-accelerated treatment of large QM regions via LibERI. Lastly, Section 6 concludes this dissertation with a study that applies existing quantum chemistry methods to unravel the mechanism of a Pd-catalyzed carboacylation reaction involving the activation of ester C-O bonds.
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.
**Abstract:** This paper introduces a novel computational framework for accelerating Density Functional Theory (DFT) calculations, a cornerstone of materials discovery research, through the integration of quantum-accelerated linear algebra and adaptive basis set compression. Our approach, termed Quantum-Accelerated Adaptive DFT (QAADFT), leverages variational quantum eigensolvers (VQEs) for optimized solution to the Kohn-Sham equations, coupled with a dynamically adjusting basis set tailored to the evolving electron density. This synergistic combination leads to significant computational speedups, particularly for complex materials exhibiting strongly correlated electronic behavior, while maintaining accuracy comparable to conventional DFT methods. The system is designed for immediate commercial application in materials design, offering a 5-10x reduction in computational time and enabling more comprehensive exploration of chemical spaces for targeted material properties.