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:2506.22574 · The Journal of Chemical Physics

Computing excited eigenstates using inexact Lanczos methods and tree tensor network states

Madhumita Rano, Henrik R. Larsson

Published Oct 22, 2025• 4 citations
arXivHTMLPDF

Abstract

To understand the dynamics of quantum many-body systems, it is essential to study excited eigenstates. While tensor network states have become a standard tool for computing ground states in computational many-body physics, obtaining accurate excited eigenstates remains a significant challenge. In this work, we develop an approach that combines the inexact Lanczos method, which is designed for efficient computations of excited states, with tree tensor network states (TTNSs). We demonstrate our approach by computing excited vibrational states for three challenging problems: (1) 122 states in two different energy intervals of acetonitrile (12-dimensional), (2) Fermi resonance states of the fluxional Zundel ion (15-dimensional), and (3) selected excited states of the fluxional and very correlated Eigen ion (33-dimensional). The proposed TTNS inexact Lanczos method is directly applicable to other quantum many-body systems.

DOI
10.1063/5.0301263

Related papers

Accurate, full-dimensional computations of thousands of complex vibrational eigenstates with tree tensor network states

Henrik R. Larsson, Brieuc Le Dé, Gino E. Gamboni

Tree tensor network states (TTNSs) combined with the density matrix renormalization group (DMRG) are emerging as powerful tools for vibrational and vibronic structure simulations in molecules with strong coupling and fluxionality. In this Perspective, we discuss how TTNS methods enable accurate, full-dimensional computations of thousands of eigenstates for molecular systems ranging from quartic-force-field benchmarks to molecules with strong vibronic coupling and protonated water clusters as large as the 33-dimensional Eigen ion, H$_3$O$^+$$\cdot$(H$_2$O)$_3$. We emphasize the close connection and interoperability between DMRG-based TTNS methods and the multilayer multiconfiguration time-dependent Hartree method (ML-MCTDH), which share the same underlying ansatz. We also highlight practical challenges of predictive simulations, including robust error estimation, convergence of observables such as infrared intensities, and optimization of tensor network tree structures. Finally, we outline recent advances toward direct targeting of excited states and discuss opportunities for broader applications in molecular spectroscopy and quantum dynamics.

physics.chem-phCross-listedarXiv:2605.00998•The Journal of Physical Chemistry Letters•May 5, 2026•0 citations

Tree Tensor Networks Methods for Efficient Calculation of Molecular Vibrational Spectra

Shuo Sun, Richard M. Milbradt, Stefan Knecht +2 more

We develop and employ general Tree Tensor Networks (TTNs) to compute the vibrational spectra for two model systems: a set of 64-dimensional coupled oscillators and acetonitrile. We explore various tree architectures, ranging from the simple linear structure of Matrix Product States (MPS), to trees where only the leaf nodes carry a physical leg -- as commonly seen in the underlying ansatz of the Multilayer Multiconfiguration Time-Dependent Hartree (ML-MCTDH) method -- and further to more general trees in which all nodes are allowed to possess a physical leg. In addition, we implement Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) methods and Inverse Iteration methods as eigensolvers. Benchmarking runtime and accuracy shows that all tested topologies can reach high accuracy. For acetonitrile, inverse-iteration refinement brings all 84 computed states below 1~cm$^{-1}$ error, while the fork-4 tree, a comb-like tree with four backbone nodes, provides the best overall balance between accuracy and cost. MPS remains computationally attractive, whereas more connected trees generally improve accuracy at fixed bond dimension. All numerical simulations were performed using PyTreeNet, a Python package designed for flexible tensor network computations.

physics.chem-phCross-listedarXiv:2512.15875•The Journal of Chemical Physics•Dec 19, 2025•0 citations

Computing vibrational eigenstates with tree tensor network states (TTNS)

Henrik R. Larsson

We present how to compute vibrational eigenstates with tree tensor network states (TTNSs), the underlying ansatz behind the multilayer multiconfiguration time-dependent Hartree (ML-MCTDH) method. The eigenstates are computed with an algorithm that is based on the density matrix renormalization group (DMRG). We apply this to compute the vibrational spectrum of acetonitrile (CH3CN) to high accuracy and compare TTNSs with matrix product states (MPSs), the ansatz behind the DMRG. The presented optimization scheme converges much faster than ML-MCTDH-based optimization. For this particular system, we found no major advantage of the more general TTNS over MPS. We highlight that for both TTNS and MPS, the usage of an adaptive bond dimension significantly reduces the amount of required parameters. We furthermore propose a procedure to find good trees.

