Approximating the set of separable states using the positive partial transpose test
From MaRDI portal
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, are 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 an evidence that the sets of positive partial transpose states and separable states have totally different shapes.
Recommendations
- Minimum distance of the boundary of the set of PPT states from the maximally mixed state using the geometry of the positive semidefinite cone
- Families of bipartite states classifiable by the positive partial transposition criterion
- The generalized partial transposition criterion for separability of multipartite quantum states
- Separability criterion and inseparable mixed states with positive partial transposition.
- Separability of mixed states: necessary and sufficient conditions.
Cites work
- A de Finetti representation for finite symmetric quantum states
- A generalization of quantum Stein's lemma
- A matrix realignment method for recognizing entanglement
- Classical complexity and quantum entanglement
- Computational complexity of the quantum separability problem
- Further results on the cross norm criterion for separability
- Geometry of Quantum States
- Geometry of sets of quantum maps: A generic positive map acting on a high-dimensional system is not completely positive
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature?
- Nonadditivity of Rényi entropy and Dvoretzky's theorem
- NP vs QMA\(_{\log}(2)\)
- On the Bures volume of separable quantum states
- On the geometry of entangled states
- On the structure of the body of states with positive partial transpose
- One-and-a-half quantum de Finetti theorems
- Quantum -entropy inequalities: independent condition for local realism?
- Real Analysis and Probability
- Separability Criterion for Density Matrices
- Separability of mixed states: necessary and sufficient conditions.
- Strong NP-hardness of the quantum separability problem
Cited in
(5)- Limitations of semidefinite programs for separable states and entangled games
- Minimum distance of the boundary of the set of PPT states from the maximally mixed state using the geometry of the positive semidefinite cone
- Quantum de Finetti theorems under local measurements with applications
- On the structure of the body of states with positive partial transpose
- An improved semidefinite programming hierarchy for testing entanglement
This page was built for publication: Approximating the set of separable states using the positive partial transpose test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249127)
