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

Tensor Decomposition in post-Hartree Fock Methods.

Udo Benedikt, Alexander A. Auer, Mike Espig, Wolfgang Hackbusch

Published Oct 26, 2010• 10 citations
OpenAlex

Related papers

Computational Nuclear Physics and Post Hartree-Fock Methods

Justin G. Lietz, Samuel J. Novario, G. R. Jansen +2 more

arXiv:1611.06765•Lecture notes in physics•Jan 1, 2017•10 citations

Tensor Approach to Linearized Hartree-Fock Equation for Lattice-type and Periodic Systems

Venera Khoromskaia, Boris N. Khoromskij

•Jun 19, 2014•7 citations

Post Hartree-Fock II: coupled cluster

Qiming Sun

Theoretical and computational chemistry•Jan 1, 2025•0 citations

Post-Hartree–Fock method in quantum chemistry for quantum computer

Yutaka Shikano, Hiroshi C. Watanabe, Ken M. Nakanishi +1 more

arXiv:2011.01544•The European Physical Journal Special Topics•Apr 26, 2021•20 citations

Post Hartree-Fock I: full configuration interaction

Qiming Sun

Theoretical and computational chemistry•Jan 1, 2025•0 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
;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.