2024/06/28 by Matthias Christandl · 1 voice
Computer Science · Mathematics · #Algebra over a field #Combinatorics #Computer science #Discrete mathematics #Error Correcting Code Techniques #Mathematics #Matrix multiplication #Preorder #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum entanglement #Rank (graph theory) #Strassen algorithm #Tensor (intrinsic definition) #Tensor decomposition and applications #Theoretical computer science #Transformation (genetics)
paper · pdf · doi:10.1093/pnasnexus/pgae254
openalex publication_date 2024/06/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation, and represent quantum entanglement. In this sense, a tensor can be viewed as valuable resource whose transformation can lead to an understanding of structure in data, computational complexity, and quantum information. In order to facilitate the understanding of this resource, we propose a family of information-theoretically constructed preorders on tensors, which can be used to compare tensors with each other and to assess the existence of transformations between them. The construction places copies of a given tensor at the edges of a hypergraph and allows transformations at the vertices. A preorder is then induced by the transformations possible in a given growing sequence of hypergraphs. The new family of preorders generalizes the asymptotic restriction preorder which Strassen defined in order to study the computational complexity of matrix multiplication. We derive general properties of the preorders and their associated asymptotic notions of tensor rank and view recent results on tensor rank nonadditivity, tensor networks, and algebraic complexity in this unifying frame. We hope that this work will provide a useful vantage point for exploring tensors in applied mathematics, physics, and computer science but also from a purely mathematical point of view.