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:2607.24319

The Convergence and Error Analysis of Coordinate Descent Methods with Compression for Full Configuration Interaction

Yingzhou Li, Qiang Wu

Published Jul 27, 2026• 0 citations
arXivHTMLPDF

Abstract

We study the effect of compression in Coordinate Descent Full Configuration Interaction (CDFCI) within an unconstrained optimization formulation of the full configuration interaction ground-state problem. Under suitable local assumptions, we prove that the compressed iteration converges linearly to the solution of an associated restricted problem. We also characterize the convergence point of the compressed algorithm. Under an additional exponential decay assumption on the target eigenvector, we show that the resulting eigenvalue error is of order $τ^2$, where $τ$ denotes the compression threshold. Numerical results support the analysis.

DOI
10.48550/arxiv.2607.24319

Related papers

Perturbative Coordinate Descent Full Configuration Interaction

Z D Zhang, Mingyu Qiu, Yingzhou Li +1 more

The coordinate descent full configuration interaction (CDFCI) is an accurate and efficient method for calculating ground-state energies of molecular systems. In this work we introduce two perturbative extensions of original CDFCI. We first propose a direct CDFCI + PT to further correct variational energy by perturbation theory. We also propose an iterative perturbative CDFCI (IP-CDFCI) to avoid evaluating the overlarge perturbative space and catch the information encoded in variational stage. In IP-CDFCI, we store three sparse vectors in a Hash table: c, b and d, where c is the variational wave function, b is the compressed approximation of H c and d is the perturbative wave function, respectively. By utilizing the redundant memory in the storage of c, we can calculate perturbation without any extra memory compared to original CDFCI. We also use a strategy to eliminate the expensive repetitive evaluation of diagonal elements of Hamiltonian by creating a vector h which stores the diagonal entries of Hamiltonian. This strategy trades memory usage for computational time and reduces the computing time significantly. Furthermore, we use quadruple-precision floating-point numbers to improve the numerical stability of perturbative energy. We demonstrate the effectiveness of the single-threaded IP-CDFCI and the multithreaded CDFCI + PT, respectively, by performing calculations on several small molecular benchmarks as well as challenging correlated system: the chromium dimer.

Journal of Chemical Theory and Computation•May 7, 2026•0 citations

Parallel Multicoordinate Descent Methods for Full Configuration Interaction

Yuejia Zhang, Weiguo Gao, Yingzhou Li

We develop a multithreaded parallel coordinate descent full configuration interaction algorithm (mCDFCI) for the electronic structure ground-state calculation in the configuration interaction framework. The FCI problem is reformulated as an unconstrained minimization problem and tackled by a modified block coordinate descent method with a deterministic compression strategy. mCDFCI is designed to prioritize determinants based on their importance, with block updates enabling efficient parallelization on shared-memory, multicore computing infrastructure. We demonstrate the efficiency of the algorithm by computing an accurate benchmark energy for the chromium dimer in the Ahlrichs SV basis (48e, 42o), which explicitly includes 2.07 × 10 9 variational determinants. We also provide the binding curve of the nitrogen dimer under the cc-pVQZ basis set (14e, 110o). Benchmarks show up to 79.3% parallel efficiency on 128 cores.

arXiv:2411.07565•Journal of Chemical Theory and Computation•Feb 28, 2025•3 citations

The Full Configuration Interaction Quantum Monte Carlo Method through the Lens of Inexact Power Iteration

Jianfeng Lu, Zhe Wang

In this paper, we propose a general analysis framework for inexact power iteration, which can be used to efficiently solve high-dimensional eigenvalue problems arising from quantum many-body problems. Under this framework, we establish the convergence theorems for several recently proposed randomized algorithms, including full configuration interaction quantum Monte Carlo and fast randomized iteration. The analysis is consistent with numerical experiments for physical systems such as the Hubbard model and small chemical molecules. We also compare the algorithms both in convergence analysis and numerical results.

SIAM Journal on Scientific Computing•Jan 1, 2020•11 citations

The full configuration interaction quantum Monte Carlo method in the lens of inexact power iteration

Jianfeng Lu, Zhe Wang

In this paper, we propose a general analysis framework for inexact power iteration, which can be used to efficiently solve high dimensional eigenvalue problems arising from quantum many-body problems. Under the proposed framework, we establish the convergence theorems for several recently proposed randomized algorithms, including the full configuration interaction quantum Monte Carlo (FCIQMC) and the fast randomized iteration (FRI). The analysis is consistent with numerical experiments for physical systems such as Hubbard model and small chemical molecules. We also compare the algorithms both in convergence analysis and numerical results.

arXiv:1711.09153•Nov 24, 2017•9 citations

Approaching the full configuration interaction ground state from an arbitrary wavefunction with gradient descent and quasi-Newton algorithms

Carlos A. Jiménez-Hoyos

