Product States and Separability
Quantum mechanics hands a composite system the tensor-product Hilbert space , and the first question one can ask of any joint state is whether it hides a correlation between the parts. The states that hide none are the product states and their classical mixtures, the separable states. These carry a crisp operational identity: they are exactly the states two distant experimenters, Alice and Bob, can build using local operations and a shared coin flip — no quantum channel ever runs between the labs. Everything they cannot build this way is entangled, and entanglement is the one structural feature of composite quantum systems with no classical shadow. That single dividing line organizes half of quantum information theory. Entanglement is the fuel of teleportation, dense coding, and device-independent cryptography, and it is the reason the state space of is vastly larger than the product of the two local state spaces. For a pure state the boundary is sharp and computable: the Schmidt decomposition rewrites in a canonical bi-orthonormal form, and the count of nonzero terms — the Schmidt rank — is one exactly when the state factorizes. The reduced density operator is then pure, and its entropy measures the entanglement. For mixed states the geometry turns subtle. A state can carry classically correlated, genuinely mixed marginals and still be separable, so marginal mixedness no longer signals entanglement. Deciding whether an arbitrary admits any product decomposition is NP-hard, so one leans on one-sided witnesses — above all positivity under partial transpose. This article builds the definitions, the LOCC meaning, the detection tools, and the small dimensions where the whole question closes.
- A bipartite pure state is a product state when it factorizes, ; if no such factorization exists it is entangled.
- For mixed states the right notion is separability: is separable iff it is a convex mixture of products — precisely what Alice and Bob can prepare by local operations and shared randomness.
- Pure-state product structure is detected by the Schmidt rank: a state is a product iff its Schmidt rank equals , equivalently iff its marginal is pure and .
- Product states have uncorrelated statistics: every joint expectation factorizes, , which is why separable resources can never beat the classical bounds of Bell-type games.
- Deciding separability is NP-hard in general, so the Peres–Horodecki (PPT) criterion is used as a one-way test: separable partial transpose positive, and it becomes iff only in and .
- Key idea: separable = preparable by local operations and shared randomness, a convex mixture of products ; everything else is entangled, and for pure states that collapses to the single sharp test Schmidt rank .
A bipartite state is separable exactly when it is a convex mixture of product states — everything Alice and Bob can build with local operations and shared randomness — and everything outside this convex body is entangled; for pure states the criterion reduces to Schmidt rank .
Where this lives today
The separable-versus-entangled boundary is now the daily currency of experimental quantum information. Because full state tomography scales exponentially, labs almost never reconstruct to certify entanglement; instead they measure a single entanglement witness — a Hermitian observable engineered so that for every separable state while for the target. The convexity of the separable body guarantees such a hyperplane exists, and a handful of local measurement settings suffices to evaluate it, which is how entanglement is verified in trapped-ion registers, superconducting processors, and photonic experiments. The Werner threshold reappears directly as a noise budget: an entanglement-distillation or teleportation protocol fed a depolarized Bell pair fails once the singlet fraction drops through the separability floor, so the number sets how much depolarizing noise a link can tolerate before its resource is worthless. At the frontier sits bound entanglement — the PPT-entangled states the Horodeckis found in 1998 — which is entangled yet cannot be distilled to pure singlets by any LOCC protocol; some of these states nonetheless enable secret-key generation, and detecting them requires witnesses strictly stronger than PPT. Deciding separability in general remains provably NP-hard, so the field runs on a growing toolbox of witnesses, symmetric extensions, and semidefinite relaxations rather than any single exact test.
The physical picture
Two experimenters sit in distant labs. They may telephone each other and consult a shared table of random numbers, but no quantum system ever crosses between them. Whatever joint state they manage to prepare is separable — a menu of local recipes indexed by a broadcast classical label. Entanglement is by definition the correlation this procedure can never manufacture. Geometrically the separable states form a convex body sitting inside the full state space: mixing two separable states gives a separable state, and the extreme points that generate the body are exactly the pure products . Every entangled state lives outside that body, and because the body is convex a flat hyperplane — an entanglement witness — can always be slipped between it and any chosen entangled point. The first figure is that geometry.
For pure states the whole question collapses to a count. Write the amplitudes of as a matrix with rows indexed by and columns by ; the Schmidt rank is just the matrix rank of . Rank one means the matrix is an outer product , which is precisely — a product. Any higher rank means entangled, and the singular values of are the Schmidt coefficients whose spread measures how much entanglement is present. The cleanest thermometer is a mixed marginal: trace out one side and read the entropy. Mixed states lose this simplicity because many distinct product ensembles average to the same , so a mixed marginal no longer implies entanglement. The sharpest practical handle for mixed states is the partial transpose, and the two-qubit Werner state shows exactly where its verdict flips from separable to entangled — the subject of the second figure.
The core equations
The starting point is the simplest possible joint state: one where each subsystem carries a definite pure state of its own and the two are stapled together with a tensor product. Nothing about is correlated with anything about .
where: — normalized state of subsystem ; — normalized state of subsystem ; — tensor (Kronecker) product joining the two factor spaces. Reading: a pure state is a product exactly when it splits into one ket per subsystem, and then a measurement on tells you nothing about . Mixed states demand the more general notion. Allow a shared classical label , drawn with probability and announced to both parties, and let each party prepare a local state conditioned on it. Averaging over the forgotten label gives the separable set.
where: — probabilities of the shared classical label ; — local density operators conditioned on . Reading: this convex combination of products is, by construction, the most general state reachable with local operations and classical communication (LOCC); a state is separable iff at least one such decomposition exists. Any bipartite pure state can be rotated into a canonical diagonal form using a single pair of local orthonormal bases. This Schmidt decomposition is the workhorse that turns "is it a product?" into "how many terms survive?"
where: — the Schmidt rank, the number of nonzero terms; with — the Schmidt coefficients; — orthonormal Schmidt bases of and . Reading: the state is a product exactly when ; any is entanglement, and the marginals share the spectrum . Product structure has an immediate statistical fingerprint: joint expectation values come apart into a plain product of local averages. Correlations of every observable pair vanish.
where: — local observables on the two subsystems; — the local expectation. Reading: for a product state the connected correlator is identically zero, so a product state describes statistical independence. For a pure bipartite state the amount of entanglement is faithfully captured by the von Neumann entropy of either marginal — an entropy that is zero exactly for products and maximal for the flattest Schmidt spectrum.
where: — von Neumann entropy of the marginal, in bits; — Schmidt coefficients of . Reading: iff a single (a product), and for the maximally entangled state of two -level systems. Detecting entanglement in a mixed state needs a computable test. Transpose only the block of in some product basis; a separable state stays a valid density operator, so any negative eigenvalue certifies entanglement.
where: — transpose applied only to 's indices; index , and index . Reading: this is the Peres–Horodecki (PPT) criterion — separability implies positivity of the partial transpose, and in and the converse holds too, making PPT a complete test there.
The goal is to show that the algebraic definition of separability — a convex mixture of product density operators — is not an arbitrary formula but the precise mathematical image of what two spatially separated parties can build when they are allowed to act locally on their own systems and to talk on a classical telephone, but are forbidden to send any quantum system to each other. We want the operational story and the equation to line up term by term, so that "separable" and "preparable by local operations and shared randomness" become interchangeable names for one set.
Step 1. Give Alice and Bob a source of shared randomness: a referee samples an index with probability and broadcasts it to both labs over a classical channel. This is the only thing crossing between the parties, and it is classical. Why: shared randomness is free under LOCC and is exactly what a common classical label encodes.
Step 2. Conditioned on hearing , Alice prepares the local state on her system and Bob independently prepares on his, with no quantum link. The joint conditional state is the product . Why: acting locally on disjoint systems produces a tensor product, never anything more correlated, because the two preparation maps commute and touch different factors.
Step 3. Now forget the label — either the referee discards it or it is never recorded. Averaging the conditional states over gives , which is exactly equation (2). Why: marginalizing a classical register turns a conditional ensemble into a convex mixture, so the reachable states are precisely the convex hull of product states.
Step 4. Finally, general LOCC — local quantum channels interleaved with rounds of classical messaging — cannot escape this set. A local channel maps each to , still a valid local state, and classical messages only refine the label . Every operation preserves the convex-sum-of-products form. Why: this is why entanglement is a resource — it is monotone non-increasing under LOCC, so it can be consumed but never created locally.
Go deeper · Derivation B · 1 minA Bell state admits no product factorization
The goal is to prove, in two independent ways, that the maximally entangled state is genuinely entangled and not merely a product written in a clever basis. First we assume a factorization exists and drive the amplitude-matching conditions into a flat contradiction; then we cross-check by computing the reduced state and reading its Schmidt rank, so that the direct algebra and the rank criterion give the same verdict and reinforce each other.
Step 1. Write the most general two-qubit product, , with . This is the target we must either match or rule out. Why: any product pure state, in any local bases, has exactly this bilinear amplitude structure.
Step 2. Match coefficients against : the and amplitudes are absent, forcing and , while . Why: two states are equal only if every amplitude agrees, so the missing cross terms become hard algebraic constraints.
Step 3. Now forces or . Either choice kills one of the required nonzero products — makes , and makes — contradicting . No amplitudes work, so no factorization exists. Why: the vanishing cross terms and the nonvanishing diagonal terms cannot be satisfied at once, which is the algebraic signature of entanglement.
Step 4. Cross-check by Schmidt rank. Tracing out gives , the maximally mixed qubit with eigenvalues , so the Schmidt rank is and bit. Why: rank independently confirms entanglement, and bit marks it as maximal for a qubit pair.
Go deeper · Derivation C · 1 minThe Werner state and its separability threshold
The goal is to find the exact noise level at which the two-qubit Werner state — a singlet contaminated by white noise — stops being entangled and becomes separable, and to do it with the PPT criterion, which is both necessary and sufficient in this setting. We define the family, compute the spectrum of its partial transpose in closed form, demand positivity, and read off the crossover, arriving at a clean threshold that later reappears as a noise budget for entanglement-based protocols.
Step 1. Define with the singlet and . It interpolates from the maximally mixed state at to the pure singlet at . Why: this one-parameter family models a maximally entangled resource degraded by depolarizing noise, the realistic situation in any lab.
Step 2. Compute the partial transpose. Transposing the block, the four eigenvalues of are (three-fold) and (once). Direct diagonalization confirms these values exactly. Why: the noise term is proportional to the identity and transpose-invariant, so only the singlet's partial transpose, which has one negative-going eigenvalue, moves the spectrum.
Step 3. Impose positivity. Three eigenvalues stay positive for all , so the test rests entirely on the fourth: . For the partial transpose acquires a negative eigenvalue — the state is NPT. Why: a single sign change is what separates the PPT region from the entangled region, and it happens at .
Step 4. Close the argument with sufficiency. Because this is a system, the Horodecki theorem guarantees PPT is also sufficient, so is separable for every and entangled for every . The threshold is exactly . Why: only in and does PPT close both ways, turning a one-sided witness into an exact separability certificate.
Limiting cases
Separability behaves differently depending on purity and on the dimensions of the two subsystems.
| Case | Result | Meaning |
|---|---|---|
| Pure state | For pure entanglement is equivalent to a mixed marginal; the marginal entropy measures it exactly. | |
| and | Peres–Horodecki: PPT is necessary AND sufficient (Horodecki theorem), so separability is fully decidable. | |
| Bound-entangled (PPT) states exist; the partial transpose becomes only a necessary test and misses them. | ||
| Werner state | separable | The two-qubit singlet-plus-noise family crosses from separable to entangled and NPT exactly at . |
| Maximally entangled | Flat Schmidt spectrum; the marginal carries no local information and all of it hides in the correlations. |
Worked examples
1 · Diagnosing a two-qubit pure state (fully worked)
Two states are on the table: and . For each, decide product versus entangled and quantify the entanglement.
Step 1. Factor by inspection. Group the ket: . It is a clean tensor product, so its Schmidt rank is and it is a product state; its marginal is pure with . No entanglement.
Step 2. For , read off the Schmidt form directly — it is already diagonal in with coefficients and . Two nonzero terms means Schmidt rank , so is entangled.
Step 3. Quantify it. The marginal is , so the entanglement entropy is . Numerically and , giving .
Step 4. Sanity-check the extremes. If the weights were the state would be the product with ; if they were it would be the Bell state with bit. Our bits sits between, marking as partially entangled. Product : S = 0; entangled : Schmidt rank 2, S = 0.469 bits.
2 · Reading the Werner threshold at two noise levels
A source emits the two-qubit Werner state . Test (heavy noise) and (light noise): is each separable or entangled?
Step 1. Use the closed-form partial-transpose spectrum from the derivation: eigenvalues (three of them) and (one). Only the last can go negative, so it is the entire test.
Step 2. At : the critical eigenvalue is , and the triple is . All four eigenvalues are non-negative, so is PPT; in that means separable. Consistent with .
Step 3. At : the critical eigenvalue is , negative, so the partial transpose is indefinite. is NPT and therefore entangled. Consistent with .
Step 4. Locate the boundary. Setting gives , the exact fidelity floor: any Werner source with singlet weight above one-third carries distillable entanglement, and anything at or below is a useless classical mixture. p = 0.2 separable, p = 0.8 entangled, crossover at p = 1/3.
Physics of the portrait
Separability as a precise mathematical predicate — as opposed to a vague sense that some states are "more correlated" than others — is a surprisingly modern invention. The word was pinned down only at the end of the 1980s, and the person who pinned it is the natural face for this article.
Origins · 1 minReinhard Werner and how this was discovered
For half a century after Einstein, Podolsky, Rosen and Schrödinger, "entanglement" was understood cleanly only for pure states, where a mixed marginal settles the question. Mixed states were a fog: a density matrix can be correlated for utterly classical reasons, and no one had a sharp line between correlation that a local-hidden-variable model can explain and correlation that it cannot. Reinhard Werner drew that line in a single 1989 paper. He defined a bipartite mixed state to be classically correlated — the term that became separable — exactly when it can be written as a convex mixture of product states , and entangled otherwise, and he showed this is the operationally right notion by tying it to what local operations and shared randomness can prepare. To prove the definition had teeth he constructed the family now called Werner states: highly symmetric mixtures of a maximally entangled state with white noise that are provably entangled yet, for a range of parameters, admit an explicit local-hidden-variable model reproducing all projective-measurement statistics. That single example dissolved the naive hope that entanglement and Bell nonlocality are the same thing — some entangled states are local. Werner's convex-geometric framing set the agenda for everything that followed: the Peres–Horodecki criterion, entanglement witnesses, distillation, and the whole resource theory of entanglement are built on the separable-versus-entangled partition he made precise.
Going further
Texts. Nielsen & Chuang, Quantum Computation and Quantum Information, §2.2.8 (Schmidt decomposition) and §12.5 (entanglement) · Preskill, Lecture Notes on Quantum Computation, Ch. 4 · Watrous, The Theory of Quantum Information, Ch. 6 (separability and PPT) · Wilde, Quantum Information Theory, Ch. 4 and 11 · Kitaev, Shen, Vyalyi, Classical and Quantum Computation, Ch. 11 · Horodecki, Horodecki, Horodecki, Horodecki, "Quantum entanglement", Rev. Mod. Phys. 81, 865 (2009). Key numerical anchors: the rank-one contradiction for yields the marginal with bit; the entropy for weights is bits; the Werner partial-transpose eigenvalues are with threshold (at the critical eigenvalue is ; at it is ).
Prerequisites. Dirac Bra-Ket Notation · The Qubit and Its State Space · Inner Product, Norm, and Normalization · Density Operators · Superposition Principle. Leads to. Schmidt Decomposition · Entanglement Measures · Bell States and Inequalities · Quantum Teleportation · Peres–Horodecki / PPT Criterion.
Ask the tutor: Ask me to walk through the partial transpose of any two-qubit state, or to show why a specific state sits inside or outside the separable body.
What is the difference between a product state and a separable state?
A product state is the special case; a separable state is the general one. A product state factorizes completely — for pure states, or for mixed — so there is literally no correlation of any kind between the two subsystems. A separable state is any convex mixture of products, . Such a state can be strongly correlated, but only classically: the correlation lives entirely in the shared label . Every product state is separable, but most separable states are not products. Both, crucially, are preparable without entanglement.
Why is separability so much harder to test for mixed states than for pure states?
For a pure state you compute one marginal and look: a pure marginal means product, a mixed marginal means entangled, and the Schmidt rank settles it in one step. A mixed state has no such shortcut because a single can be written as many different ensembles of products, and to certify separability you must show that at least one product decomposition exists among infinitely many candidates. Searching that space is a hard convex-geometry problem — proven NP-hard in the dimension. So instead of an exact algorithm one uses one-sided witnesses like PPT, which can prove entanglement quickly but cannot always prove separability.
Does a negative partial transpose always mean the state is entangled?
Yes — that direction is airtight in every dimension. If were separable, its partial transpose would be a convex sum of , each a valid positive operator, so necessarily. A single negative eigenvalue therefore rules out separability and certifies entanglement. What is not always true is the converse: a positive partial transpose does not guarantee separability once , where bound-entangled PPT states live. So "NPT entangled" is universal, while "PPT separable" holds only in and .
Are entanglement and Bell nonlocality the same thing?
No, and Werner's own construction is the counterexample. Every state that violates a Bell inequality must be entangled, because separable states factorize their correlators and obey the CHSH bound of . But the reverse fails: Werner exhibited entangled mixed states that nonetheless admit an explicit local-hidden-variable model reproducing all projective-measurement statistics, so they are entangled yet Bell-local. Entanglement is the broader property — a statement about how the state is built — while Bell nonlocality is a statement about measurement statistics that only some entangled states display. Later work also separates both from quantum steering, a third notion sitting strictly between them.
Why can't local operations and classical communication create entanglement?
Because every LOCC step preserves the convex-mixture-of-products form. A local quantum channel acts as on one factor and leaves the other alone, sending products to products. Classical communication only correlates or refines the shared label , which is exactly the ingredient that builds convex mixtures. So starting from a separable state and applying any sequence of local operations and classical messages, the output is still — separable. This is the precise sense in which entanglement is a resource: it can be consumed, converted, or degraded locally, but never manufactured from scratch without a quantum interaction.
What is bound entanglement, and why does it matter?
Bound entanglement is entanglement you cannot get back out as pure singlets. In dimensions with there exist entangled states whose partial transpose is positive — PPT-entangled states — and no LOCC protocol can distill even a single maximally entangled pair from any number of copies of them. They are genuinely entangled, yet the standard entanglement currency is frozen inside. This matters because it breaks the tidy picture where entanglement is one fungible resource: distillable and bound entanglement behave differently, PPT no longer detects entanglement, and stronger witnesses are needed. Remarkably, some bound-entangled states still support secure key distribution, so even undistillable entanglement can do useful cryptographic work.