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

Lecture notes in computer science

A GPU Implementation of McMurchie-Davidson Algorithm for Two-Electron Repulsion Integral Computation

Haruto Fujii, Yasuaki Ito, Nobuya Yokogawa, Kanta Suzuki, Satoki Tsuji, Koji Nakano, Akihiko Kasagi

Published Jan 1, 2025• 3 citations
Publisher
DOI
10.1007/978-3-031-85697-6_14

Related papers

A Parallel Computation for McMurchie-Davidson Algorithm on the GPU

Haruto Fujii, Yasuaki Ito, Satoki Tsuji +4 more

The two-electron repulsion integral (ERI) is a fundamental component in quantum chemistry, involving the calculation of integrals over four basis functions. Quantum chemistry computations require O(M4) 4 ERI calculations for M basis functions, making ERI evaluations a significant bottleneck in these computations. In this paper, we propose an efficient GPU-based parallelization of the McMurchie-Davidson algorithm, which recursively computes ERI. Our method focuses on optimizing the computations by leveraging the shell parameter, which characterizes the shape of the basis functions. The results demonstrate that the shell-based optimization achieves a performance improvement of up to 15% compared to the nonoptimized approach.

Bulletin of Networking, Computing, Systems, and Software•Mar 14, 2025•0 citations

Variational Monte-Carlo Method for Strongly Interacting Electrons

Thomas Maurice Rice

NATO ASI series. Series B : Physics•Jan 1, 1988•1 citation

A GPU Implementation of the Two-Electron Repulsion Integral Evaluation

Haruto Fujii, Satoki Tsuji, Yasuaki Ito +1 more

Computational quantum chemistry aims to derive properties of a molecule, such as its energy, without the need for actual experimental work. This is done by taking the types and coordinates of atoms within the molecule as input. In this study, we accelerate the computation of the two-electron repulsion integrals that mainly dominate the computing time. Specifically, we focus on the McMurchie-Davidson algorithm, where the two-electron repulsion integrals are obtained through recurrence computation. The idea of the proposed GPU implementation is to expand the recurrence relations and efficiently compute them using multiple threads of the GPU. Our proposed method resulted in an acceleration of up to 3.5 times compared to GPU implementations using recursive functions, and up to 17 times compared to CPU implementations similar to those using the GPU.

Bulletin of Networking, Computing, Systems, and Software•Mar 1, 2024•0 citations

Quantum Monte Carlo on graphical processing units

Amos G. Anderson, William A. Goddard, Peter Schröder

Computer Physics Communications•Apr 2, 2007•109 citations

Optimizing two-electron repulsion integral calculations with McMurchie–Davidson method on graphic processing unit

Yingqi Tian, Bingbing Suo, Yingjin Ma +1 more

In this article, several optimization methods of two-electron repulsion integral calculations on a graphic processing unit (GPU) are presented. These methods are based on the investigations of the method presented by McMurchie and Davidson (MD). A new Boys function evaluation method for the GPU calculation is introduced. The series summation, the error function, and the finite sum formula method are combined; thus, good performance on the GPU can be achieved. By taking some theoretical study of the McMurchie-Davidson recurrence relations, three major optimization approaches are derived from the deduction of the general term formula for the Hermite expansion coefficient. The three approaches contain a new form of the Hermite expansion coefficients with corresponding recurrence relations, which is more efficient for one-electron integrals and [ss|∗∗] or [∗∗|ss] type two-electron integrals. In addition, a simple yet efficient new recurrence formula for the coefficient evaluation is derived, which is more efficient both in float operations and memory operations than its original one. In average, the new recurrence relation can save 26% float operations and 37% memory operations. Finally, a common sub-expression elimination (CSE) method is implemented. This CSE method is directly generated from some equalities we discovered from the general term formula other than by computer algebra system software. This optimized method achieved up to 3.09 speedups compared to the original MD method on the GPU and up to 92.75 speedups compared to the GAMESS calculation on the central processing unit.

The Journal of Chemical Physics•Jul 20, 2021•21 citations

High-Speed Algorithm for Quantum Monte Carlo Simulation

Yutaka Okabe, Macoto Kikuchi

Springer series in solid-state sciences•Jan 1, 1987•0 citations
The two-electron repulsion integral (ERI) is a fundamental component in quantum chemistry, involving the calculation of integrals over four basis functions. Quantum chemistry computations require O(M4) 4 ERI calculations for M basis functions, making ERI evaluations a significant bottleneck in these computations. In this paper, we propose an efficient GPU-based parallelization of the McMurchie-Davidson algorithm, which recursively computes ERI. Our method focuses on optimizing the computations by leveraging the shell parameter, which characterizes the shape of the basis functions. The results demonstrate that the shell-based optimization achieves a performance improvement of up to 15% compared to the nonoptimized approach.
Computational quantum chemistry aims to derive properties of a molecule, such as its energy, without the need for actual experimental work. This is done by taking the types and coordinates of atoms within the molecule as input. In this study, we accelerate the computation of the two-electron repulsion integrals that mainly dominate the computing time. Specifically, we focus on the McMurchie-Davidson algorithm, where the two-electron repulsion integrals are obtained through recurrence computation. The idea of the proposed GPU implementation is to expand the recurrence relations and efficiently compute them using multiple threads of the GPU. Our proposed method resulted in an acceleration of up to 3.5 times compared to GPU implementations using recursive functions, and up to 17 times compared to CPU implementations similar to those using the GPU.
In this article, several optimization methods of two-electron repulsion integral calculations on a graphic processing unit (GPU) are presented. These methods are based on the investigations of the method presented by McMurchie and Davidson (MD). A new Boys function evaluation method for the GPU calculation is introduced. The series summation, the error function, and the finite sum formula method are combined; thus, good performance on the GPU can be achieved. By taking some theoretical study of the McMurchie-Davidson recurrence relations, three major optimization approaches are derived from the deduction of the general term formula for the Hermite expansion coefficient. The three approaches contain a new form of the Hermite expansion coefficients with corresponding recurrence relations, which is more efficient for one-electron integrals and [ss|∗∗] or [∗∗|ss] type two-electron integrals. In addition, a simple yet efficient new recurrence formula for the coefficient evaluation is derived, which is more efficient both in float operations and memory operations than its original one. In average, the new recurrence relation can save 26% float operations and 37% memory operations. Finally, a common sub-expression elimination (CSE) method is implemented. This CSE method is directly generated from some equalities we discovered from the general term formula other than by computer algebra system software. This optimized method achieved up to 3.09 speedups compared to the original MD method on the GPU and up to 92.75 speedups compared to the GAMESS calculation on the central processing unit.