The Hackbusch conjecture on tensor formats

DOI10.1016/J.MATPUR.2015.05.002MaRDI QIDQ496420zbMATH OpenOpenAlexWikidataFDO

Authors Weronika Buczyńska, Jarosław Buczyński, Mateusz Michalek

Publication date 21 September 2015

Published in Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.01120

zbMATH Keywords

complexity of tensorsHackbusch conjecturehierarchical formattensor formatstensor train formats

Mathematics Subject Classification ID

Trees (05C05) Multilinear algebra, tensor calculus (15A69) Spaces of operators; tensor products; approximation properties (46B28)

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.

Recommendations

• The Hackbusch conjecture on tensor formats. II.
• On the geometry of tensor network states
• Tree-based tensor formats
• Tree adaptive approximation in the hierarchical tensor format
• On the geometry of tensor network states of \(2\times N\) grids

Cites work

• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• A new tensor decomposition
• An introduction to hierarchical (\(\mathcal H\)-) rank and TT-rank of tensors with examples
• Asymptotic entanglement transformation between W and GHZ states
• Eigenvectors of tensors and algorithms for Waring decomposition
• Gaussian elimination is not optimal
• On the Asymptotic Complexity of Matrix Multiplication
• Ranks of tensors and a generalization of secant varieties
• TT-cross approximation for multidimensional arrays
• Tensor spaces and numerical tensor calculus
• Tensor-train decomposition

Cited in

(9)

• The Hackbusch conjecture on tensor formats. II.
• Approximation theory of tree tensor networks: tensorized univariate functions
• On the geometry of tensor network states
• Recompression of Hadamard Products of Tensors in Tucker Format
• Dimension of tensor network varieties
• Halos and undecidability of tensor stable positive maps
• Geometry of tree-based tensor formats in tensor Banach spaces
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations
• The linear span of uniform matrix product states

This page was built for publication: The Hackbusch conjecture on tensor formats

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496420)