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

Tensor representation techniques for full configuration interaction: A Fock space approach using the canonical product format

Karl-Heinz Böhm, Alexander A. Auer, Mike Espig

Published Jun 22, 2016• 19 citations
Publisher

Abstract

In this proof-of-principle study, we apply tensor decomposition techniques to the Full Configuration Interaction (FCI) wavefunction in order to approximate the wavefunction parameters efficiently and to reduce the overall computational effort. For this purpose, the wavefunction ansatz is formulated in an occupation number vector representation that ensures antisymmetry. If the canonical product format tensor decomposition is then applied, the Hamiltonian and the wavefunction can be cast into a multilinear product form. As a consequence, the number of wavefunction parameters does not scale to the power of the number of particles (or orbitals) but depends on the rank of the approximation and linearly on the number of particles. The degree of approximation can be controlled by a single threshold for the rank reduction procedure required in the algorithm. We demonstrate that using this approximation, the FCI Hamiltonian matrix can be stored with N(5) scaling. The error of the approximation that is introduced is below Millihartree for a threshold of ϵ = 10(-4) and no convergence problems are observed solving the FCI equations iteratively in the new format. While promising conceptually, all effort of the algorithm is shifted to the required rank reduction procedure after the contraction of the Hamiltonian with the coefficient tensor. At the current state, this crucial step is the bottleneck of our approach and even for an optimistic estimate, the algorithm scales beyond N(10) and future work has to be directed towards reduction-free algorithms.

DOI
10.1063/1.4953665

Related papers

Tensor representation techniques in post-Hartree–Fock methods: matrix product state tensor format

Udo Benedikt, Henry Auer, Mike Espig +2 more

In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational effort for tensor manipulations as they occur in typical post-Hartree–Fock (post-HF) methods. A successive tensor decomposition/rank reduction scheme in the matrix product state (MPS) format for the two-electron integrals in the AO and MO bases and an estimate of the t 2 amplitudes as obtained from second-order many-body perturbation theory (MP2) are described. Furthermore, the AO–MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low-rank MPS representation for the tensor contractions in coupled cluster theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational effort for tensor contractions in post-HF methods can be reduced to roughly N 4 while the decomposition itself scales as N 5. While efficient algorithms with low prefactor for the tensor decomposition have yet to be devised, this ansatz offers the possibility to find a robust approximation with low-scaling behaviour with system and basis-set size for post-HF ab initio methods.

Molecular Physics•Apr 29, 2013•25 citations

RESEARCH ARTICLE Tensor Representation Techniques in post-Hartree Fock Methods: Matrix Product State Tensor Format

Udo Benedikt, Henry Auer, Mike Espig +2 more

;In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational eort for tensor manipulations as they occur in typical post Hartree-Fock methods. A successive tensor decomposition / rank reduction scheme in the matrix product state (MPS) format for the two electron integrals in the AO and MO basis and an estimate of the t2 amplitudes as obtained from MP2 are described. Furthermore, the AO-MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low rank MPS representation for the tensor contractions in CC theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational eort for tensor contractions in post-HF methods can be reduced to roughly N4 while the decomposition itself scales as N5. While ecient algorithms with low prefactor for the tensor decomposition have yet to be devised, this Ansatz oers the possibility to nd a robust approximation with low scaling behaviour with system and basis set size for post Hartree Fock ab initio methods.

•Jan 1, 2013•0 citations

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

Low-Rank Tensor Approximation in post Hartree-Fock Methods

Udo Benedikt

