Sinkhorn-Knopp Theorem for PPT states

Abstract

Given a PPT state $A={\sum }_{i=1}^n{A}_i\otimes B_i\in M_k\otimes M_k$ and a vector $v\in \Im (A)\subset {\mathbb{C}}^k\otimes {\mathbb{C}}^k$ with tensor rank $k$, we provide an algorithm that checks whether the positive map $G_A:M_k\to M_k$, $G_A(X)={\sum }_{i=1}^{n}tr(A_{i}X)B_i$, 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$ is also presented.

arXiv commentSome typos were corrected and one reference was added

References in corpus (11)

• Separability Criterion for Density Matrices
• Separability of Mixed States: Necessary and Sufficient Conditions
• Entanglement detection
• Separability criterion and inseparable mixed states with positive partial transposition
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• Normal forms and entanglement measures for multipartite quantum states
• Unifying several separability conditions using the covariance matrix criterion
• Geometrical aspects of entanglement
• Optimal conversion of non--local unitary operations
• Completely Reducible maps in Quantum Information Theory
• Recent progress on scaling algorithms and applications

Cited by in corpus (1)

• Eventually entanglement breaking Markovian dynamics: structure and characteristic times