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:2407.21134 · The Journal of Chemical Physics

Efficient and scalable wave function compression using corner hierarchical matrices

Kenneth O. Berard, Hongji Gao, Alexander Teplukhin, Xiangmin Jiao, Benjamin G. Levine

Published Nov 25, 2024• 2 citations
arXivHTMLPDF

Abstract

The exponential scaling of complete active space and full configuration interaction (CI) calculations limits the ability of quantum chemists to simulate the electronic structures of strongly correlated systems. Herein, we present corner hierarchically approximated CI (CHACI), an approach to wave function compression based on corner hierarchical matrices (CH-matrices)-a new variant of hierarchical matrices based on block-wise low-rank decomposition. By application to dodecacene, a strongly correlated molecule, we demonstrate that CH matrix compression provides superior compression compared to truncated global singular value decomposition. The compression ratio is shown to improve with increasing active space size. By comparison of several alternative schemes, we demonstrate that superior compression is achieved by (a) using a blocking approach that emphasizes the upper-left corner of the CI vector, (b) sorting the CI vector prior to compression, and (c) optimizing the rank of each block to maximize information density.

DOI
10.1063/5.0231409

Related papers

Lossless compression of wave function information using matrix factorization: A “gzip” for quantum chemistry

Peter R. Taylor

We propose the use of the singular value decomposition to decrease the storage required for wave function information. The specific case considered is determinantal full configuration interaction, but the same technique is readily applicable to truncated configuration interaction and coupled-cluster calculations of various types; as we discuss this is a reformulation of approximate methods that have been in use for some time, but our approach eliminates those approximations. Numerical examples support the contention that considerable compression of the wave function is possible without significant loss of accuracy: as expected a considerable amount of the information contained in the full CI wave function is redundant.

The Journal of Chemical Physics•Aug 19, 2013•8 citations

Efficient Pauli Operator Generation via Hierarchical Matrix Compression for Quantum-Ready Electromagnetic Solvers

Noora Al-Sultani, Su Yan

Quantum linear solvers require expressing the system matrix as a sum of Pauli operators, a process whose computational cost scales exponentially with problem size. For electromagnetic integral equations discretized by the method of moments (MoM), the resulting dense impedance matrices pose a significant challenge for quantum operator generation. This paper demonstrates that hierarchical matrix$(\mathcal{H}$-matrix) compression provides an effective mechanism for reducing Pauli operator complexity. By restricting Pauli decomposition to low-rank far-field blocks identified through$\mathcal{H}$-matrix partitioning, the number of significant Pauli terms is reduced by over 95% compared to full-matrix decomposition, while maintaining approximation accuracy on the order of 10−5in relative Frobenius norm. Numerical experiments on a spherical scatterer confirm that the proposed block-wise approach offers a practical pathway toward quantum-compatible formulations of large-scale electromagnetic problems.

Digest - IEEE Antennas and Propagation Society. International Symposium•Jul 1, 2026•0 citations

Exploring Hilbert space on a budget: Novel benchmark set and performance metric for testing electronic structure methods in the regime of strong correlation

Nicholas H. Stair, Francesco A. Evangelista

This work explores the ability of classical electronic structure methods to efficiently represent (compress) the information content of full configuration interaction (FCI) wave functions. We introduce a benchmark set of four hydrogen model systems of different dimensionalities and distinctive electronic structures: a 1D chain, a 1D ring, a 2D triangular lattice, and a 3D close-packed pyramid. To assess the ability of a computational method to produce accurate and compact wave functions, we introduce the accuracy volume, a metric that measures the number of variational parameters necessary to achieve a target energy error. Using this metric and the hydrogen models, we examine the performance of three classical deterministic methods: (i) selected configuration interaction (sCI) realized both via an a posteriori (ap-sCI) and variational selection of the most important determinants, (ii) an a posteriori singular value decomposition (SVD) of the FCI tensor (SVD-FCI), and (iii) the matrix product state representation obtained via the density matrix renormalization group (DMRG). We find that the DMRG generally gives the most efficient wave function representation for all systems, particularly in the 1D chain with a localized basis. For the 2D and 3D systems, all methods (except DMRG) perform best with a delocalized basis, and the efficiency of sCI and SVD-FCI is closer to that of DMRG. For larger analogs of the models, the DMRG consistently requires the fewest parameters but still scales exponentially in 2D and 3D systems, and the performance of SVD-FCI is essentially equivalent to that of ap-sCI.

arXiv:2005.11349•The Journal of Chemical Physics•Sep 9, 2020•28 citations

Beyond Sparsity: Quantum Block Encoding for Dense Matrices via Hierarchically Low Rank Compression

Kun Tang, Jun Lai

