An Accurate Lanczos Method for the Matrix Product State Representation

arXiv:2504.21786 · cond-mat.str-el, physics.comp-ph, quant-ph · Submitted 2025-04-30 · Read on arXiv

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

Submitted: 2025-04-30

Updated: 2026-08-20

DOI: 10.1038/s42005-026-02896-x

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

The gist: We improve the convergence of the Lanczos algorithm using the matrix product state representation.

Terminology

Abstract

We improve the convergence of the Lanczos algorithm using the matrix product state representation. As an alternative to the density matrix renormalization group (DMRG), the Lanczos algorithm avoids local minima and can directly find multiple low-lying eigenstates. However, its performance and accuracy are affected by the truncation required to maintain the efficiency of the tensor network representation. In this work, we propose the modified thick-block Lanczos method to enhance the convergence of the Lanczos algorithm with MPS representation. We benchmark our method on one-dimensional instances of the Fermi-Hubbard model and the Heisenberg model in an external field, using numerical experiments targeting the first five lowest eigenstates. Across these tests, our approach attains the best possible accuracy permitted by the given bond dimension. This work establishes the Lanczos method as a reliable and accurate framework for finding multiple low-lying states within a tensor-network representation

Sources

Related papers