Asymptotic tensor rank of graph tensors: beyond matrix multiplication
From MaRDI portal
Publication:2422766
DOI10.1007/s00037-018-0172-8zbMath1415.65098arXiv1609.07476OpenAlexW3106434744WikidataQ114231720 ScholiaQ114231720MaRDI QIDQ2422766
Matthias Christandl, Péter Vrana, Jeroen Zuiddam
Publication date: 20 June 2019
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07476
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (05C99) Multilinear algebra, tensor calculus (15A69) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items
Universal points in the asymptotic spectrum of tensors ⋮ A Gap in the Subrank of Tensors ⋮ Dimension of tensor network varieties ⋮ A family of multipartite entanglement measures ⋮ Unnamed Item ⋮ Barriers for fast matrix multiplication from irreversibility ⋮ Border Rank Nonadditivity for Higher Order Tensors ⋮ The asymptotic induced matching number of hypergraphs: balanced binary strings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Entanglement distillation from Greenberger-Horne-Zeilinger shares
- Matrix multiplication via arithmetic progressions
- Sunflowers and testing triangle-freeness of functions
- Gaussian elimination is not optimal
- Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication
- Powers of tensors and fast matrix multiplication
- Relative bilinear complexity and matrix multiplication.
- The asymptotic spectrum of tensors.
- Partial and Total Matrix Multiplication
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Asymptotic entanglement transformation between W and GHZ states
- Coherence in Spontaneous Radiation Processes
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- Proofs from THE BOOK