In this thesis the application of novel tensor decomposition and tensor representation techniques in highly accurate post Hartree-Fock methods is evaluated. These representation techniques can help to overcome the steep scaling behaviour of high level ab-initio calculations with increasing system size and therefore break the "curse of dimensionality". After a comparison of various tensor formats the application of the "canonical polyadic" format (CP) is described in detail. There, especially the casting of a normal, index based tensor into the CP format (tensor decomposition) and a method for a low rank approximation (rank reduction) of the two-electron integrals in the AO basis are investigated. The decisive quantity for the applicability of the CP format is the scaling of the rank with increasing system and basis set size. The memory requirements and the computational effort for tensor manipulations in the CP format are only linear in the number of dimensions but still depend on the expansion length (rank) of the approximation. Furthermore, the AO-MO transformation and a MP2 algorithm with decomposed tensors in the CP format is evaluated and the scaling with increasing system and basis set size is investigated. Finally, a Coupled-Cluster algorithm based only on low-rank CP representation of the MO integrals is developed. There, especially the successive tensor contraction during the iterative solution of the amplitude equations and the error propagation upon multiple application of the reduction procedure are discussed. In conclusion the overall complexity of a Coupled-Cluster procedure with tensors in CP format is evaluated and some possibilities for improvements of the rank reduction procedure tailored to the needs in electronic structure calculations are shown.

•May 15, 2013•2 citations

Tensor decomposition in post-Hartree–Fock methods. II. CCD implementation

Udo Benedikt, Karl-Heinz Böhm, Alexander A. Auer

In a previous publication, we have discussed the usage of tensor decomposition in the canonical polyadic (CP) tensor format for electronic structure methods. There, we focused on two-electron integrals and second order Møller-Plesset perturbation theory (MP2). In this work, we discuss the CP format for Coupled Cluster (CC) theory and present a pilot implementation for the Coupled Cluster Doubles method. We discuss the iterative solution of the CC amplitude equations using tensors in CP representation and present a tensor contraction scheme that minimizes the effort necessary for the rank reductions during the iterations. Furthermore, several details concerning the reduction of complexity of the algorithm, convergence of the CC iterations, truncation errors, and the choice of threshold for chemical accuracy are discussed.

The Journal of Chemical Physics•Dec 9, 2013•56 citations

Tensor-decomposition techniques for ab initio nuclear structure calculations: From chiral nuclear potentials to ground-state energies

A. Tichai, Roman Schutski, Gustavo E. Scuseria +1 more

Background: The computational resources needed to generate the ab initio solution of the nuclear many-body problem for increasing mass number and/or accuracy necessitates innovative developments to improve upon (i) the storage of many-body operators and (ii) the scaling of many-body methods used to evaluate nuclear observables. The storing and efficient handling of many-body operators with high particle ranks is currently one of the major bottlenecks limiting the applicability range of ab initio studies with respect to mass number and accuracy. Recently, the application of tensor decomposition techniques to many-body tensors has proven highly beneficial to reduce the computational cost of ab initio calculations in quantum chemistry and solid-state physics.Purpose: The impact of applying state-of-the-art tensor factorization techniques to modern nuclear Hamiltonians derived from chiral effective field theory is investigated. Subsequently, the error induced by the tensor decomposition of the input Hamiltonian on ground-state energies of closed-shell nuclei calculated via second-order many-body perturbation theory is benchmarked.Methods: The first proof-of-principles application of tensor-decomposition techniques to the nuclear Hamiltonian is performed. Two different tensor formats are investigated by systematically benchmarking the approximation error on matrix elements stored in various bases of interest. The analysis is achieved while including normal-ordered three-nucleon interactions that are nowadays used as input to the most advanced ab initio calculations in medium-mass nuclei. With the aid of the factorized Hamiltonian, the second-order perturbative correction to ground-state energies is decomposed and the scaling properties of the underlying tensor network are discussed.Results: The employed tensor formats are found to lead to an efficient data compression of two-body matrix elements of the nuclear Hamiltonian. In particular, the sophisticated tensor hypercontraction scheme yields low tensor ranks with respect to both harmonic-oscillator and Hartree-Fock single-particle bases. It is found that the tensor rank depends on the two-body total angular momentum $J$ for which one performs the decomposition, which is itself directly related to the sparsity of the corresponding tensor. Furthermore, including normal-ordered two-body contributions originating from three-body interactions does not compromise the efficient data compression. Ultimately, the use of factorized matrix elements authorizes controlled approximations of the exact second-order ground-state energy corrections. In particular, a small enough error is obtained from low-rank factorizations in $^{4}\mathrm{He},^{16}\mathrm{O}$, and $^{40}\mathrm{Ca}$.Conclusions: It is presently demonstrated that tensor-decomposition techniques can be efficiently applied to systematically approximate the nuclear many-body Hamiltonian in terms of lower-rank tensors. Beyond the input Hamiltonian, tensor-decomposition techniques can be envisioned to scale down the cost of state-of-the-art nonperturbative many-body methods in order to extend ab initio studies to (i) higher precisions, (ii) larger masses, and (iii) nuclei of doubly open-shell character.

