Separability, PPT & Entanglement Witnesses
Detecting entanglement in mixed states.
Is a given density matrix entangled? For a pure state one glance at the Schmidt rank decides. For mixed states the question is NP-hard in general, yet for two qubits a single eigenvalue settles it, and in the lab a few local measurements can certify entanglement without full tomography. Both facts come from the convex geometry of the separable set.
What you’ll learn
- Define separability and explain why deciding it is hard in general.
- Prove the Peres criterion, apply it to Werner states, and explain why PPT is also sufficient in dimensions and .
- Construct entanglement witnesses (from NPT eigenvectors, fidelities and local correlations) and relate them to positive maps via Hahn–Banach and the Choi–Jamiołkowski correspondence.
- Build a bound entangled state from an unextendible product basis and explain why only non-decomposable witnesses can detect it.
The separability problem
A mixed state has infinitely many decompositions into pure states, and being entangled means that none of them is a mixture of products. Deciding membership in is NP-hard (Gurvits, 2003), even to inverse-polynomial accuracy (Gharibian, 2010). In practice one therefore uses criteria, necessary conditions for separability whose violation proves entanglement, and witnesses, observables whose negative expectation value certifies it.
Partial transposition
Werner states. is locally equivalent to , half the swap operator, with eigenvalues . Hence has with eigenvalues (three times) and .
Above which value of is the Werner state NPT, and hence entangled?
Show the answer
0.33
The eigenvalue turns negative for . Since PPT is exact for two qubits (below), is separable for and entangled above. Compare CHSH, which needs .
The transpose is one positive map; Peres's criterion tests just that one, and in low dimensions that is enough. Every positive map between matrix algebras (Størmer, 1963), and between and matrix algebras (Woronowicz, 1976), is decomposable: with completely positive. For a PPT state,
so it passes every positive-map test and is separable.
Entanglement witnesses
From an NPT eigenvector. , while for separable , by the Peres criterion.
Fidelity witness. The largest overlap of a product state with is its largest Schmidt coefficient . For , detects every state with fidelity .
Few local settings. For a product state with Bloch vectors , , and convexity extends this to all of . For , .
Witnesses and maps. By the Choi–Jamiołkowski correspondence, is a witness iff it is, up to normalization, the Choi matrix of a map that is positive but not completely positive. A witness is decomposable if with . For a PPT state,
so decomposable witnesses never detect PPT entanglement.
A witness has the form with . Can it detect a PPT entangled state?
- Yes, if the local dimensions are large enough
- Only if
- Never: whenever
- Yes, if has full rank
Show the answer
C. Never: whenever
Both terms are non-negative for a PPT state: since , and since . Detecting bound entanglement requires non-decomposable witnesses, which correspond to non-decomposable positive maps.
Bound entanglement and beyond PPT
To find PPT entangled states, look for a state whose range contains no product vector at all. Unextendible product bases provide exactly that.
The normalized projector onto the 4-dimensional complement of the UPB .
Every is a product of real vectors, so partial transposition maps each projector to itself: is PPT.
If were separable, , each product vector would lie in the range of , hence be orthogonal to all five , contradicting unextendibility. So is entangled and PPT: bound entangled (Bennett, DiVincenzo, Mor, Shor, Smolin & Terhal, 1999).
Detecting such states needs tools beyond PPT. The realignment (CCNR) criterion states that every separable has , where rearranges matrix elements as ; for the Tiles state , which certifies its entanglement. Alternatively one needs non-decomposable witnesses, for example built from Choi's positive map on matrices.
Complete hierarchies. is separable iff, for every , it has a symmetric extension to : a state invariant under permutations of the whose marginal is (one may also demand PPT). Each level is a semidefinite program: the Doherty–Parrilo–Spedalieri hierarchy (2002, 2004). Quantum de Finetti theorems bound the distance of a -extendible state from by a quantity of order . Consistent with NP-hardness, the cost of reaching a fixed accuracy grows exponentially with the local dimension.
Key takeaways
- is convex and compact; deciding membership is NP-hard, so we use criteria (necessary conditions) and witnesses (certificates).
- Peres–Horodecki: separable , and in and the converse holds (decomposability of positive maps); the Werner state is entangled iff .
- Every entangled state is detected by some witness (Hahn–Banach). Witnesses correspond to positive, non-CP maps and can be built from NPT eigenvectors, fidelities or a few local correlations.
- PPT entangled (bound entangled) states exist beyond , for example from unextendible product bases; detecting them needs non-decomposable witnesses or criteria such as realignment.
- Symmetric-extension (DPS) hierarchies give complete SDP tests whose cost grows quickly, consistent with NP-hardness.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
For which bipartite dimensions is the PPT criterion necessary and sufficient for separability?
- All finite dimensions
- only
- for every
- and only
Show the answer
D. and only
Positive maps are decomposable exactly in these low dimensions (Størmer, Woronowicz), so PPT states pass every positive-map test. In and there are PPT entangled states.
A two-qubit state has fidelity . With the witness , what do you measure and conclude?
- : the state is entangled
- : the state is separable
- : the state violates CHSH
- : the state is entangled
Show the answer
A. : the state is entangled
, which certifies entanglement. A witness never certifies nonlocality: the Bell-diagonal state with weights has yet no CHSH violation.
Why is the Tiles state entangled?
- It is NPT
- Its reduced states are pure
- Its range contains no product vector, so it cannot be a mixture of product states
- It violates the CHSH inequality
Show the answer
C. Its range contains no product vector, so it cannot be a mixture of product states
Any separable decomposition would use product vectors from the range of , but every vector in the range is orthogonal to the UPB, and by unextendibility no such vector is a product.
Which statement about entanglement witnesses is correct?
- A single well-chosen witness detects all entangled states of a given dimension
- For every entangled state some witness detects it, but no single witness detects them all
- A non-negative witness value proves that the state is separable
- Measuring a witness requires full state tomography
Show the answer
B. For every entangled state some witness detects it, but no single witness detects them all
Hahn–Banach separation gives a witness for each entangled state, but the entangled set is not convex, so no single hyperplane cuts it off entirely from .
Further reading
- A. Peres, "Separability criterion for density matrices", Phys. Rev. Lett. 77, 1413 (1996).
- M. Horodecki, P. Horodecki & R. Horodecki, "Separability of mixed states: necessary and sufficient conditions", Phys. Lett. A 223, 1 (1996).
- P. Horodecki, "Separability criterion and inseparable mixed states with positive partial transposition", Phys. Lett. A 232, 333 (1997).
- A. C. Doherty, P. A. Parrilo & F. M. Spedalieri, "Distinguishing separable and entangled states", Phys. Rev. Lett. 88, 187904 (2002).
- O. Gühne & G. Tóth, "Entanglement detection", Physics Reports 474, 1 (2009).