Rank-based entanglement detection for bound entangled states
Abstract
We develop a new method for entanglement detection in bipartite quantum states by using the violation of the rank-1-generated property of matrices. The positive-semidefinite matrices form a convex cone that has extremal elements of rank 1. But, convex conic subsets resulting from the presence of linear constraints allow extremal elements of rank >= 2. The problem of deciding when a matrix is rank-1 generated, i.e, a sum of rank-1 positive-semidefinite (PSD) matrices, has been studied extensively in optimization theory. This rank-1 generated property acts as an entanglement criterion, and we use this property to find novel classes of PPT (Positive under partial transposition) entangled states. We do this by mapping some faces of PPT density matrices to convex cones that are not rank-1 generated. We show that all separable states map to a rank-1 generated matrix. In general, the same is not true for the corresponding mapping of PPT entangled states. We also extend this approach to construct PPT entangled edge states. Finally, we provide witnesses that detect violations of the rank-1 generated property.
Cite
@article{arxiv.2506.11346,
title = {Rank-based entanglement detection for bound entangled states},
author = {Aabhas Gulati},
journal= {arXiv preprint arXiv:2506.11346},
year = {2026}
}
Comments
15 pages. Published in PRA. For a better formatted article with less errors, look at the arxiv version