Tree tensor networks methods for efficient calculation of molecular vibrational spectra

We develop and employ general tree tensor networks 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 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 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.

Institutions

Publication Details

Journal
The Journal of Chemical Physics
Published
2026-07-16
DOI
https://doi.org/10.1063/5.0323779
Primary Topic
Machine Learning in Materials Science
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tree tensor networks methods for efficient calculation of molecular vibrational spectra

The Journal of Chemical Physics
Machine Learning in Materials Science
article

Tree tensor networks methods for efficient calculation of molecular vibrational spectra

article en

Abstract

We develop and employ general tree tensor networks 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 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 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.

The Journal of Chemical PhysicsVol. 165(3)
BMW Group (Germany) (DE), Technical University of Munich (DE), Finnish Transport Agency (FI)
TUM Universitätsstiftung, Munich Center for Quantum Science and Technology, Bayerische Motoren Werke
Openalex Percentile: Top 99%
Machine Learning in Materials Science
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.