|国家预印本平台
首页|Designing quantum chemistry algorithms with just-in-time compilation

Designing quantum chemistry algorithms with just-in-time compilation

Designing quantum chemistry algorithms with just-in-time compilation

来源:Arxiv_logoArxiv
英文摘要

We introduce just-in-time (JIT) compilation to the integral kernels for Gaussian-type orbitals (GTOs) to enhance the efficiency of electron repulsion integral computations. For Coulomb and exchange (JK) matrices, JIT-based algorithms yield a 2x speedup for the small 6-31G* basis set over GPU4PySCF v1.4 on an NVIDIA A100-80G GPU. By incorporating a novel algorithm designed for orbitals with high angular momentum, the efficiency of JK evaluations with the large def2-TZVPP basis set is improved by up to 4x. The core CUDA implementation is compact, comprising only ~1,000 lines of code, including support for single-precision arithmetic. Furthermore, the single-precision implementation achieves a 3x speedup over the previous state-of-the-art.

Yuanheng Wang、Xiaojie Wu、Qiming Sun

化学

Yuanheng Wang,Xiaojie Wu,Qiming Sun.Designing quantum chemistry algorithms with just-in-time compilation[EB/OL].(2025-07-30)[2025-08-02].https://arxiv.org/abs/2507.09772.点此复制

评论