Tensor surgery and tensor rank
Matthias Christandl, Jeroen Zuiddam

TL;DR
This paper introduces tensor surgery, a method for transforming low-order tensors into higher-order tensors, enabling new bounds on tensor rank and applications in algebraic complexity, quantum information, and communication complexity.
Contribution
The paper presents a novel tensor surgery technique that preserves low-rank structures and derives bounds for tensor ranks of graph-structured tensors, including those related to matrix multiplication.
Findings
Tensor surgery provides nontrivial upper bounds on tensor rank and border rank.
Application to triangle graphs yields bounds for iterated matrix multiplication tensors.
Bounds are optimal if the matrix multiplication exponent $$ equals two.
Abstract
We introduce a method for transforming low-order tensors into higher-order tensors and apply it to tensors defined by graphs and hypergraphs. The transformation proceeds according to a surgery-like procedure that splits vertices, creates and absorbs virtual edges and inserts new vertices and edges. We show that tensor surgery is capable of preserving the low rank structure of an initial tensor decomposition and thus allows to prove nontrivial upper bounds on tensor rank, border rank and asymptotic rank of the final tensors. We illustrate our method with a number of examples. Tensor surgery on the triangle graph, which corresponds to the matrix multiplication tensor, leads to nontrivial rank upper bounds for all odd cycle graphs, which correspond to the tensors of iterated matrix multiplication. In the asymptotic setting we obtain upper bounds in terms of the matrix multiplication…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
