Persistent Tensors and Multiqudit Entanglement Transformation
Masoud Gharahi, Vladimir Lysikov

TL;DR
This paper introduces persistent tensors, establishes their tensor rank bounds, explores their relation to multiqudit entanglement states, and demonstrates how they can be transformed from GHZ states using asymptotic SLOCC, with implications for tensor rank multiplicativity.
Contribution
The paper constructs tight tensor rank bounds for persistent tensors, links them to multiqudit W and GHZ states, and extends these bounds to block pyramidal tensors, advancing understanding of entanglement transformations.
Findings
Lower bound of tensor rank for persistent tensors is tight.
Persistent tensors generalize multiqubit W states within multiqudit systems.
Multiqudit W states can be obtained from GHZ states via asymptotic SLOCC with rate one.
Abstract
We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors. We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of degenerations between these three families of minimal-rank persistent tensors that can be used to study the entanglement transformation between them. In addition, we show that these three families of persistent tensors are indeed different generalizations of multiqubit states within multiqudit systems and are geometrically in the orbit closure of multiqudit states. Consequently, we show that one can obtain every one of the generalizations of state from a multiqudit state via asymptotic Stochastic Local Operations and Classical Communication (SLOCC) with rate one. Finally, we extend the obtained lower bound of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Quantum Computing Algorithms and Architecture · Sparse and Compressive Sensing Techniques
