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

arXiv:2409.12708 · cond-mat.str-el, physics.chem-ph, physics.comp-ph, quant-ph · Submitted 2024-09-19 · Read on arXiv

cond-mat.str-el, physics.chem-ph, physics.comp-ph, quant-ph

Submitted: 2024-09-19

Updated: 2025-08-15

Journal ref: J Chem Theory Comput 2025 21 6874-6886

DOI: 10.1021/acs.jctc.5c00525

Code: https://github.com/google-deepmind/optax

License: http://creativecommons.org/licenses/by/4.0/

The gist: 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)…

Terminology

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 re-compressing 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.

Sources

Related papers