A finite-tame-wild trichotomy theorem for tensor diagrams

DOI10.1016/J.AIM.2020.107213MaRDI QIDQ2189491zbMATHOpenAlexFDO

Authors Jacob M. Turner

Publication date 15 June 2020

Published in Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

representation theorytensor networkstame representationswild representations

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Representation type (finite, tame, wild, etc.) of associative algebras (16G60) Monoidal categories, symmetric monoidal categories (18M05) Categories of networks and processes, compositionality (18M35)

Abstract: In this paper, we consider the problem of determining when two tensor networks are equivalent under a heterogeneous change of basis. In particular, to a string diagram in a certain monoidal category (which we call tensor diagrams), we formulate an associated abelian category of representations. Each representation corresponds to a tensor network on that diagram. We then classify which tensor diagrams give rise to categories that are finite, tame, or wild in the traditional sense of representation theory. For those tensor diagrams of finite and tame type, we classify the indecomposable representations. Our main result is that a tensor diagram is wild if and only if it contains a vertex of degree at least three. Otherwise, it is of tame or finite type.

Recommendations

• Wildness for tensors
• On traces of tensor representations of diagrams
• The geometry of tensor calculus. I
• Tensor Algebras in Finite Tensor Categories
• Complexity of matrix problems

Cites work

• scientific article; zbMATH DE number 3715764 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 3344105 (Why is no real title available?)
• A complete dichotomy rises from the capture of vanishing signatures (extended abstract)
• A complete set of invariants for LU-equivalence of density operators
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• A survey of graphical languages for monoidal categories
• Algebraic invariants of five qubits
• Complexity of counting CSP with complex weights
• Complexity of matrix problems
• Computing the Tutte polynomial of lattice path matroids using determinantal circuits
• Generalized counting constraint satisfaction problems with determinantal circuits
• Graph invariants related to statistical mechanical models: Examples and problems
• Holographic algorithms without matchgates
• How many invariant polynomials are needed to decide local unitary equivalence of qubit states?
• Local unitary equivalence of multipartite pure states
• Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
• Quantum computers that can be simulated classically in polynomial time
• Stable Hilbert series as related to the measurement of quantum entanglement
• Tensor network methods for invariant theory
• Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits
• The complexity of partition functions
• The geometry of tensor calculus. I
• Unitary invariants of qubit systems
• Unzerlegbare Darstellungen. I. (Indecomposable representations. I)

Cited in

(3)

• Halos and undecidability of tensor stable positive maps
• On traces of tensor representations of diagrams
• Tensor decompositions with applications to local unitary and stochastic local operations and classical communication equivalence of multipartite pure states

This page was built for publication: A finite-tame-wild trichotomy theorem for tensor diagrams

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