Approximating the set of separable states using the positive partial transpose test
Name
Shor_Approximating the.pdf
Size
162.98 KB
Format
Adobe PDF
Checksum (MD5)
821d90b776ac4434e193ae0c262f982e
Author(s)
Beigi, Salman
Shor, Peter W.
Date Issued
April 2010
Journal
Journal of Mathematical Physics
Publisher
American Institute of Physics
Citation
Beigi, Salman, and Peter W. Shor. “Approximating the Set of Separable States Using the Positive Partial Transpose Test.” Journal of Mathematical Physics 51.4 (2010): 042202. Web.
Version
Author's final manuscript
Abstract
The positive partial transpose test is one of the main criteria for detecting entanglement, and the set of states with positive partial transpose is considered as an approximation of the set of separable states. However, we do not know to what extent this criterion, as well as the approximation, is efficient. In this paper, we show that the positive partial transpose test gives no bound on the distance of a density matrix from separable states. More precisely, we prove that, as the dimension of the space tends to infinity, the maximum trace distance of a positive partial transpose state from separable states tends to 1. Using similar techniques, we show that the same result holds for other well-known separability criteria such as reduction criterion, majorization criterion, and symmetric extension criterion. We also bring in evidence that the sets of positive partial transpose states and separable states have totally different shapes.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1063/1.3364793
