To address these challenges, we build on our state-of-the-art GS and high-rung DFT methods and codes. We further decrease their already outstanding computational time and data requirements through concerted theoretical, algorithmic, and software developments. In particular, we introduce novel data-compression and physics-based ideas to reduce the associated basis set and local approximation effects, achieving higher accuracy at widely affordable computational cost.
In parallel, we devised new ways to combine the strengths of the above quantum chemistry approaches. First, we utilize components from the accelerated GS-type models to develop a new type of DFT method with outstanding accuracy-over-cost performance. Second, we advanced quantum embedding schemes, which apply the more accurate but expensive GS methods to the chemically most relevant regions (e.g. catalytic centers or close-contact intermolecular interactions), while quantum mechnically (QM) embedding them in a larger, efficiently computed DFT environment to account for solvent, biochemical, or crystal environment effects.
The calculation of measurable properties requires advanced techniques to evaluate derviatives needed for the response to external effects. By overcoming data storage and communication bottlenecks, we developed a massively parallel and memory-efficient GS gradient code. On a single 128-core node, this code already outperforms the best current alternatives by an order of magnitude. We also introduced a quantum embedding framework that enables the relatively simpler introduction of localization considerations to GS derivative properties, laying the foundation for further advances in the second half of the project.
Beyond enabling novel (bio)chemical applications (see below), our methods provide unprecedented quality reference data for large, real-world molecules. These references are critical for assessing, improving, and training more affordable methods such as DFT, machine learning (ML), and molecular mechanics (MM).
Our new methods are regularly released in the MRCC package at www.mrcc.hu with open source for academic use and facilitation of commercial use.