pith. sign in

arxiv: 1105.4449 · v2 · pith:67INBMBTnew · submitted 2011-05-23 · 🧮 math.AG

On the geometry of tensor network states

classification 🧮 math.AG
keywords tensornetworkstatesgeometricgrasedyckmatrixmultiplicationquestion
0
0 comments X
read the original abstract

We answer a question of L. Grasedyck that arose in quantum information theory, showing that the limit of tensors in a space of tensor network states need not be a tensor network state. We also give geometric descriptions of spaces of tensor networks states corresponding to trees and loops. Grasedyck's question has a surprising connection to the area of Geometric Complexity Theory, in that the result is equivalent to the statement that the boundary of the Mulmuley-Sohoni type variety associated to matrix multiplication is strictly larger than the projections and re-labelings of matrix multiplication. Tensor Network States are also related to graphical models in algebraic statistics.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.