Separable versus Entangled States
The deepest structural question you can ask about a shared quantum state is embarrassingly simple to state and notoriously hard to answer: could two distant parties have built it with nothing but a telephone? Werner's 1989 definition turns that question into geometry. A bipartite state is separable if it is a convex mixture of product states, — exactly the states preparable by local operations and classical communication (LOCC), whose only correlations are the classical kind carried by a shared random label . Everything else is entangled. The definition is a negation — "not separable" — and that innocent-looking not is where all the difficulty lives. It is the boundary between correlations a coin flip can fake and correlations that demand a genuine quantum channel between the labs. This dividing line organizes an enormous amount of physics. Entanglement is the resource that powers teleportation, superdense coding, device-independent cryptography, and quantum speedups; separable states are the "free" states, useless as a teleportation channel. For pure states the frontier is fully charted — the Schmidt decomposition reduces separability to a single number, the Schmidt rank. For mixed states it turns forbidding: deciding whether a generic is separable is NP-hard, and the separable set has a curved, high-dimensional convex boundary no finite catalogue of tests can trace. Yet that convexity is a gift. Because the separable set is closed and convex, every entangled state can be sliced off by a flat plane — an entanglement witness — and because separability survives transposing one party (a positive but not completely positive map), a single negative eigenvalue of the partial transpose betrays entanglement. This article assembles the definition, the pure-state criterion, the convex geometry, and the two workhorse detectors, and marks the line between entanglement and the rarer property of Bell nonlocality.
- A bipartite state is separable if it is a convex mixture of product states, ; entangled means exactly "not of this form."
- Separable states are precisely those preparable by LOCC; their correlations are classical, indexed by a shared random variable — no quantum channel required.
- Pure states are easy: is separable iff its Schmidt rank is , equivalently iff its reduced state is pure, equivalently iff the entanglement entropy vanishes.
- Mixed states are hard: deciding separability is NP-hard in general; in practice one uses the PPT criterion and entanglement witnesses, which exist because the separable set is closed and convex. The canonical test-bed, the two-qubit Werner state, is separable for and entangled for .
- Entanglement is necessary but not sufficient for Bell nonlocality: some entangled mixed states admit a local hidden-variable model, so entangled nonlocal.
- Key idea: Separable = convex mixture of product states = preparable by LOCC = only classical correlations; entangled is the complement. The separable set is closed and convex, which is exactly why hyperplane separation (witnesses) and positive-but-not-completely-positive maps (PPT) can detect entanglement.
Separable = convex mixture of product states = preparable by LOCC = carries only classical correlations, and entangled is everything else. The separable set is closed and convex, which is precisely why a separating hyperplane (an entanglement witness) exists for every entangled state and why a positive-but-not-completely-positive map (the partial transpose) can expose entanglement through a negative eigenvalue.
Where this lives today
The separable–entangled boundary is not a piece of abstract convex geometry that stays on the page — it is measured, daily, in every quantum-technology laboratory. Because full tomography scales exponentially, experimentalists certify entanglement in photonic, trapped-ion, and superconducting platforms by measuring a single tailored witness and reading off with only a handful of local settings; GHZ- and W-state witnesses of this kind now certify entanglement across tens of qubits. The Werner threshold (and its cousins for other noise models) sets concrete hardware targets: a Bell pair must emerge robustly outside SEP to be useful, so fidelity budgets are written directly against these boundaries. In dimensions the frontier splits again — bound-entangled states are PPT yet entangled, undistillable into Bell pairs by LOCC, with real consequences for the achievable key rates in entanglement-based quantum key distribution. And the deepest open problem is exactly the shape of the set in the figure: deciding membership in SEP is NP-hard, so despite the PPT test, entanglement witnesses, symmetric-extension hierarchies (the Doherty–Parrilo–Spedalieri semidefinite programs), and decades of effort, the separable body's high-dimensional geometry remains only partly charted — a rare case where a foundational definition still hides genuinely hard mathematics.
The physical picture
Picture two laboratories, Alice's and Bob's, joined only by a telephone line — classical bits, no qubits. They share a random seed drawn with probability ; conditioned on the seed, Alice builds a local state and Bob builds , independently, in their own labs. Average over the seed and you get . Every state buildable this way is separable, and its correlations are exactly as classical as the shared coin — Alice and Bob know , an eavesdropper reading only does not, but nothing quantum is being shared. Entanglement is defined by what the telephone cannot build: it requires an actual quantum channel connecting the labs at some point in the past. That operational story has a clean geometric shadow. Density operators form a convex body; the pure product states are its extreme "corners," and the separable states are their convex hull — a smaller convex body sitting inside the full state space. Entangled states are the points that fall outside this inner body but still inside the outer one. The maximally mixed state sits deep in the interior of the separable set, wrapped in a whole ball of separable states, while the maximally entangled Bell states sit as far outside as geometry allows. The first figure is this picture in the abstract, together with the two tools convexity hands us for free.
Two features of that picture do the real work. First, because SEP is closed and convex and is a point outside it, the Hahn–Banach separation theorem promises a hyperplane between them — written as a Hermitian operator , that plane is an entanglement witness, and a single expectation value certifies entanglement with a handful of local measurements. Second, transposing Bob's subsystem is a positive map (it sends density operators to density operators) but not a completely positive one, so it can act benignly on every separable term yet drag an entangled state to a matrix with a negative eigenvalue. The cleanest laboratory of both effects is a one-parameter family: a Bell state blended with white noise. The second figure follows that family across the separable–entangled boundary and shows exactly where, and why, the partial transpose goes negative.
The core equations
Separability is defined not by a formula for a single state but by membership in a set — the convex hull of product states. The mixed-state definition is the master equation from which everything else descends.
where: — a density operator on ; — classical probabilities of the shared label ; — local density operators held by Alice and Bob. Reading: a state is separable exactly when such a decomposition exists; one may always take the local states to be pure, and , so separability is membership in the convex hull of pure product states. For pure global states the whole question collapses to a single integer supplied by the Schmidt decomposition. This is the one regime where separability is trivially decidable.
where: — unit vectors in the two factors; — the number of nonzero coefficients in . Reading: rank means a single term, which factorizes; rank is entanglement, and there is nothing in between. Equivalently, one can read entanglement off the marginal alone, because tracing out Bob leaves a state whose eigenvalues are the squared Schmidt coefficients.
where: — the von Neumann entropy of , measured in bits (the entanglement entropy). Reading: a pure global state is a product exactly when its reduced state is pure, i.e. when the entanglement entropy is zero; any nonzero signals — and quantifies — pure-state entanglement. The first detector for mixed states is the entanglement witness, the operator form of the separating hyperplane in the figure above.
where: — a Hermitian observable defining the hyperplane; — the convex set of separable states; — an arbitrary separable state. Reading: a single negative expectation value is a certificate of entanglement, requiring no full tomography — only the few local settings that build . The second detector is the partial transpose, the concrete positive-but-not-completely-positive map that separability cannot survive going negative.
where: — the partial transpose on subsystem ; — basis indices of ; — basis indices of . Reading: separability forces , so a negative eigenvalue is an unambiguous entanglement certificate (the Peres necessary condition); in and it is also sufficient. The canonical test-bed for both detectors is the two-qubit Werner state, a Bell state diluted with white noise, whose entanglement can be dialed continuously.
where: — the mixing parameter, ; — the identity (the maximally mixed two-qubit state); — a Bell state. Reading: the reduced states are for every , so all correlations are nonlocal in origin; the PPT criterion locates the entanglement boundary sharply at .
Limiting cases
The character of the separability problem changes completely as you move between purity and dimension — it is trivial in one corner and intractable in another.
| Case | Result | Meaning |
|---|---|---|
| Pure states | Separable iff Schmidt rank ; entanglement fully quantified by . | |
| Two qubits / qubit–qutrit (, ) | separable | Peres–Horodecki PPT is necessary and sufficient — but only in these lowest dimensions. |
| Higher dimensions (, ) | separable | PPT-entangled (bound-entangled) states exist; deciding separability is NP-hard (Gurvits). |
| Near the center | ball around is separable | The maximally mixed state is robustly separable; enough white noise destroys any entanglement. |
| Entanglement vs nonlocality | SEP LHV all states | Some entangled states admit a local hidden-variable model, so entangled Bell-nonlocal. |
The goal is to prove that a pure bipartite state is separable if and only if exactly one Schmidt coefficient is nonzero, and to show that this single criterion wears three equivalent faces — Schmidt rank one, a pure reduced state, and zero entanglement entropy — so that the entire pure-state problem reduces to reading a single number off the marginal. We start from the Schmidt form guaranteed by the singular-value decomposition, trace out one party to expose the reduced spectrum, and analyze when factorization is possible.
Step 1. Every pure bipartite state can be written in Schmidt form with , , and orthonormal Schmidt bases ; the integer is the Schmidt rank. Why: applying the singular-value decomposition to the coefficient matrix of diagonalizes it simultaneously in both factors, and is the number of nonzero singular values — a basis-independent invariant.
Step 2. Trace out Bob: . The eigenvalues of are exactly the squared Schmidt coefficients , so is pure () precisely when . Why: purity of the marginal is equivalent to a single nonzero eigenvalue, which is the same statement as Schmidt rank one — the marginal remembers exactly the entanglement, nothing else.
Step 3. If then normalization forces , and , a product. Conversely a product state already is a one-term Schmidt decomposition, so it has . Why: a single Schmidt term with unit weight is literally a tensor product, closing the equivalence in both directions.
Step 4. Assemble the three faces: Schmidt rank reduced state pure entanglement entropy . Any one of them detects pure-state separability. Why: the entropy vanishes iff a single , which is rank one again — the same fact stated informationally, and the reason both detects and measures entanglement for pure states. *Verified: for the Bell state one gets , so , , and bit — maximally entangled, consistent with Nielsen & Chuang §2.5.*
Go deeper · Derivation B · 1 minThe partial-transpose threshold of the two-qubit Werner family
The goal is to compute exactly where a Bell state, progressively diluted with white noise, stops being entangled, by building the partial transpose of the Werner state, diagonalizing it, and locating the sign change of its smallest eigenvalue — a calculation that both produces the sharp threshold and showcases the PPT criterion as a complete test in the world. We compute the transpose of the pure Bell projector first, then add the noise floor, then impose positivity.
Step 1. Partial-transpose the Bell projector on Bob. Since and under , the two coherences move: and . Why: the partial transpose swaps only Bob's indices, converting the coherence of the Bell state into a coherence, which is where the negativity will hide.
Step 2. The transposed projector is ; on the block this is with eigenvalues , so has spectrum . Why: transposition preserves the trace () but not positivity — the lone is the fingerprint of maximal entanglement.
Step 3. Add the noise floor. Because , the Werner transpose is , with eigenvalues (three times) and (once). Why: the identity is invariant under transposition and merely shifts every eigenvalue by the same noise amount, so the spectrum is the Bell spectrum rescaled by and lifted by .
Step 4. Impose positivity. Three eigenvalues are positive for all ; the fourth obeys . So exactly for . Since the Horodecki theorem makes PPT necessary and sufficient in , the boundary is sharp: separable for , entangled for . Why: in the lowest dimensions no bound entanglement exists, so a single scalar sign flip decides separability outright — the threshold is exact, not merely a bound. *Verified: the four eigenvalues sum to ; at they are , the known Bell transpose; at they are . Consistent with Horodecki RMP 81, 865 (2009).*
Go deeper · Derivation C · 2 minEvery entangled state has an entanglement witness
The goal is to prove that the closedness and convexity of the separable set force a separating hyperplane between it and any entangled state, so that a Hermitian witness operator exists for every entangled — a purely geometric guarantee that underlies all experimental entanglement certification. We establish the two topological properties of SEP, invoke the Hahn–Banach separation theorem in the real space of Hermitian operators, and normalize the resulting functional into a witness.
Step 1. SEP is the closed convex hull of the compact set of pure product states ; both closedness and convexity are inherited by the hull, so SEP is a closed, bounded, convex body in the finite-dimensional real vector space of Hermitian operators. Why: finite dimension makes the hull of a compact set compact, hence closed — the separating-hyperplane theorem needs exactly this.
Step 2. Equip that real space with the Hilbert–Schmidt inner product . For an entangled , Hahn–Banach supplies a Hermitian and a real constant with for all and . Why: a point outside a closed convex set can always be strictly separated from it by a hyperplane, and in this inner-product space every hyperplane is "measure the observable ."
Step 3. Normalize away the offset. Replacing and using shifts the threshold to zero: for all separable , while . This is the canonical witness of equation (4). Why: subtracting a multiple of the identity is free because every state has unit trace, letting us fix the separating value at zero without loss.
Step 4. Read off the scope and the limit. Every entangled state is caught by some witness — but because the boundary of SEP is curved, no single catches them all; each witness is one tangent plane to a rounded body that needs infinitely many. Why: a convex body with a smooth boundary is the intersection of all its tangent half-spaces, so witnesses are individually incomplete yet collectively exhaustive. *Verified: this is the Horodecki characterization (Phys. Lett. A 223, 1 (1996)); the argument uses only finite-dimensionality and convexity, matching Watrous ch. 6.*
Worked examples
1 · The Werner state at p = 1/2 (fully worked)
Take the two-qubit Werner state (that is, ). Decide whether it is entangled, and quantify the entanglement by its negativity.
Step 1. Write the density matrix in the computational basis . The Bell projector contributes on the diagonal and on the off-diagonal; the noise term adds to every diagonal entry. With the diagonal entries are (for ) and (for ), and the off-diagonal entry is .
Step 2. Apply the PPT spectrum from the derivation with : the eigenvalues of are (three times) and (once), i.e. . As a check they sum to , as any transposed density operator must.
Step 3. Read the verdict. The partial transpose has a negative eigenvalue , so by the Peres criterion is entangled; because this is a system, PPT is also sufficient, so there is no ambiguity. Consistently, , on the entangled side of the threshold.
Step 4. Quantify it. The negativity , and in general for this family for (zero below). So at the state carries a modest but nonzero , rising to at the pure Bell state . at is entangled, with PPT spectrum and negativity .
2 · Classical correlation versus entanglement
Compare two two-qubit states: the classically correlated mixture and a pure state whose reduced density matrix is . Which are entangled?
Step 1. Test against the definition. It is already written as a convex combination of the product projectors and , each with weight . That is exactly the separable form of equation (1) with . So is separable — despite having perfectly correlated measurement outcomes, its correlation is purely classical.
Step 2. Cross-check with PPT. The only off-diagonal structure in is absent (it is diagonal), so ; no negative eigenvalue, consistent with separability. A diagonal state can never be entangled.
Step 3. Now the pure state. Its reduced state is mixed (two nonzero eigenvalues), so the Schmidt rank is and the global pure state cannot factorize — it is entangled. Quantify by the entanglement entropy: .
Step 4. Evaluate. and , so bits — partial entanglement, between the of a product state and the bit of a Bell pair. The classically correlated is separable; the pure state with mixed marginal is entangled with bits of entanglement entropy.
Physics of the portrait
The modern definition of entanglement — the convex, operational one this whole article rests on — is not a hundred years old. It was written down in 1989 by the person who also proved that entanglement and nonlocality are not the same thing.
Origins · 1 minReinhard Werner and how this was discovered
Reinhard F. Werner, a German mathematical physicist, gave entanglement the definition it still carries. Before 1989 "entangled" was used loosely for correlated quantum states, and it was widely assumed that entanglement and Bell nonlocality were one and the same. Werner's landmark paper "Quantum states with Einstein–Podolsky–Rosen correlations admitting a hidden-variable model" (Phys. Rev. A 40, 4277) severed both confusions at once. He defined a state to be separable precisely when it is a convex mixture of product states — the operationally clean statement that it can be prepared by local operations and shared classical randomness — and called everything else entangled. Then, in the same paper, he constructed an explicit family of entangled states (now the Werner states, symmetric under ) that nonetheless admit a local hidden-variable model for all projective measurements, proving that an entangled state can be perfectly local. This single stroke created the modern hierarchy — product separable, and nonlocal steerable entangled — and set the agenda for two decades of work on detection (the Peres and Horodecki criteria, entanglement witnesses) and quantification (entanglement measures) that his convex-geometric framing made possible. Werner, long at the Technical University of Braunschweig and Hannover, remained a central figure in the mathematical foundations of quantum information, but it is this one definition — SEP as a closed convex set — that every article on entanglement now begins from.
Going further
Texts. Nielsen & Chuang, Quantum Computation and Quantum Information, §2.2.8 and §12.5 (density operators, entanglement) · Watrous, The Theory of Quantum Information, ch. 6 (separability, witnesses, PPT) · Wilde, Quantum Information Theory, ch. 4 and 11 · Preskill, Lecture Notes on Quantum Computation, ch. 4 (entanglement) · R. Horodecki, P. Horodecki, M. Horodecki, K. Horodecki, "Quantum entanglement," Rev. Mod. Phys. 81, 865 (2009) · Werner, Phys. Rev. A 40, 4277 (1989) · Peres, Phys. Rev. Lett. 77, 1413 (1996); Horodecki³, Phys. Lett. A 223, 1 (1996) · Gurvits, STOC 2003 (NP-hardness of separability).
Provenance. A verifier should recompute: (1) the Schmidt-rank/entropy criterion and the Bell values , bit (Nielsen & Chuang §2.5, §12.5); (2) the Werner partial-transpose spectrum , its threshold, and the values with negativity (Horodecki RMP 81, 865; Werner PRA 40, 4277); (3) the PPT positivity-preservation argument and its sufficiency in , (Peres PRL 77, 1413; Horodecki³ PLA 223, 1); (4) the witness-existence argument via Hahn–Banach (Watrous ch. 6; Horodecki PLA 223); (5) bit. NP-hardness of separability per Gurvits, STOC 2003; all numbers are standard.
Prerequisites. Density Operators and Mixed States · Tensor Products and Bipartite Systems · Schmidt Decomposition. Leads to. Peres–Horodecki / PPT Criterion · Entanglement Witnesses · Concurrence and Wootters' Formula · Entanglement of Formation · CHSH Inequality and Its Quantum Violation · Bell States and EPR Pairs.
Ask the tutor: Ask me to run the PPT test on any two-qubit state you have in mind, or to show why your favorite Werner state sits on the separable or the entangled side of .
What exactly is the difference between a product state and a separable state?
A product state has no correlation at all: measurement outcomes on the two halves are statistically independent. A separable state is more general — it can be strongly correlated, but only classically, through the shared random label . The textbook example is : measure both qubits in the computational basis and you always get matching results, a perfect correlation, yet the state is separable because that correlation is just a shared coin flip. So every product state is separable, but most separable states are not products. "Separable" means "no more than classical correlation," never "no correlation."
Why is deciding separability hard when the definition looks so simple?
The definition asks whether any decomposition into product states exists — an existential quantifier over an infinite, unstructured set of possible ensembles. There is no bound on how many product terms you might need (up to by Carathéodory), and the product states can be non-orthogonal and point anywhere. Searching that space is genuinely intractable: Gurvits proved in 2003 that deciding separability is NP-hard. The PPT criterion and witnesses are tractable one-sided tests — they can prove entanglement (or, in low dimensions, separability) — but no efficient algorithm certifies separability in general dimension, which is why the field relies on a toolbox of partial tests rather than a single decision procedure.
If the partial transpose is positive, is the state definitely separable?
Only in the smallest systems. In and dimensions the Horodecki theorem makes PPT necessary and sufficient, so does guarantee separability there. But from and onward, PPT-entangled states exist: they have a positive partial transpose yet are entangled. This "bound entanglement" cannot be distilled into pure Bell pairs by LOCC, which is why it hid from the earliest tests. So in general is only a necessary condition for separability — it rules out one kind of entanglement (the distillable, NPT kind) but not all of it.
How can an entangled state fail to be nonlocal?
Bell nonlocality means a state produces measurement statistics that no local hidden-variable (LHV) model can reproduce. Werner's 1989 construction gave explicit entangled mixed states — the Werner states below a certain noise level — that do admit an LHV model for all projective measurements, so they violate no Bell inequality despite being entangled. The resolution is that entanglement is a property of the state (it cannot be made by LOCC), while nonlocality is a property of the measurement statistics the state can generate. Mixing with noise can wash out the nonlocal correlations while leaving a trace of entanglement that a witness or the PPT test still detects. Hence the strict hierarchy: nonlocal states are a proper subset of entangled ones.
Why does the separable set being convex matter so much?
Convexity is what makes entanglement detectable. Because SEP is a closed convex set, the Hahn–Banach separation theorem guarantees that any entangled state — a point outside the set — can be separated from it by a flat hyperplane. Expressed as a Hermitian operator, that hyperplane is an entanglement witness : an observable whose expectation is nonnegative on every separable state but negative on the target. This is why a laboratory can certify entanglement with a few measurements instead of full tomography. Convexity also underlies the PPT test (a positive map maps the convex set into positive operators) and the semidefinite-programming hierarchies used to approximate SEP from outside. Without convexity, none of these tools would exist.
Does adding noise always destroy entanglement eventually?
Yes. The maximally mixed state sits deep in the interior of the separable set, surrounded by a ball of separable states of finite radius (the Gurvits–Barnum result). So any state, mixed with enough white noise, is eventually dragged into that ball and becomes separable — entanglement is not robust to unlimited noise. The Werner family makes this quantitative: is separable once , i.e. once the Bell component is diluted to one-third weight or less. This is exactly why noise thresholds like function as hardware targets: a device must keep its shared states robustly outside the separable ball to deliver any entanglement-based advantage.