2019
DOI: 10.1007/s11005-019-01169-9
|View full text |Cite
|
Sign up to set email alerts
|

Sinkhorn–Knopp theorem for PPT states

Abstract: with tensor rank k, we provide an algorithm that checks whether the positive mapis 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 ⊗ M m is … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 39 publications
1
1
0
Order By: Relevance
“…Using this notion, the following result shows that PPT channels which are block preserving in the above sense must annihilate off-diagonal blocks. We note that results of a similar flavor were shown in [12,13]. The eigenvalues of this matrix are the eigenvalues of Φ(|0 0|), together with the eigenvalues of Φ(|1 1|), and the eigenvalues of the block matrix…”
Section: Definition 35 ( {Psupporting
confidence: 60%
“…Using this notion, the following result shows that PPT channels which are block preserving in the above sense must annihilate off-diagonal blocks. We note that results of a similar flavor were shown in [12,13]. The eigenvalues of this matrix are the eigenvalues of Φ(|0 0|), together with the eigenvalues of Φ(|1 1|), and the eigenvalues of the block matrix…”
Section: Definition 35 ( {Psupporting
confidence: 60%
“…The PPT counterpart of this result is an algorithm that determines whether a PPT state can be put in the filter normal form or not already found in [7]. This algorithm is based on the complete reducibility property.…”
Section: Introductionmentioning
confidence: 99%