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:2409.12708 · Journal of Chemical Theory and Computation

Enhanced Krylov Methods for Molecular Hamiltonians: Reduced Memory Cost and Complexity Scaling via Tensor Hypercontraction

Yu Wang, Maxine Luo, Matthias Reumann, Christian B. Mendl

Published Jul 2, 2025• 1 citation
arXivHTMLPDF

Abstract

We introduce an algorithm that is simultaneously memory-efficient and low-scaling for applying ab initio molecular Hamiltonians to matrix-product states (MPS) via the tensor-hypercontraction (THC) format. These gains carry over to Krylov subspace methods, which can find low-lying eigenstates and simulate quantum time evolution while avoiding local minima and maintaining high accuracy. In our approach, the molecular Hamiltonian is represented as a sum of products of four MPOs, each with a bond dimension of only 2. Iteratively applying the MPOs to the current quantum state in MPS form, summing and recompressing the MPS leads to a scheme with the same asymptotic memory cost as the bare MPS and reduces the computational cost scaling compared to the Krylov method using a conventional MPO construction. We provide a detailed theoretical derivation of these statements and conduct supporting numerical experiments to demonstrate the advantage. Our algorithm is highly parallelizable and thus lends itself to large-scale HPC simulations.

DOI
10.1021/acs.jctc.5c00525

Related papers

Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction

Joonho Lee, Dominic William Berry, Craig Gidney +4 more

We describe quantum circuits with only O(N ) Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (e.g., molecular) orbitals.With O(λ/ ) repetitions of these circuits one can use phase estimation to sample in the molecular eigenbasis, where λ is the 1-norm of Hamiltonian coefficients and is the target precision.This is the lowest complexity shown for quantum computations of chemistry within an arbitrary basis.Furthermore, up to logarithmic factors, this matches the scaling of the most efficient prior block encodings that can work only with orthogonal-basis functions diagonalizing the Coloumb operator (e.g., the plane-wave dual basis).Our key insight is to factorize the Hamiltonian using a method known as tensor hypercontraction (THC) and then to transform the Coulomb operator into an isospectral diagonal form with a nonorthogonal basis defined by the THC factors.We then use qubitization to simulate the nonorthogonal THC Hamiltonian, in a fashion that avoids most complications of the nonorthogonal basis.We also reanalyze and reduce the cost of several of the best prior algorithms for these simulations in order to facilitate a clear comparison to the present work.In addition to having lower asymptotic scaling space-time volume, compilation of our algorithm for challenging finitesized molecules such as FeMoCo reveals that our method requires the least fault-tolerant resources of any known approach.By laying out and optimizing the surface-code resources required of our approach we show that FeMoCo can be simulated using about four million physical qubits and under 4 days of runtime, assuming 1-μs cycle times and physical gate-error rates no worse than 0.1%.

arXiv:2011.03494•PRX Quantum•Jul 8, 2021•383 citations

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•24 citations

Tensor hypercontracted ppRPA: Reducing the cost of the particle-particle random phase approximation from O(r 6) to O(r 4)

Neil Shenvi, Helen van Aggelen, Yang Yang +1 more

In recent years, interest in the random-phase approximation (RPA) has grown rapidly. At the same time, tensor hypercontraction has emerged as an intriguing method to reduce the computational cost of electronic structure algorithms. In this paper, we combine the particle-particle random phase approximation with tensor hypercontraction to produce the tensor-hypercontracted particle-particle RPA (THC-ppRPA) algorithm. Unlike previous implementations of ppRPA which scale as O(r(6)), the THC-ppRPA algorithm scales asymptotically as only O(r(4)), albeit with a much larger prefactor than the traditional algorithm. We apply THC-ppRPA to several model systems and show that it yields the same results as traditional ppRPA to within mH accuracy. Our method opens the door to the development of post-Kohn Sham functionals based on ppRPA without the excessive asymptotic cost of traditional ppRPA implementations.

The Journal of Chemical Physics•Jul 14, 2014•25 citations

Benchmarking Least-Squares Tensor Hypercontraction Techniques for Molecular Systems

Niklas Paulicks, Johannes Tölle

Finding a low-rank approximation for the two-electron integral (ERI) tensor is a crucial step towards reducing the computational cost of many-body electronic structure methods. In recent years, a range of new tensor factorization techniques, like the so-called tensor-hypercontraction (THC) approach, have been developed to achieve this goal. Unfortunately, a systematic comparison of accuracy and efficiency of different THC construction algorithms is missing. In this work, we address this gap by benchmarking these techniques across a wide range of molecular systems. In addition to offering useful insights into the advantages and disadvantages of the different techniques, we provide reference implementations in the newly developed open-source library, PyTHC.

arXiv:2608.17885•Aug 18, 2026•0 citations

Encoding a Many-Body Potential Energy Surface into a Grid-Based Matrix Product Operator

