A finite-tame-wild trichotomy theorem for tensor diagrams

DOI10.1016/J.AIM.2020.107213zbMATH Open1505.16025arXiv1705.03448OpenAlexW3026099372MaRDI QIDQ2189491FDOQ2189491

Authors: Jacob M. Turner 

Publication date: 15 June 2020

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

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.

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

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

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)

Cites Work

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

Cited In (3)

• On traces of tensor representations of diagrams
• Halos and undecidability of tensor stable positive maps
• 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)