Sinkhorn–Knopp theorem for PPT states
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Given a PPT state $$A=\sum _{i=1}^nA_i\otimes B_i \in M_k\otimes M_k$$A=∑i=1nAi⊗Bi∈Mk⊗Mk and a rank k tensor v within the image of A, we provide an algorithm that checks whether the positive map $$G_A:M_k\rightarrow M_k$$GA:Mk→Mk, $$G_A(X)=\sum _{i=1}^n tr(A_iX)B_i$$GA(X)=∑i=1ntr(AiX)Bi, is equivalent to a doubly stochastic map. This procedure is based on the search for Perron eigenvectors of completely positive maps and unique solutions of, at most, k unconstrained quadratic minimization problems. As a corollary, we can check whether this state can be put in the filter normal form. This normal form is an important tool for studying quantum entanglement. An extension of this procedure to PPT states in $$M_k\otimes M_m$$Mk⊗Mm is also presented.