Kentaro Hino, Yuki Kurashige

An efficient algorithm for compressing a given many-body potential energy surface (PES) of molecular systems into a grid-based matrix product operator (MPO) is proposed. The PES is once represented by a full-dimensional or truncated many-body expansion form, which is obtained by ab initio calculations at each grid mesh point, and then all terms in the expansion are compressed and merged into a single MPO while maintaining the bond dimension of the MPO as small as possible. It was shown that the ab initio PES of the H 2 CO was compressed by more than 2 orders of magnitude in the size of the site operators without loss of accuracy. By the use of grid basis, the tensor rank of the site operators of the MPO is reduced from four to three due to the diagonal nature of the position-dependent operators on grid basis, which significantly reduces the computational cost of the tensor contractions required in the real and imaginary time evolution of the matrix product state (MPS) wave functions with the grid-based MPO (Grid-MPO) Hamiltonian. Similar to other grid-based methods, Grid-MPO is easily applicable to any kinds of potentials of molecular systems, such as analytical empirical model potentials expressed by position operators and ab initio potentials, if the values at the grid points are available. Using the Grid-MPO combined with the MPS, we calculated the time correlation function of the Eigen cation H 3 O + ( H 2 O ) 3 to predict the infrared spectrum and compared with the experimental and the previous theoretical studies. The actual scaling with the size of systems was examined for the multidimensional Henon–Heiles Hamiltonian. It was shown that the method is considerably accelerated by the graphic processing unit (GPU) because the sizes of site operators were kept small and all tensors were able to be stored on the VRAM of a GPU.

Journal of Chemical Theory and Computation•Apr 22, 2024•6 citations

Mirror subspace diagonalization: A real-time quantum Krylov algorithm with near-optimal sampling cost

Shota Kanasugi, Yuya O. Nakagawa, Norifumi Matsumoto +3 more

Quantum Krylov algorithms are a promising approach for ground-state energy estimation on near-term quantum computers. However, their sampling cost is inherently high because each Hamiltonian term is measured individually. Despite various mitigation techniques, this overhead remains a bottleneck for large-scale electronic structure problems. We introduce mirror subspace diagonalization (MSD), which approaches the theoretical lower bound on the sampling cost for quantum Krylov algorithms built upon real-time evolution. MSD uses a finite-difference formula to express the Hamiltonian as a linear combination of time-evolution unitaries with symmetrically shifted timesteps, enabling efficient estimation of the Hamiltonian matrix within the Krylov subspace. By optimizing the timestep and shifting the energy spectrum, finite-difference and statistical errors are minimized simultaneously, allowing MSD to attain the sampling-cost lower bound up to a logarithmic factor. We further apply classical post-processing to infer Hamiltonian moments, which mitigate the ground-state energy error via the Lanczos scheme. Our analysis shows MSD is particularly effective when the Hamiltonian's spectral norm is much smaller than its 1-norm, as in high-accuracy molecular simulations with large basis sets and strong electronic correlations. Numerical results for various molecular models show sampling-cost reductions of roughly 10 to 10,000 times over the conventional quantum Krylov algorithm.

