TL;DR
This paper investigates whether a quantum state that is "absolutely PPT" (meaning all its unitary transformations are positive partial transpose) is also "absolutely separable." The authors develop a general method to show that several common entanglement detection techniques fail to distinguish between these two properties, suggesting that the partial transpose criterion might be insufficient for absolute separability in higher dimensions.
What Problem Does This Paper Address?
In quantum information theory, a fundamental task is to distinguish between separable and entangled quantum states. A state is separable if it can be expressed as a convex combination of product states. Entanglement, on the other hand, signifies a non-classical correlation that is crucial for quantum computation and communication. While various criteria exist to detect entanglement, they are not always perfect.
The "absolute separability problem" focuses on states that remain separable even after any unitary transformation is applied to them. Similarly, "absolute PPT" refers to states where all unitary transformations preserve the positive partial transpose (PPT) property. The core question this paper tackles is whether being "absolutely PPT" is equivalent to being "absolutely separable." This is a crucial question because the PPT criterion is a necessary but not always sufficient condition for separability, and understanding its behavior under unitary transformations is key to characterizing truly separable states.
Methods
The authors employ a powerful technique based on semidefinite programming (SDP). They leverage Lemma 1, which connects the minimum of a certain operator to a sum of eigenvalue products. This lemma allows them to translate the problem of determining if an entanglement witness can detect entanglement in an absolutely PPT state into an SDP.
A key contribution is Lemma 2, which provides a general condition for an entanglement witness to fail to detect entanglement in any absolutely PPT state. This condition depends on the witness's largest eigenvalue and the sum of its negative eigenvalues. By applying this lemma, the authors can demonstrate that several standard entanglement detection methods, including the realignment criterion, the Choi map, and the Breuer-Hall map, are incapable of detecting entanglement in absolutely PPT states.
Datasets
Not discussed in the paper.
Key Insights and Ideas
- The "Absolute" Regime is Different: The paper highlights that properties like being PPT or separable behave differently when considering all possible unitary transformations of a state. What might be a strong entanglement detector in the standard setting can become weak in the "absolute" regime.
- A Universal Tool for Non-Detection: Lemma 2 provides a general framework to prove that certain entanglement witnesses cannot detect entanglement in absolutely PPT states. This is a significant methodological contribution.
- Partial Transpose Might Not Be Enough: The central finding suggests that while absolute PPT is a strong condition, it might not fully capture absolute separability, especially in higher dimensions. Several standard criteria fail to distinguish between them.
- Geometric Intuition: The paper uses figures to illustrate the relationships between different sets of states (separable, PPT, absolutely separable, absolutely PPT), providing valuable intuition about their containment and differences.
Key Results
- The paper demonstrates that the realignment criterion, the Choi map, and the Breuer-Hall map cannot detect entanglement in any absolutely PPT state. This means that for these criteria, the set of absolutely PPT states is a subset of the set of states that these criteria deem separable.
- They prove that for isotropic states, absolute separability and absolute PPT coincide.
- For Werner states, they establish conditions under which these states are absolutely separable and when they are not absolutely PPT.
- They provide numerical evidence and partial analytic results for generalized Choi maps and UPB states, suggesting that for these families as well, the distinction between absolute PPT and absolute separable might be blurred.
Limitations and Future Work
- Question 1 Remains Open: The paper explicitly states that the main question—whether absolute separability is determined by the partial transpose (i.e., if absolute PPT implies absolute separability for all states)—remains open.
- Generalization of Lemma 2: While Lemma 2 is powerful, the function defining the condition for non-detection is not continuous, making it sometimes difficult to use. The authors suggest exploring other functions of eigenvalues that could serve a similar purpose.
- Analytic Proofs for Generalized Choi Maps and UPB States: For generalized Choi maps and UPB states, the authors have numerical evidence suggesting that these maps cannot detect entanglement in absolutely PPT states, but they lack a rigorous analytic proof for all cases.
- Other Separability Criteria: The paper poses the question of whether other separability criteria, such as those based on covariance matrices or symmetric extensions, can be shown to be incapable of detecting entanglement in absolutely PPT states.
Summary updated