Border Ranks of Positive and Invariant Tensor Decompositions: Applications to Correlations

Abstract

The matrix rank and its positive versions are robust for small approximations, i.e. they do not decrease under small perturbations. In contrast, the multipartite tensor rank can collapse for arbitrarily small errors, i.e. there may be a gap between rank and border rank, leading to instabilities in the optimization over sets with fixed tensor rank. Can multipartite positive ranks also collapse for small perturbations? In this work, we prove that multipartite positive and invariant tensor decompositions exhibit gaps between rank and border rank, including tensor rank purifications and cyclic separable decompositions. We also prove a correspondence between positive decompositions and membership in certain sets of multipartite probability distributions, and leverage the gaps between rank and border rank to prove that these correlation sets are not closed. It follows that testing membership of probability distributions arising from resources like translational invariant Matrix Product States is impossible in finite time. Overall, this work sheds light on the instability of ranks and the unique behavior of bipartite systems.

arXiv comment14 pages, 21 pages of appendices, 12 figures. v3: published version

References in corpus (25)

• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Lifts of convex sets and cone factorizations
• A quantum version of Wielandt's inequality
• Purifications of multipartite states: limitations and constructive methods
• On the rank of a binary form
• Matrix product operators and states: NP-hardness and undecidability
• Positive semidefinite rank
• Tensor rank is not multiplicative under the tensor product
• Fundamental limitations in the purifications of tensor networks
• Tensor ranks on tangent developable of Segre varieties
• Irreducible forms of Matrix Product States: Theory and Applications
• Stochastic Matrix Product States
• Expressive power of tensor-network factorizations for probabilistic modeling, with applications from hidden Markov models to quantum machine learning
• Border rank is not multiplicative under the tensor product
• Tensor network representations from the geometry of entangled states
• Optimization at the boundary of the tensor network variety
• A note on the gap between rank and border rank
• Asymptotic tensor rank of graph tensors: beyond matrix multiplication
• On the closedness and geometry of tensor network state sets
• Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices
• Tensor decompositions on simplicial complexes with invariance
• The average condition number of most tensor rank decomposition problems is infinite
• Border rank non-additivity for higher order tensors
• Polynomial decompositions with invariance and positivity inspired by tensors

Cited by in corpus (1)

• Quantifying entanglement from the geometric perspective