arXiv:1810.08419•Physical Review C•Mar 18, 2019•22 citations
In this proof-of-principle study, we apply tensor decomposition techniques to the Full Configuration Interaction (FCI) wavefunction in order to approximate the wavefunction parameters efficiently and to reduce the overall computational effort. For this purpose, the wavefunction ansatz is formulated in an occupation number vector representation that ensures antisymmetry. If the canonical product format tensor decomposition is then applied, the Hamiltonian and the wavefunction can be cast into a multilinear product form. As a consequence, the number of wavefunction parameters does not scale to the power of the number of particles (or orbitals) but depends on the rank of the approximation and linearly on the number of particles. The degree of approximation can be controlled by a single threshold for the rank reduction procedure required in the algorithm. We demonstrate that using this approximation, the FCI Hamiltonian matrix can be stored with N(5) scaling. The error of the approximation that is introduced is below Millihartree for a threshold of ϵ = 10(-4) and no convergence problems are observed solving the FCI equations iteratively in the new format. While promising conceptually, all effort of the algorithm is shifted to the required rank reduction procedure after the contraction of the Hamiltonian with the coefficient tensor. At the current state, this crucial step is the bottleneck of our approach and even for an optimistic estimate, the algorithm scales beyond N(10) and future work has to be directed towards reduction-free algorithms.
In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational effort for tensor manipulations as they occur in typical post-Hartree–Fock (post-HF) methods. A successive tensor decomposition/rank reduction scheme in the matrix product state (MPS) format for the two-electron integrals in the AO and MO bases and an estimate of the t 2 amplitudes as obtained from second-order many-body perturbation theory (MP2) are described. Furthermore, the AO–MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low-rank MPS representation for the tensor contractions in coupled cluster theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational effort for tensor contractions in post-HF methods can be reduced to roughly N 4 while the decomposition itself scales as N 5. While efficient algorithms with low prefactor for the tensor decomposition have yet to be devised, this ansatz offers the possibility to find a robust approximation with low-scaling behaviour with system and basis-set size for post-HF ab initio methods.
;In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational eort for tensor manipulations as they occur in typical post Hartree-Fock methods. A successive tensor decomposition / rank reduction scheme in the matrix product state (MPS) format for the two electron integrals in the AO and MO basis and an estimate of the t2 amplitudes as obtained from MP2 are described. Furthermore, the AO-MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low rank MPS representation for the tensor contractions in CC theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational eort for tensor contractions in post-HF methods can be reduced to roughly N4 while the decomposition itself scales as N5. While ecient algorithms with low prefactor for the tensor decomposition have yet to be devised, this Ansatz oers the possibility to nd a robust approximation with low scaling behaviour with system and basis set size for post Hartree Fock ab initio methods.
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.
In this thesis the application of novel tensor decomposition and tensor representation techniques in highly accurate post Hartree-Fock methods is evaluated. These representation techniques can help to overcome the steep scaling behaviour of high level ab-initio calculations with increasing system size and therefore break the "curse of dimensionality". After a comparison of various tensor formats the application of the "canonical polyadic" format (CP) is described in detail. There, especially the casting of a normal, index based tensor into the CP format (tensor decomposition) and a method for a low rank approximation (rank reduction) of the two-electron integrals in the AO basis are investigated. The decisive quantity for the applicability of the CP format is the scaling of the rank with increasing system and basis set size. The memory requirements and the computational effort for tensor manipulations in the CP format are only linear in the number of dimensions but still depend on the expansion length (rank) of the approximation. Furthermore, the AO-MO transformation and a MP2 algorithm with decomposed tensors in the CP format is evaluated and the scaling with increasing system and basis set size is investigated. Finally, a Coupled-Cluster algorithm based only on low-rank CP representation of the MO integrals is developed. There, especially the successive tensor contraction during the iterative solution of the amplitude equations and the error propagation upon multiple application of the reduction procedure are discussed. In conclusion the overall complexity of a Coupled-Cluster procedure with tensors in CP format is evaluated and some possibilities for improvements of the rank reduction procedure tailored to the needs in electronic structure calculations are shown.
In a previous publication, we have discussed the usage of tensor decomposition in the canonical polyadic (CP) tensor format for electronic structure methods. There, we focused on two-electron integrals and second order Møller-Plesset perturbation theory (MP2). In this work, we discuss the CP format for Coupled Cluster (CC) theory and present a pilot implementation for the Coupled Cluster Doubles method. We discuss the iterative solution of the CC amplitude equations using tensors in CP representation and present a tensor contraction scheme that minimizes the effort necessary for the rank reductions during the iterations. Furthermore, several details concerning the reduction of complexity of the algorithm, convergence of the CC iterations, truncation errors, and the choice of threshold for chemical accuracy are discussed.
Background: The computational resources needed to generate the ab initio solution of the nuclear many-body problem for increasing mass number and/or accuracy necessitates innovative developments to improve upon (i) the storage of many-body operators and (ii) the scaling of many-body methods used to evaluate nuclear observables. The storing and efficient handling of many-body operators with high particle ranks is currently one of the major bottlenecks limiting the applicability range of ab initio studies with respect to mass number and accuracy. Recently, the application of tensor decomposition techniques to many-body tensors has proven highly beneficial to reduce the computational cost of ab initio calculations in quantum chemistry and solid-state physics.Purpose: The impact of applying state-of-the-art tensor factorization techniques to modern nuclear Hamiltonians derived from chiral effective field theory is investigated. Subsequently, the error induced by the tensor decomposition of the input Hamiltonian on ground-state energies of closed-shell nuclei calculated via second-order many-body perturbation theory is benchmarked.Methods: The first proof-of-principles application of tensor-decomposition techniques to the nuclear Hamiltonian is performed. Two different tensor formats are investigated by systematically benchmarking the approximation error on matrix elements stored in various bases of interest. The analysis is achieved while including normal-ordered three-nucleon interactions that are nowadays used as input to the most advanced ab initio calculations in medium-mass nuclei. With the aid of the factorized Hamiltonian, the second-order perturbative correction to ground-state energies is decomposed and the scaling properties of the underlying tensor network are discussed.Results: The employed tensor formats are found to lead to an efficient data compression of two-body matrix elements of the nuclear Hamiltonian. In particular, the sophisticated tensor hypercontraction scheme yields low tensor ranks with respect to both harmonic-oscillator and Hartree-Fock single-particle bases. It is found that the tensor rank depends on the two-body total angular momentum JJJ for which one performs the decomposition, which is itself directly related to the sparsity of the corresponding tensor. Furthermore, including normal-ordered two-body contributions originating from three-body interactions does not compromise the efficient data compression. Ultimately, the use of factorized matrix elements authorizes controlled approximations of the exact second-order ground-state energy corrections. In particular, a small enough error is obtained from low-rank factorizations in 4He,16O^{4}\mathrm{He},^{16}\mathrm{O}4He,16O, and 40Ca^{40}\mathrm{Ca}40Ca.Conclusions: It is presently demonstrated that tensor-decomposition techniques can be efficiently applied to systematically approximate the nuclear many-body Hamiltonian in terms of lower-rank tensors. Beyond the input Hamiltonian, tensor-decomposition techniques can be envisioned to scale down the cost of state-of-the-art nonperturbative many-body methods in order to extend ab initio studies to (i) higher precisions, (ii) larger masses, and (iii) nuclei of doubly open-shell character.