arXiv:1909.13831•The Journal of Chemical Physics•Nov 25, 2019•77 citations

Benchmarking Vibrational Spectra: 5000 Accurate Eigenstates of Acetonitrile Using Tree Tensor Network States

Henrik R. Larsson

High Resolution Image Download MS PowerPoint Slide Accurate vibrational spectra are essential for understanding how molecules behave, yet their computation remains challenging, and benchmark data to reliably compare different methods are sparse. Here, we present high-accuracy eigenstate computations for the six-atom, 12-dimensional acetonitrile molecule, a prototypical, strongly coupled anharmonic system. Using a density matrix renormalization group (DMRG) algorithm with a tree-tensor-network-state (TTNS) ansatz, a refinement using TTNSs as basis set, and reliable procedures to estimate energy errors, we compute up to 5,000 vibrational states with error estimates below 0.0007 cm –1 . Our analysis reveals that previous works underestimated the energy error by up to 2 orders of magnitude. Our data serve as a benchmark for future vibrational spectroscopy methods, and our new method offers a path toward similarly precise computations of large, complex molecular systems.

arXiv:2504.05382•The Journal of Physical Chemistry Letters•Apr 14, 2025•7 citations

Tree Tensor Network State with Variable Tensor Order: An Efficient Multireference Method for Strongly Correlated Systems

V. Murg, Frank Verstraete, Reinhold Schneider +2 more

We study the tree-tensor-network-state (TTNS) method with variable tensor orders for quantum chemistry. TTNS is a variational method to efficiently approximate complete active space (CAS) configuration interaction (CI) wave functions in a tensor product form. TTNS can be considered as a higher order generalization of the matrix product state (MPS) method. The MPS wave function is formulated as products of matrices in a multiparticle basis spanning a truncated Hilbert space of the original CAS-CI problem. These matrices belong to active orbitals organized in a one-dimensional array, while tensors in TTNS are defined upon a tree-like arrangement of the same orbitals. The tree-structure is advantageous since the distance between two arbitrary orbitals in the tree scales only logarithmically with the number of orbitals N, whereas the scaling is linear in the MPS array. It is found to be beneficial from the computational costs point of view to keep strongly correlated orbitals in close vicinity in both arrangements; therefore, the TTNS ansatz is better suited for multireference problems with numerous highly correlated orbitals. To exploit the advantages of TTNS a novel algorithm is designed to optimize the tree tensor network topology based on quantum information theory and entanglement. The superior performance of the TTNS method is illustrated on the ionic-neutral avoided crossing of LiF. It is also shown that the avoided crossing of LiF can be localized using only ground state properties, namely one-orbital entanglement.

Journal of Chemical Theory and Computation•Feb 3, 2015•97 citations

Application of Tensor Network State Method to 1D Quantum Systems

蕭仲評

In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).

