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

arXiv:2312.01846

Sparse Full Configuration Interaction

Wang, Lijun

Published Dec 4, 2023• 0 citations
arXivHTMLPDF

Abstract

We propose an efficient deterministic method to calculate the full configuration interaction (FCI) ground state energy. This method leverages the sparseness of the Lanczos basis vectors that span the Krylov subspace associated with the Hamiltonian to rapidly calculate the lowest eigenvalue of the effective Hamiltonian formed in this basis. By iteratively performing the spanning and diagonalization steps, this method is capable of rapidly reaching chemical accuracy for a variety of strongly correlated molecules, including stretched N$_2$ and C$_2$, in merely several tens of iterations. To accelerate our algorithm, we implement parallelized sparse matrix-sparse vector multiplication, which features a novel hashing method that establishes a one-to-one correspondence between the set of full configuration Slater determinants and a set of consecutive integers. A near-linear acceleration was observed.

DOI
10.48550/arxiv.2312.01846

Related papers

A sparse matrix based full-configuration interaction algorithm

Zoltán Rolik, Ágnes Szabados, Péter R. Śurján

We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen et al. [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers.

The Journal of Chemical Physics•Apr 8, 2008•29 citations

Fully GPU-Accelerated Full Configuration Interaction for Exact Molecular Ground-state Energy Calculation

Hong Gao, Yasuaki Ito, Koji Nakano +3 more

Full configuration interaction (FCI) serves as a benchmark tool for evaluating the accuracy of approximate quantum chemical methods. However, its exponential computational cost limits its practical use. The inherently parallel and compute-intensive nature of matrix and vector operations in FCI is well-suited for acceleration on modern GPU architectures. Despite this potential, prior research has only focused on accelerating the matrix and vector multiplication, thus failing to fully exploit the power of GPUs. In this paper, we present a fully GPU-accelerated FCI implementation that uses a CUDA-enabled GPU for the entire computational workflow, achieving end-to-end acceleration. Our implementation incorporates and refines advanced optimization strategies from previous studies, while crucially eliminating redundant computational steps and minimizing CPU-GPU data transfers. To facilitate broad usability and integration, we offer both Python- and C-based implementations. Our C implementation achieves up to a 35.4× speedup over a multithreaded CPU implementation and up to a 15.9× speedup over the current leading GPU-based implementation, respectively. Our Python implementation also delivers substantial acceleration, reaching up to 18.9× and 8.7× speedups over CPU and prior GPU implementations, respectively.

International Symposium on Computing and Networking•Nov 25, 2025•0 citations

Full configuration interaction algorithm on a massively parallel architecture: Direct-list implementation

Elda Rossi, Gian Luigi Bendazzoli, Stefano Evangelisti

A parallel full configuration interaction (FCI) code, implemented on a distributed memory MPP computer, has been modified in order to use a direct algorithm to compute the lists of mono- and biexcitations each time they are needed. We were able to perform FCI calculations on the ground state of the acetylene molecule with two different basis sets, corresponding to more than 2.5 and 5 billion Slater determinants, respectively. The calculations were performed on a Cray-T3D and a Cray-T3E, both machines having 128 processors. Performance and comparison between the two computers are reported and discussed. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 658–672, 1998

Journal of Computational Chemistry•Apr 30, 1998•18 citations

Distributed Implementation of Full Configuration Interaction for One Trillion Determinants

Hong Ming Gao, Satoshi Imamura, Akihiko Kasagi +1 more

High Resolution Image Download MS PowerPoint Slide Full configuration interaction (FCI) can provide an exact molecular ground-state energy within a given basis set and serve as a benchmark for approximate methods in quantum chemical calculations, including the emerging variational quantum eigensolver. However, its exponential computational and memory requirements easily exceed the capability of a single server and limit its applicability to large molecules. In this paper, we present a distributed FCI implementation employing a hybrid parallelization scheme with multithreading and multiprocessing to expand FCI’s applicability. We optimize this scheme to minimize the bottlenecks arising from interprocess communications and interthread data management. Our implementation achieves higher scalability than the naive combination of prior works and successfully calculates the exact energy of C 3 H 8 /STO-3G with 1.31 trillion determinants, which is the largest FCI calculation to the best of our knowledge. Furthermore, we provide a comprehensive list of FCI results with 136 combinations of molecules and basis sets for future evaluation and development of approximate methods.

Journal of Chemical Theory and Computation•Feb 5, 2024•62 citations

A truncated Davidson method for the efficient “chemically accurate” calculation of full configuration interaction wavefunctions without any large matrix diagonalization

Stephen J. Cotton

This work develops and illustrates a new method of calculating “chemically accurate” electronic wavefunctions (and energies) via a truncated full configuration interaction (CI) procedure, which arguably circumvents the large matrix diagonalization that is the core problem of full CI and is also central to modern selective CI approaches. This is accomplished simply by following the standard/ubiquitous Davidson method in its “direct” form—wherein, in each iteration, the electronic Hamiltonian operator is applied directly in second quantization to the Ritz vector/wavefunction from the prior iteration—except that (in this work) only a small portion of the resultant expansion vector is actually even computed (through the application of only a similarly small portion of the Hamiltonian). Specifically, at each iteration of this truncated Davidson approach, the new expansion vector is taken to be twice as large as that from the prior iteration. In this manner, a small set of highly truncated expansion vectors (say 10–30) of increasing precision is incrementally constructed, forming a small subspace within which diagonalization of the Hamiltonian yields clear, consistent, and monotonically variational convergence to the approximate full CI limit. The good efficiency in which convergence to the level of chemical accuracy (1.6 mhartree) is achieved suggests, at least for the demonstrated problem sizes—Hilbert spaces of 1018 and wavefunctions of 108 determinants—that this truncated Davidson methodology can serve as a replacement of standard CI and complete-active space approaches in circumstances where only a few chemically significant digits of accuracy are required and/or meaningful in view of ever-present basis set limitations.

arXiv:2207.12587•The Journal of Chemical Physics•Dec 8, 2022•6 citations

A deterministic alternative to the full configuration interaction quantum Monte Carlo method

Norm M. Tubman, Joonho Lee, Tyler Y. Takeshita +2 more

Development of exponentially scaling methods has seen great progress in tackling larger systems than previously thought possible. One such technique, full configuration interaction quantum Monte Carlo, is a useful algorithm that allows exact diagonalization through stochastically sampling determinants. The method derives its utility from the information in the matrix elements of the Hamiltonian, along with a stochastic projected wave function, to find the important parts of Hilbert space. However, the stochastic representation of the wave function is not required to search Hilbert space efficiently, and here we describe a highly efficient deterministic method that can achieve chemical accuracy for a wide range of systems, including the difficult Cr2 molecule. We demonstrate for systems like Cr2 that such calculations can be performed in just a few cpu hours which makes it one of the most efficient and accurate methods that can attain chemical accuracy for strongly correlated systems. In addition our method also allows efficient calculation of excited state energies, which we illustrate with benchmark results for the excited states of C2.

arXiv:1603.02686•The Journal of Chemical Physics•Jul 28, 2016•323 citations
We propose an efficient deterministic method to calculate the full configuration interaction (FCI) ground state energy. This method leverages the sparseness of the Lanczos basis vectors that span the Krylov subspace associated with the Hamiltonian to rapidly calculate the lowest eigenvalue of the effective Hamiltonian formed in this basis. By iteratively performing the spanning and diagonalization steps, this method is capable of rapidly reaching chemical accuracy for a variety of strongly correlated molecules, including stretched N2_22​ and C2_22​, in merely several tens of iterations. To accelerate our algorithm, we implement parallelized sparse matrix-sparse vector multiplication, which features a novel hashing method that establishes a one-to-one correspondence between the set of full configuration Slater determinants and a set of consecutive integers. A near-linear acceleration was observed.
We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen et al. [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers.
Full configuration interaction (FCI) serves as a benchmark tool for evaluating the accuracy of approximate quantum chemical methods. However, its exponential computational cost limits its practical use. The inherently parallel and compute-intensive nature of matrix and vector operations in FCI is well-suited for acceleration on modern GPU architectures. Despite this potential, prior research has only focused on accelerating the matrix and vector multiplication, thus failing to fully exploit the power of GPUs. In this paper, we present a fully GPU-accelerated FCI implementation that uses a CUDA-enabled GPU for the entire computational workflow, achieving end-to-end acceleration. Our implementation incorporates and refines advanced optimization strategies from previous studies, while crucially eliminating redundant computational steps and minimizing CPU-GPU data transfers. To facilitate broad usability and integration, we offer both Python- and C-based implementations. Our C implementation achieves up to a 35.4× speedup over a multithreaded CPU implementation and up to a 15.9× speedup over the current leading GPU-based implementation, respectively. Our Python implementation also delivers substantial acceleration, reaching up to 18.9× and 8.7× speedups over CPU and prior GPU implementations, respectively.
A parallel full configuration interaction (FCI) code, implemented on a distributed memory MPP computer, has been modified in order to use a direct algorithm to compute the lists of mono- and biexcitations each time they are needed. We were able to perform FCI calculations on the ground state of the acetylene molecule with two different basis sets, corresponding to more than 2.5 and 5 billion Slater determinants, respectively. The calculations were performed on a Cray-T3D and a Cray-T3E, both machines having 128 processors. Performance and comparison between the two computers are reported and discussed. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 658–672, 1998
High Resolution Image Download MS PowerPoint Slide Full configuration interaction (FCI) can provide an exact molecular ground-state energy within a given basis set and serve as a benchmark for approximate methods in quantum chemical calculations, including the emerging variational quantum eigensolver. However, its exponential computational and memory requirements easily exceed the capability of a single server and limit its applicability to large molecules. In this paper, we present a distributed FCI implementation employing a hybrid parallelization scheme with multithreading and multiprocessing to expand FCI’s applicability. We optimize this scheme to minimize the bottlenecks arising from interprocess communications and interthread data management. Our implementation achieves higher scalability than the naive combination of prior works and successfully calculates the exact energy of C 3 H 8 /STO-3G with 1.31 trillion determinants, which is the largest FCI calculation to the best of our knowledge. Furthermore, we provide a comprehensive list of FCI results with 136 combinations of molecules and basis sets for future evaluation and development of approximate methods.
This work develops and illustrates a new method of calculating “chemically accurate” electronic wavefunctions (and energies) via a truncated full configuration interaction (CI) procedure, which arguably circumvents the large matrix diagonalization that is the core problem of full CI and is also central to modern selective CI approaches. This is accomplished simply by following the standard/ubiquitous Davidson method in its “direct” form—wherein, in each iteration, the electronic Hamiltonian operator is applied directly in second quantization to the Ritz vector/wavefunction from the prior iteration—except that (in this work) only a small portion of the resultant expansion vector is actually even computed (through the application of only a similarly small portion of the Hamiltonian). Specifically, at each iteration of this truncated Davidson approach, the new expansion vector is taken to be twice as large as that from the prior iteration. In this manner, a small set of highly truncated expansion vectors (say 10–30) of increasing precision is incrementally constructed, forming a small subspace within which diagonalization of the Hamiltonian yields clear, consistent, and monotonically variational convergence to the approximate full CI limit. The good efficiency in which convergence to the level of chemical accuracy (1.6 mhartree) is achieved suggests, at least for the demonstrated problem sizes—Hilbert spaces of 1018 and wavefunctions of 108 determinants—that this truncated Davidson methodology can serve as a replacement of standard CI and complete-active space approaches in circumstances where only a few chemically significant digits of accuracy are required and/or meaningful in view of ever-present basis set limitations.
Development of exponentially scaling methods has seen great progress in tackling larger systems than previously thought possible. One such technique, full configuration interaction quantum Monte Carlo, is a useful algorithm that allows exact diagonalization through stochastically sampling determinants. The method derives its utility from the information in the matrix elements of the Hamiltonian, along with a stochastic projected wave function, to find the important parts of Hilbert space. However, the stochastic representation of the wave function is not required to search Hilbert space efficiently, and here we describe a highly efficient deterministic method that can achieve chemical accuracy for a wide range of systems, including the difficult Cr2 molecule. We demonstrate for systems like Cr2 that such calculations can be performed in just a few cpu hours which makes it one of the most efficient and accurate methods that can attain chemical accuracy for strongly correlated systems. In addition our method also allows efficient calculation of excited state energies, which we illustrate with benchmark results for the excited states of C2.