Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sinkhorn-Knopp Theorem for PPT states

Published 15 Jul 2018 in math.OA, math-ph, math.MP, and quant-ph | (1807.06955v2)

Abstract: Given a PPT state $A=\sum_{i=1}nA_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\rightarrow M_k$, $G_A(X)=\sum_{i=1}n tr(A_iX)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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.