We consider gradient descent and quasi-Newton algorithms to optimize the full configuration interaction (FCI) ground state wavefunction starting from an arbitrary reference state |0⟩. We show that the energies obtained along the optimization path can be evaluated in terms of expectation values of |0⟩, thus avoiding explicit storage of intermediate wavefunctions. This allows us to find the energies after the first few steps of the FCI algorithm for systems much larger than what standard deterministic FCI codes can handle at present. We show an application of the algorithm with reference wavefunctions constructed as linear combinations of non-orthogonal determinants.

arXiv:2010.02027•The Journal of Chemical Physics•Dec 18, 2020•3 citations

Sparse Full Configuration Interaction

Wang, Lijun

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.

arXiv:2312.01846•Dec 4, 2023•0 citations
We study the effect of compression in Coordinate Descent Full Configuration Interaction (CDFCI) within an unconstrained optimization formulation of the full configuration interaction ground-state problem. Under suitable local assumptions, we prove that the compressed iteration converges linearly to the solution of an associated restricted problem. We also characterize the convergence point of the compressed algorithm. Under an additional exponential decay assumption on the target eigenvector, we show that the resulting eigenvalue error is of order τ2τ^2τ2, where τττ denotes the compression threshold. Numerical results support the analysis.
The coordinate descent full configuration interaction (CDFCI) is an accurate and efficient method for calculating ground-state energies of molecular systems. In this work we introduce two perturbative extensions of original CDFCI. We first propose a direct CDFCI + PT to further correct variational energy by perturbation theory. We also propose an iterative perturbative CDFCI (IP-CDFCI) to avoid evaluating the overlarge perturbative space and catch the information encoded in variational stage. In IP-CDFCI, we store three sparse vectors in a Hash table: c, b and d, where c is the variational wave function, b is the compressed approximation of H c and d is the perturbative wave function, respectively. By utilizing the redundant memory in the storage of c, we can calculate perturbation without any extra memory compared to original CDFCI. We also use a strategy to eliminate the expensive repetitive evaluation of diagonal elements of Hamiltonian by creating a vector h which stores the diagonal entries of Hamiltonian. This strategy trades memory usage for computational time and reduces the computing time significantly. Furthermore, we use quadruple-precision floating-point numbers to improve the numerical stability of perturbative energy. We demonstrate the effectiveness of the single-threaded IP-CDFCI and the multithreaded CDFCI + PT, respectively, by performing calculations on several small molecular benchmarks as well as challenging correlated system: the chromium dimer.
We develop a multithreaded parallel coordinate descent full configuration interaction algorithm (mCDFCI) for the electronic structure ground-state calculation in the configuration interaction framework. The FCI problem is reformulated as an unconstrained minimization problem and tackled by a modified block coordinate descent method with a deterministic compression strategy. mCDFCI is designed to prioritize determinants based on their importance, with block updates enabling efficient parallelization on shared-memory, multicore computing infrastructure. We demonstrate the efficiency of the algorithm by computing an accurate benchmark energy for the chromium dimer in the Ahlrichs SV basis (48e, 42o), which explicitly includes 2.07 × 10 9 variational determinants. We also provide the binding curve of the nitrogen dimer under the cc-pVQZ basis set (14e, 110o). Benchmarks show up to 79.3% parallel efficiency on 128 cores.
In this paper, we propose a general analysis framework for inexact power iteration, which can be used to efficiently solve high-dimensional eigenvalue problems arising from quantum many-body problems. Under this framework, we establish the convergence theorems for several recently proposed randomized algorithms, including full configuration interaction quantum Monte Carlo and fast randomized iteration. The analysis is consistent with numerical experiments for physical systems such as the Hubbard model and small chemical molecules. We also compare the algorithms both in convergence analysis and numerical results.
In this paper, we propose a general analysis framework for inexact power iteration, which can be used to efficiently solve high dimensional eigenvalue problems arising from quantum many-body problems. Under the proposed framework, we establish the convergence theorems for several recently proposed randomized algorithms, including the full configuration interaction quantum Monte Carlo (FCIQMC) and the fast randomized iteration (FRI). The analysis is consistent with numerical experiments for physical systems such as Hubbard model and small chemical molecules. We also compare the algorithms both in convergence analysis and numerical results.
We consider gradient descent and quasi-Newton algorithms to optimize the full configuration interaction (FCI) ground state wavefunction starting from an arbitrary reference state |0⟩. We show that the energies obtained along the optimization path can be evaluated in terms of expectation values of |0⟩, thus avoiding explicit storage of intermediate wavefunctions. This allows us to find the energies after the first few steps of the FCI algorithm for systems much larger than what standard deterministic FCI codes can handle at present. We show an application of the algorithm with reference wavefunctions constructed as linear combinations of non-orthogonal determinants.
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.