quant-pharXiv:2511.20998•npj Quantum Information•Nov 27, 2025•2 citations
We introduce an algorithm that is simultaneously memory-efficient and low-scaling for applying ab initio molecular Hamiltonians to matrix-product states (MPS) via the tensor-hypercontraction (THC) format. These gains carry over to Krylov subspace methods, which can find low-lying eigenstates and simulate quantum time evolution while avoiding local minima and maintaining high accuracy. In our approach, the molecular Hamiltonian is represented as a sum of products of four MPOs, each with a bond dimension of only 2. Iteratively applying the MPOs to the current quantum state in MPS form, summing and recompressing the MPS leads to a scheme with the same asymptotic memory cost as the bare MPS and reduces the computational cost scaling compared to the Krylov method using a conventional MPO construction. We provide a detailed theoretical derivation of these statements and conduct supporting numerical experiments to demonstrate the advantage. Our algorithm is highly parallelizable and thus lends itself to large-scale HPC simulations.
We describe quantum circuits with only O(N ) Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of N arbitrary (e.g., molecular) orbitals.With O(λ/ ) repetitions of these circuits one can use phase estimation to sample in the molecular eigenbasis, where λ is the 1-norm of Hamiltonian coefficients and is the target precision.This is the lowest complexity shown for quantum computations of chemistry within an arbitrary basis.Furthermore, up to logarithmic factors, this matches the scaling of the most efficient prior block encodings that can work only with orthogonal-basis functions diagonalizing the Coloumb operator (e.g., the plane-wave dual basis).Our key insight is to factorize the Hamiltonian using a method known as tensor hypercontraction (THC) and then to transform the Coulomb operator into an isospectral diagonal form with a nonorthogonal basis defined by the THC factors.We then use qubitization to simulate the nonorthogonal THC Hamiltonian, in a fashion that avoids most complications of the nonorthogonal basis.We also reanalyze and reduce the cost of several of the best prior algorithms for these simulations in order to facilitate a clear comparison to the present work.In addition to having lower asymptotic scaling space-time volume, compilation of our algorithm for challenging finitesized molecules such as FeMoCo reveals that our method requires the least fault-tolerant resources of any known approach.By laying out and optimizing the surface-code resources required of our approach we show that FeMoCo can be simulated using about four million physical qubits and under 4 days of runtime, assuming 1-μs cycle times and physical gate-error rates no worse than 0.1%.
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 recent years, interest in the random-phase approximation (RPA) has grown rapidly. At the same time, tensor hypercontraction has emerged as an intriguing method to reduce the computational cost of electronic structure algorithms. In this paper, we combine the particle-particle random phase approximation with tensor hypercontraction to produce the tensor-hypercontracted particle-particle RPA (THC-ppRPA) algorithm. Unlike previous implementations of ppRPA which scale as O(r(6)), the THC-ppRPA algorithm scales asymptotically as only O(r(4)), albeit with a much larger prefactor than the traditional algorithm. We apply THC-ppRPA to several model systems and show that it yields the same results as traditional ppRPA to within mH accuracy. Our method opens the door to the development of post-Kohn Sham functionals based on ppRPA without the excessive asymptotic cost of traditional ppRPA implementations.
Finding a low-rank approximation for the two-electron integral (ERI) tensor is a crucial step towards reducing the computational cost of many-body electronic structure methods. In recent years, a range of new tensor factorization techniques, like the so-called tensor-hypercontraction (THC) approach, have been developed to achieve this goal. Unfortunately, a systematic comparison of accuracy and efficiency of different THC construction algorithms is missing. In this work, we address this gap by benchmarking these techniques across a wide range of molecular systems. In addition to offering useful insights into the advantages and disadvantages of the different techniques, we provide reference implementations in the newly developed open-source library, PyTHC.
An efficient algorithm for compressing a given many-body potential energy surface (PES) of molecular systems into a grid-based matrix product operator (MPO) is proposed. The PES is once represented by a full-dimensional or truncated many-body expansion form, which is obtained by ab initio calculations at each grid mesh point, and then all terms in the expansion are compressed and merged into a single MPO while maintaining the bond dimension of the MPO as small as possible. It was shown that the ab initio PES of the H 2 CO was compressed by more than 2 orders of magnitude in the size of the site operators without loss of accuracy. By the use of grid basis, the tensor rank of the site operators of the MPO is reduced from four to three due to the diagonal nature of the position-dependent operators on grid basis, which significantly reduces the computational cost of the tensor contractions required in the real and imaginary time evolution of the matrix product state (MPS) wave functions with the grid-based MPO (Grid-MPO) Hamiltonian. Similar to other grid-based methods, Grid-MPO is easily applicable to any kinds of potentials of molecular systems, such as analytical empirical model potentials expressed by position operators and ab initio potentials, if the values at the grid points are available. Using the Grid-MPO combined with the MPS, we calculated the time correlation function of the Eigen cation H 3 O + ( H 2 O ) 3 to predict the infrared spectrum and compared with the experimental and the previous theoretical studies. The actual scaling with the size of systems was examined for the multidimensional Henon–Heiles Hamiltonian. It was shown that the method is considerably accelerated by the graphic processing unit (GPU) because the sizes of site operators were kept small and all tensors were able to be stored on the VRAM of a GPU.
Quantum Krylov algorithms are a promising approach for ground-state energy estimation on near-term quantum computers. However, their sampling cost is inherently high because each Hamiltonian term is measured individually. Despite various mitigation techniques, this overhead remains a bottleneck for large-scale electronic structure problems. We introduce mirror subspace diagonalization (MSD), which approaches the theoretical lower bound on the sampling cost for quantum Krylov algorithms built upon real-time evolution. MSD uses a finite-difference formula to express the Hamiltonian as a linear combination of time-evolution unitaries with symmetrically shifted timesteps, enabling efficient estimation of the Hamiltonian matrix within the Krylov subspace. By optimizing the timestep and shifting the energy spectrum, finite-difference and statistical errors are minimized simultaneously, allowing MSD to attain the sampling-cost lower bound up to a logarithmic factor. We further apply classical post-processing to infer Hamiltonian moments, which mitigate the ground-state energy error via the Lanczos scheme. Our analysis shows MSD is particularly effective when the Hamiltonian's spectral norm is much smaller than its 1-norm, as in high-accuracy molecular simulations with large basis sets and strong electronic correlations. Numerical results for various molecular models show sampling-cost reductions of roughly 10 to 10,000 times over the conventional quantum Krylov algorithm.