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

The Journal of Chemical Physics

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

Peter R. Taylor

Published Aug 19, 2013• 8 citations
Publisher

Abstract

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.

DOI
10.1063/1.4816769

Related papers

Efficient and scalable wave function compression using corner hierarchical matrices

Kenneth O. Berard, Hongji Gao, Alexander Teplukhin +2 more

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.

arXiv:2407.21134•The Journal of Chemical Physics•Nov 25, 2024•2 citations

Compression of Pure and Mixed States in Quantum Detection

Gianfranco Cariolaro, Roberto Corvaja, Gianfranco L. Pierobon

Quantum detection in an N-dimensional Hilbert space H involves quantum states and corresponding measure ment operators which span an r-dimensional subspace U of H, with r ≤ N. Quantum detection could be restricted to this subspace, but the operations in U are still redundant, since the kets have N components. By applying the singular-value decomposition to the state matrix, it is possible to perform a compression from the subspace U onto a "compressed" space U̅, where the redundancy is removed and kets are represented by r components. The detection can be perfectly reformulated in the "compressed" space, without loss of information, with a greatly reduced complexity. The compression is particularly attractive when r ≪ N, as shown with an example of application to quantum optical communications.

Globecom•Dec 1, 2011•10 citations

Singular value decomposition approach for the approximate coupled-cluster method

Tomoko Kinoshita, Osamu Hino, Rodney J. Bartlett

We present a method for the approximate solution of the coupled-cluster (CC) equation, based upon the singular value decomposition (SVD). The key idea of this method is that we use SVD for the cluster amplitudes to exploit the physically important states in the CC equation. This method enables us to significantly reduce the computational requirements for CC calculations without losing the essence of the method. Relationships to the density matrix renormalization group theory and the local correlation methods are mentioned. We perform pilot calculations on some atoms and molecules to investigate the applicability of the method.

The Journal of Chemical Physics•Oct 15, 2003•87 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•7 citations

Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix

Borzu Toloui, Peter J. Love

Quantum chemistry provides a target for quantum simulation of considerable scientific interest and industrial importance. The majority of algorithms to date have been based on a second-quantized representation of the electronic structure Hamiltonian - necessitating qubit requirements that scale linearly with the number of orbitals. The scaling of the number of gates for such methods, while polynomial, presents some serious experimental challenges. However, because the number of electrons is a good quantum number for the electronic structure problem it is unnecessary to store the full Fock space of the orbitals. Representation of the wave function in a basis of Slater determinants for fixed electron number suffices. However, to date techniques for the quantum simulation of the Hamiltonian represented in this basis - the CI-matrix - have been lacking. We show how to apply techniques developed for the simulation of sparse Hamiltonians to the CI-matrix. We prove a number of results exploiting the structure of the CI-matrix, arising from the Slater rules which define it, to improve the application of sparse Hamiltonian simulation techniques in this case. We show that it is possible to use the minimal number of qubits to represent the wavefunction, and that these methods can offer improved scaling in the number of gates required in the limit of fixed electron number and increasing basis set size relevant for high-accuracy calculations. We hope these results open the door to further investigation of sparse Hamiltonian simulation techniques in the context of the quantum simulation of quantum chemistry.

arXiv:1312.2579•Dec 9, 2013•72 citations

Adaptive Dimensional Decoupling for Compression of Quantum Nuclear Wave Functions and Efficient Potential Energy Surface Representations through Tensor Network Decomposition

Nicole DeGregorio, Srinivasan S. Iyengar

We present an approach to reduce the computational complexity and storage pertaining to quantum nuclear wave functions and potential energy surfaces. The method utilizes tensor networks implemented through sequential singular value decompositions. Two specific forms of tensor networks are considered to adaptively compress the data in multidimensional quantum nuclear wave functions and potential energy surfaces. In one case the well-known matrix product state approximation is used whereas in another case the wave function and potential energy surface space is initially partitioned into "system" and "bath" degrees of freedom through singular value decomposition, following which the individual system and bath tensors (wave functions and potentials) are in turn decomposed as matrix product states. We postulate that this leads to a mean-field version of the well-known projectionally entangled pair state known in the tensor networks community. Both formulations appear as special cases of more general higher order singular value decompositions known in the mathematics literature as Tucker decomposition. The networks are then used to study the hydrogen transfer step in the oxidation of isoprene by peroxy and hydroxy radicals. We find that both networks are extremely efficient in accurately representing quantum nuclear eigenstates and potential energy surfaces and in computing inner products between quantum nuclear eigenstates and a final-state basis to yield product side probabilities. We also present formal protocols that will be useful to perform explicit quantum nuclear dynamics.

