Abstract
Semiempirical quantum chemistry (SQC) methods offer fast quantum chemical insights by constructing and solving a parametric effective minimal basis Fock matrix. Establishing suitable parameterizations has long been a challenging and time-consuming task involving tedious grid searches or costly finite-difference gradients of carefully crafted loss functions based on select experimental data. The growing availability of differentiable programming environments that leverage algorithmic differentiation to obtain complex derivatives together with access to a wealth of reliable reference data from ab initio calculations offers a new and more efficient approach. In this work, we extend a previous, basic implementation of SQC methods in PyTorch [J. Chem. Theory Comput. 16, 4951-4962 (2020)] by including global algorithmic considerations into the code design. This allows for improved general applicability and establishes a robust back-end for rapid SQC parameterizations. In particular, we address the general differentiability of the eigensolver and the iterative SCF procedure. The new implementation offers drastic improvements in computing costs as well as memory footprint and provides increased stability in gradient evaluation. We highlight the importance of these advances and their improvements over existing formulations and illustrate their role in the context of SQC parameterization.
Supplementary materials
Title
Supplementary Information
Description
Supplementary information for the main text.
Actions



![Author ORCID: We display the ORCID iD icon alongside authors names on our website to acknowledge that the ORCiD has been authenticated when entered by the user. To view the users ORCiD record click the icon. [opens in a new tab]](https://www.cambridge.org/engage/assets/public/coe/logo/orcid.png)