While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad class of structured dense matrices arise in potential theory, covariance modeling, and computational physics, namely, hierarchically block separable (HBS) matrices. We develop two distinct methods to make these systems amenable to quantum solvers. The first is a pre-processing approach that transforms the dense matrix into a larger but sparse format. The second is a direct block encoding scheme that recursively constructs the necessary oracles from the HBS structure. We provide a detailed complexity analysis and rigorous error bounds for both methods. Numerical experiments are presented to validate the effectiveness of our approaches.

quant-pharXiv:2602.09745•Feb 11, 2026•0 citations

Low-rank compression of two-electron reduced density matrices

Kemal Atalar, Hugh G. A. Burton, Andreas Grüneis +1 more

Two-body reduced density matrices (2RDMs) encode the essential two-electron physics of electronic states, but their quartic storage cost poses a major limitation in practical workflows. We investigate a simple protocol to compress both transition and non-transition 2RDMs into a lower-rank representation that preserves their wedge-product structure and physical symmetries under truncation. The resulting decomposition couples Coulomb and exchange channels through a common set of low-rank factors, yielding a more compact rank-sparse representation than single-channel factorizations. For correlated states, the effective rank scales linearly with system size, achieving a $\sim99$\% compression for the coupled-cluster 2RDM of octane while retaining chemical accuracy. We apply this to the recently introduced {\em ab initio} eigenvector continuation workflows, where many-body wave functions are interpolated across nuclear geometries with mean-field cost. Here, 2RDMs between training states act as projectors into a subspace but their memory scaling limits applications to larger systems. The compression scheme reduces the memory cost from quartic to quadratic for a fixed error per electron. Metrics to systematically control the decomposition are investigated, enabling statistically resolved structural, dynamical and spectroscopic observables from nonadiabatic molecular dynamics simulations of photoexcited H$_{28}$ chains, interpolating from compressed near-exact DMRG training data. This establishes these structure-preserving compressed intermediates for practical correlated electronic structure workflows.

physics.chem-phCross-listedarXiv:2605.11253•May 13, 2026•0 citations

Block-encoding dense and full-rank kernels using hierarchical matrices: applications in quantum numerical linear algebra

Quynh T. Nguyen, Bobak T. Kiani, Seth Lloyd

Many quantum algorithms for numerical linear algebra assume black-box access to a block-encoding of the matrix of interest, which is a strong assumption when the matrix is not sparse. Kernel matrices, which arise from discretizing a kernel function k(x,x′) , have a variety of applications in mathematics and engineering. They are generally dense and full-rank. Classically, the celebrated fast multipole method performs matrix multiplication on kernel matrices of dimension N in time almost linear in N by using the linear algebraic framework of hierarchical matrices. In light of this success, we propose a block-encoding scheme of the hierarchical matrix structure on a quantum computer. When applied to many physical kernel matrices, our method can improve the runtime of solving quantum linear systems of dimension N to O(κpolylog⁡(Nε)) , where κ and ε are the condition number and error bound of the matrix operation. This runtime is near-optimal and, in terms of N , exponentially improves over prior quantum linear systems algorithms in the case of dense and full-rank kernel matrices. We discuss possible applications of our methodology in solving integral equations and accelerating computations in N-body problems.