•Jan 1, 2010•0 citations
To understand the dynamics of quantum many-body systems, it is essential to study excited eigenstates. While tensor network states have become a standard tool for computing ground states in computational many-body physics, obtaining accurate excited eigenstates remains a significant challenge. In this work, we develop an approach that combines the inexact Lanczos method, which is designed for efficient computations of excited states, with tree tensor network states (TTNSs). We demonstrate our approach by computing excited vibrational states for three challenging problems: (1) 122 states in two different energy intervals of acetonitrile (12-dimensional), (2) Fermi resonance states of the fluxional Zundel ion (15-dimensional), and (3) selected excited states of the fluxional and very correlated Eigen ion (33-dimensional). The proposed TTNS inexact Lanczos method is directly applicable to other quantum many-body systems.
Tree tensor network states (TTNSs) combined with the density matrix renormalization group (DMRG) are emerging as powerful tools for vibrational and vibronic structure simulations in molecules with strong coupling and fluxionality. In this Perspective, we discuss how TTNS methods enable accurate, full-dimensional computations of thousands of eigenstates for molecular systems ranging from quartic-force-field benchmarks to molecules with strong vibronic coupling and protonated water clusters as large as the 33-dimensional Eigen ion, H3_33​O+^++⋅\cdot⋅(H2_22​O)3_33​. We emphasize the close connection and interoperability between DMRG-based TTNS methods and the multilayer multiconfiguration time-dependent Hartree method (ML-MCTDH), which share the same underlying ansatz. We also highlight practical challenges of predictive simulations, including robust error estimation, convergence of observables such as infrared intensities, and optimization of tensor network tree structures. Finally, we outline recent advances toward direct targeting of excited states and discuss opportunities for broader applications in molecular spectroscopy and quantum dynamics.
We develop and employ general Tree Tensor Networks (TTNs) to compute the vibrational spectra for two model systems: a set of 64-dimensional coupled oscillators and acetonitrile. We explore various tree architectures, ranging from the simple linear structure of Matrix Product States (MPS), to trees where only the leaf nodes carry a physical leg -- as commonly seen in the underlying ansatz of the Multilayer Multiconfiguration Time-Dependent Hartree (ML-MCTDH) method -- and further to more general trees in which all nodes are allowed to possess a physical leg. In addition, we implement Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) methods and Inverse Iteration methods as eigensolvers. Benchmarking runtime and accuracy shows that all tested topologies can reach high accuracy. For acetonitrile, inverse-iteration refinement brings all 84 computed states below 1~cm−1^{-1}−1 error, while the fork-4 tree, a comb-like tree with four backbone nodes, provides the best overall balance between accuracy and cost. MPS remains computationally attractive, whereas more connected trees generally improve accuracy at fixed bond dimension. All numerical simulations were performed using PyTreeNet, a Python package designed for flexible tensor network computations.
We present how to compute vibrational eigenstates with tree tensor network states (TTNSs), the underlying ansatz behind the multilayer multiconfiguration time-dependent Hartree (ML-MCTDH) method. The eigenstates are computed with an algorithm that is based on the density matrix renormalization group (DMRG). We apply this to compute the vibrational spectrum of acetonitrile (CH3CN) to high accuracy and compare TTNSs with matrix product states (MPSs), the ansatz behind the DMRG. The presented optimization scheme converges much faster than ML-MCTDH-based optimization. For this particular system, we found no major advantage of the more general TTNS over MPS. We highlight that for both TTNS and MPS, the usage of an adaptive bond dimension significantly reduces the amount of required parameters. We furthermore propose a procedure to find good trees.
High Resolution Image Download MS PowerPoint Slide Accurate vibrational spectra are essential for understanding how molecules behave, yet their computation remains challenging, and benchmark data to reliably compare different methods are sparse. Here, we present high-accuracy eigenstate computations for the six-atom, 12-dimensional acetonitrile molecule, a prototypical, strongly coupled anharmonic system. Using a density matrix renormalization group (DMRG) algorithm with a tree-tensor-network-state (TTNS) ansatz, a refinement using TTNSs as basis set, and reliable procedures to estimate energy errors, we compute up to 5,000 vibrational states with error estimates below 0.0007 cm –1 . Our analysis reveals that previous works underestimated the energy error by up to 2 orders of magnitude. Our data serve as a benchmark for future vibrational spectroscopy methods, and our new method offers a path toward similarly precise computations of large, complex molecular systems.
We study the tree-tensor-network-state (TTNS) method with variable tensor orders for quantum chemistry. TTNS is a variational method to efficiently approximate complete active space (CAS) configuration interaction (CI) wave functions in a tensor product form. TTNS can be considered as a higher order generalization of the matrix product state (MPS) method. The MPS wave function is formulated as products of matrices in a multiparticle basis spanning a truncated Hilbert space of the original CAS-CI problem. These matrices belong to active orbitals organized in a one-dimensional array, while tensors in TTNS are defined upon a tree-like arrangement of the same orbitals. The tree-structure is advantageous since the distance between two arbitrary orbitals in the tree scales only logarithmically with the number of orbitals N, whereas the scaling is linear in the MPS array. It is found to be beneficial from the computational costs point of view to keep strongly correlated orbitals in close vicinity in both arrangements; therefore, the TTNS ansatz is better suited for multireference problems with numerous highly correlated orbitals. To exploit the advantages of TTNS a novel algorithm is designed to optimize the tree tensor network topology based on quantum information theory and entanglement. The superior performance of the TTNS method is illustrated on the ionic-neutral avoided crossing of LiF. It is also shown that the avoided crossing of LiF can be localized using only ground state properties, namely one-orbital entanglement.
In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).