Journal of Chemical Theory and Computation•Apr 19, 2019•14 citations
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 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.
Quantum detection in an N-dimensional Hilbert space H involves quantum states and corresponding measure ment operators which span an r-dimensional subspace U of H, with r ≤ N. Quantum detection could be restricted to this subspace, but the operations in U are still redundant, since the kets have N components. By applying the singular-value decomposition to the state matrix, it is possible to perform a compression from the subspace U onto a "compressed" space U̅, where the redundancy is removed and kets are represented by r components. The detection can be perfectly reformulated in the "compressed" space, without loss of information, with a greatly reduced complexity. The compression is particularly attractive when r ≪ N, as shown with an example of application to quantum optical communications.
We present a method for the approximate solution of the coupled-cluster (CC) equation, based upon the singular value decomposition (SVD). The key idea of this method is that we use SVD for the cluster amplitudes to exploit the physically important states in the CC equation. This method enables us to significantly reduce the computational requirements for CC calculations without losing the essence of the method. Relationships to the density matrix renormalization group theory and the local correlation methods are mentioned. We perform pilot calculations on some atoms and molecules to investigate the applicability of the method.
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.
Quantum chemistry provides a target for quantum simulation of considerable scientific interest and industrial importance. The majority of algorithms to date have been based on a second-quantized representation of the electronic structure Hamiltonian - necessitating qubit requirements that scale linearly with the number of orbitals. The scaling of the number of gates for such methods, while polynomial, presents some serious experimental challenges. However, because the number of electrons is a good quantum number for the electronic structure problem it is unnecessary to store the full Fock space of the orbitals. Representation of the wave function in a basis of Slater determinants for fixed electron number suffices. However, to date techniques for the quantum simulation of the Hamiltonian represented in this basis - the CI-matrix - have been lacking. We show how to apply techniques developed for the simulation of sparse Hamiltonians to the CI-matrix. We prove a number of results exploiting the structure of the CI-matrix, arising from the Slater rules which define it, to improve the application of sparse Hamiltonian simulation techniques in this case. We show that it is possible to use the minimal number of qubits to represent the wavefunction, and that these methods can offer improved scaling in the number of gates required in the limit of fixed electron number and increasing basis set size relevant for high-accuracy calculations. We hope these results open the door to further investigation of sparse Hamiltonian simulation techniques in the context of the quantum simulation of quantum chemistry.
We present an approach to reduce the computational complexity and storage pertaining to quantum nuclear wave functions and potential energy surfaces. The method utilizes tensor networks implemented through sequential singular value decompositions. Two specific forms of tensor networks are considered to adaptively compress the data in multidimensional quantum nuclear wave functions and potential energy surfaces. In one case the well-known matrix product state approximation is used whereas in another case the wave function and potential energy surface space is initially partitioned into "system" and "bath" degrees of freedom through singular value decomposition, following which the individual system and bath tensors (wave functions and potentials) are in turn decomposed as matrix product states. We postulate that this leads to a mean-field version of the well-known projectionally entangled pair state known in the tensor networks community. Both formulations appear as special cases of more general higher order singular value decompositions known in the mathematics literature as Tucker decomposition. The networks are then used to study the hydrogen transfer step in the oxidation of isoprene by peroxy and hydroxy radicals. We find that both networks are extremely efficient in accurately representing quantum nuclear eigenstates and potential energy surfaces and in computing inner products between quantum nuclear eigenstates and a final-state basis to yield product side probabilities. We also present formal protocols that will be useful to perform explicit quantum nuclear dynamics.