Tripartite-to-bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces
Yinan Li, Youming Qiao, Xin Wang, Runyao Duan

TL;DR
This paper investigates the transformation of tripartite pure quantum states into bipartite states via SLOCC, revealing super-multiplicative properties of maximal Schmidt rank and providing explicit formulas for asymptotic entanglement conversion rates.
Contribution
It introduces a full characterization of super-multiplicative maximal Schmidt ranks and explicit formulas for asymptotic rates using matrix space structures, advancing understanding of entanglement transformation.
Findings
Maximal Schmidt rank is strictly super-multiplicative in multi-copy regimes.
Explicit formulas for asymptotic maximal Schmidt ranks of key tripartite states.
Polynomial-time verification of entanglement transformation conditions.
Abstract
We study the problem of transforming a tripartite pure state to a bipartite one using stochastic local operations and classical communication (SLOCC). It is known that the tripartite-to-bipartite SLOCC convertibility is characterized by the maximal Schmidt rank of the given tripartite state, i.e. the largest Schmidt rank over those bipartite states lying in the support of the reduced density operator. In this paper, we further study this problem and exhibit novel results in both multi-copy and asymptotic settings. In the multi-copy regime, we observe that the maximal Schmidt rank is strictly super-multiplicative, i.e. the maximal Schmidt rank of the tensor product of two tripartite pure states can be strictly larger than the product of their maximal Schmidt ranks. We then provide a full characterization of those tripartite states whose maximal Schmidt rank is strictly…
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
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
