computational chemistry

Tree Tensor Networks Methods for Efficient Calculation of Molecular Vibrational Spectra

arXiv:2512.15875 · doi:10.1063/5.0323779

summary

The paper introduces Tree Tensor Networks for calculating molecular vibrational spectra, testing various tree architectures and eigensolvers on high‑dimensional oscillator models and acetonitrile, achieving high accuracy with efficient computational cost.

Abstract

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

Topics & keywords

#tensor networks#vibrational spectra#molecular quantum dynamics#eigensolver algorithms#acetonitrileTree Tensor NetworksMatrix Product StatesML-MCTDHLOBPCGinverse iterationPyTreeNet