Tree tensor network states represent low-energy states faithfully
Thomas Barthel
TL;DR
This work derives rigorous bounds on the fidelity and resource requirements of tree tensor network states (TTNS) for approximating quantum states on tree graphs. By relating truncation errors to edge Schmidt spectra and to α-Rényi entanglement entropies, it provides both lower and upper bounds on the achievable accuracy and on the necessary bond dimensions, including explicit formulas and conditions on Rényi parameters. A key insight is that if edge entanglement satisfies an area (or log-area) law, TTNS can approximate low-energy states efficiently with bond dimensions growing only polynomially in system size. The results thus establish when TTNS on trees are faithful and practically efficient, guiding both theoretical understanding and computational strategies for tree-structured quantum systems.
Abstract
Extending corresponding results for matrix product states [Verstraete and Cirac, PRB 73, 094423 (2006); Schuch et al. PRL 100, 030504 (2008)], it is shown how the approximation error of tree tensor network states (TTNS) can be bounded using Schmidt spectra or Rényi entanglement entropies of the target quantum state. Conversely, one obtains bounds on TTNS bond dimensions needed to achieve a specific approximation accuracy. For tree lattices, the result implies that efficient TTNS approximations exist if $α<1$ Rényi entanglement entropies for single-branch cuts obey an area law, as in ground and low-energy states of certain gapped systems.