arXiv:2201.11329•Quantum•Dec 13, 2022•25 citations
The exponential scaling of complete active space and full configuration interaction (CI) calculations limits the ability of quantum chemists to simulate the electronic structures of strongly correlated systems. Herein, we present corner hierarchically approximated CI (CHACI), an approach to wave function compression based on corner hierarchical matrices (CH-matrices)-a new variant of hierarchical matrices based on block-wise low-rank decomposition. By application to dodecacene, a strongly correlated molecule, we demonstrate that CH matrix compression provides superior compression compared to truncated global singular value decomposition. The compression ratio is shown to improve with increasing active space size. By comparison of several alternative schemes, we demonstrate that superior compression is achieved by (a) using a blocking approach that emphasizes the upper-left corner of the CI vector, (b) sorting the CI vector prior to compression, and (c) optimizing the rank of each block to maximize information density.
We propose the use of the singular value decomposition to decrease the storage required for wave function information. The specific case considered is determinantal full configuration interaction, but the same technique is readily applicable to truncated configuration interaction and coupled-cluster calculations of various types; as we discuss this is a reformulation of approximate methods that have been in use for some time, but our approach eliminates those approximations. Numerical examples support the contention that considerable compression of the wave function is possible without significant loss of accuracy: as expected a considerable amount of the information contained in the full CI wave function is redundant.
Quantum linear solvers require expressing the system matrix as a sum of Pauli operators, a process whose computational cost scales exponentially with problem size. For electromagnetic integral equations discretized by the method of moments (MoM), the resulting dense impedance matrices pose a significant challenge for quantum operator generation. This paper demonstrates that hierarchical matrix(H(\mathcal{H}(H-matrix) compression provides an effective mechanism for reducing Pauli operator complexity. By restricting Pauli decomposition to low-rank far-field blocks identified throughH\mathcal{H}H-matrix partitioning, the number of significant Pauli terms is reduced by over 95% compared to full-matrix decomposition, while maintaining approximation accuracy on the order of 10−5in relative Frobenius norm. Numerical experiments on a spherical scatterer confirm that the proposed block-wise approach offers a practical pathway toward quantum-compatible formulations of large-scale electromagnetic problems.
This work explores the ability of classical electronic structure methods to efficiently represent (compress) the information content of full configuration interaction (FCI) wave functions. We introduce a benchmark set of four hydrogen model systems of different dimensionalities and distinctive electronic structures: a 1D chain, a 1D ring, a 2D triangular lattice, and a 3D close-packed pyramid. To assess the ability of a computational method to produce accurate and compact wave functions, we introduce the accuracy volume, a metric that measures the number of variational parameters necessary to achieve a target energy error. Using this metric and the hydrogen models, we examine the performance of three classical deterministic methods: (i) selected configuration interaction (sCI) realized both via an a posteriori (ap-sCI) and variational selection of the most important determinants, (ii) an a posteriori singular value decomposition (SVD) of the FCI tensor (SVD-FCI), and (iii) the matrix product state representation obtained via the density matrix renormalization group (DMRG). We find that the DMRG generally gives the most efficient wave function representation for all systems, particularly in the 1D chain with a localized basis. For the 2D and 3D systems, all methods (except DMRG) perform best with a delocalized basis, and the efficiency of sCI and SVD-FCI is closer to that of DMRG. For larger analogs of the models, the DMRG consistently requires the fewest parameters but still scales exponentially in 2D and 3D systems, and the performance of SVD-FCI is essentially equivalent to that of ap-sCI.
While quantum algorithms for solving large scale systems of linear equations offer potentially exponential speedups, their application has largely been confined to sparse matrices. This work extends the scope of these algorithms to a broad class of structured dense matrices arise in potential theory, covariance modeling, and computational physics, namely, hierarchically block separable (HBS) matrices. We develop two distinct methods to make these systems amenable to quantum solvers. The first is a pre-processing approach that transforms the dense matrix into a larger but sparse format. The second is a direct block encoding scheme that recursively constructs the necessary oracles from the HBS structure. We provide a detailed complexity analysis and rigorous error bounds for both methods. Numerical experiments are presented to validate the effectiveness of our approaches.
Two-body reduced density matrices (2RDMs) encode the essential two-electron physics of electronic states, but their quartic storage cost poses a major limitation in practical workflows. We investigate a simple protocol to compress both transition and non-transition 2RDMs into a lower-rank representation that preserves their wedge-product structure and physical symmetries under truncation. The resulting decomposition couples Coulomb and exchange channels through a common set of low-rank factors, yielding a more compact rank-sparse representation than single-channel factorizations. For correlated states, the effective rank scales linearly with system size, achieving a ∼99\sim99∼99\% compression for the coupled-cluster 2RDM of octane while retaining chemical accuracy. We apply this to the recently introduced {\em ab initio} eigenvector continuation workflows, where many-body wave functions are interpolated across nuclear geometries with mean-field cost. Here, 2RDMs between training states act as projectors into a subspace but their memory scaling limits applications to larger systems. The compression scheme reduces the memory cost from quartic to quadratic for a fixed error per electron. Metrics to systematically control the decomposition are investigated, enabling statistically resolved structural, dynamical and spectroscopic observables from nonadiabatic molecular dynamics simulations of photoexcited H28_{28}28​ chains, interpolating from compressed near-exact DMRG training data. This establishes these structure-preserving compressed intermediates for practical correlated electronic structure workflows.
Many quantum algorithms for numerical linear algebra assume black-box access to a block-encoding of the matrix of interest, which is a strong assumption when the matrix is not sparse. Kernel matrices, which arise from discretizing a kernel function k(x,x′) , have a variety of applications in mathematics and engineering. They are generally dense and full-rank. Classically, the celebrated fast multipole method performs matrix multiplication on kernel matrices of dimension N in time almost linear in N by using the linear algebraic framework of hierarchical matrices. In light of this success, we propose a block-encoding scheme of the hierarchical matrix structure on a quantum computer. When applied to many physical kernel matrices, our method can improve the runtime of solving quantum linear systems of dimension N to O(κpolylog⁡(Nε)) , where κ and ε are the condition number and error bound of the matrix operation. This runtime is near-optimal and, in terms of N , exponentially improves over prior quantum linear systems algorithms in the case of dense and full-rank kernel matrices. We discuss possible applications of our methodology in solving integral equations and accelerating computations in N-body problems.