The Hackbusch conjecture on tensor formats

Abstract We prove a conjecture of W. Hackbusch about tensor network states related to a perfect binary tree and train track tree. Tensor network states are used to present seemingly complicated tensors in a relatively simple and efficient manner. Each such presentation is described by a binary tree and a collection of vector spaces, one for each vertex of the tree. A problem suggested by Wolfgang Hackbusch and Joseph Landsberg is to compare the complexities of encodings, if one presents the same tensor with respect to two different trees. We answer this question when the two trees are extremal cases: the most “spread” tree (perfect binary tree), and the “deepest” binary tree (train track tree). The corresponding tensor formats are called hierarchical formats (HF) and tensor train (TT) formats, respectively.

[1]  Ivan Oseledets,et al.  A new tensor decomposition , 2009 .

[2]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[3]  Matthias Christandl,et al.  Asymptotic entanglement transformation between W and GHZ states , 2013, 1310.3244.

[4]  Wolfgang Hackbusch,et al.  An Introduction to Hierarchical (H-) Rank and TT-Rank of Tensors with Examples , 2011, Comput. Methods Appl. Math..

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  F. Verstraete,et al.  Matrix product states represent ground states faithfully , 2005, cond-mat/0505140.

[7]  E. Tyrtyshnikov,et al.  TT-cross approximation for multidimensional arrays , 2010 .

[8]  Luke Oeding,et al.  Eigenvectors of tensors and algorithms for Waring decomposition , 2011, J. Symb. Comput..

[9]  G. Vidal.  Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.

[10]  J. Landsberg,et al.  Ranks of tensors and a generalization of secant varieties , 2009, 0909.4262.

[11]  Matthew J. Rosseinsky,et al.  Physical Review B , 2011 .

[12]  October I.  Physical Review Letters , 2022 .

[13]  Ivan Oseledets,et al.  Tensor-Train Decomposition , 2011, SIAM J. Sci. Comput..

[14]  Don Coppersmith,et al.  On the Asymptotic Complexity of Matrix Multiplication , 1982, SIAM J. Comput..

[15]  W. Hackbusch.  Tensor Spaces and Numerical Tensor Calculus , 2012, Springer Series in Computational Mathematics.

[16]  J. Landsberg.  Tensors: Geometry and Applications , 2011 .