Separable Mixed States
A separable mixed state is a bipartite density operator that can be prepared as a classical random mixture of product states. It may contain ordinary correlations between subsystems, but it contains no entanglement across the specified subsystem split.
For a finite-dimensional bipartite system
a mixed state is separable if it can be written as
If no such decomposition exists, the mixed state is entangled.
For infinite-dimensional normal states, separability means the trace-norm closure of finite convex mixtures of product states. A separable state need not then admit an exact countable product ensemble. The rigorous extension is developed in Separable and Entangled Mixed States.
Helpful background. Product states explains factorization; density operators explains why different ensembles can describe the same state.
Product mixed states
Section titled “Product mixed states”The simplest unentangled mixed state is a product density operator:
This represents independent subsystem states. For bounded local observables,
Thus product mixed states have factorized expectation values for product observables. They have no correlations between and .
Product mixed states are separable, but they are not the only separable states.
Classical Mixtures of Product States
Section titled “Classical Mixtures of Product States”A separable state may be a mixture of different product preparations. Operationally, one can imagine a classical random variable being sampled with probability , after which subsystem is prepared in and subsystem is prepared in .
The resulting density operator is
The shared label can create correlations without entanglement. The label is classical, but the conditional local states need not commute or be mutually distinguishable. Therefore “separable” does not mean that every kind of quantum correlation vanishes; see the nonorthogonal example below.
In finite-dimensional systems, one may also write separable states as mixtures of pure product projectors:
This follows by decomposing the local density operators in each product term into pure-state ensembles.
Separable but Correlated
Section titled “Separable but Correlated”The standard two-qubit example is
This state is separable because it is already written as a convex mixture of product projectors:
It is not a product state. The reduced density operators are
If it were the product of its reduced states, it would be
which assigns probability to each computational-basis outcome. Instead, assigns probability to , probability to , and zero to and .
Thus
The state is correlated, but not entangled.
Product, separable, and entangled are different conditions
Section titled “Product, separable, and entangled are different conditions”For pure states, failure to factor means entanglement. For mixed states, a failure to factor can instead result from shared randomness, as in .
The sets are nested: every product state is separable, and every separable state is a density operator. Some separable states are product and some are correlated. Entangled states lie outside the separable set.
Nonunique Ensembles
Section titled “Nonunique Ensembles”A density operator can have many different ensemble decompositions. This matters because seeing an entangled-state ensemble does not prove that the density operator is entangled.
For example, the maximally mixed two-qubit state is
It can be written as a product state:
So it is separable. But it can also be written as an equal mixture of Bell projectors:
where is the Bell basis. The presence of entangled vectors in one ensemble decomposition does not make the density operator entangled. Entanglement of a mixed state is a property of the density operator itself, not of one chosen story about how it was prepared.
Why Mixed-State Entanglement Is Harder
Section titled “Why Mixed-State Entanglement Is Harder”Pure-state entanglement has strong tools: coefficient rank, Schmidt decomposition, and reduced-state entropy.
Mixed-state entanglement is harder because one must rule out every possible separable decomposition:
for all choices of probabilities and local states.
The partial-transpose test is complete for two qubits and qubit–qutrit systems; in higher dimensions it can miss entanglement. An entanglement witness can certify entanglement through an expectation value. Failure to find a separable ensemble by guessing is not itself a criterion.
Nonorthogonal preparations need not be fully classical
Section titled “Nonorthogonal preparations need not be fully classical”Consider
This is separable by its displayed preparation. Measuring in the basis reads the classical label without changing the state when outcomes are ignored. On , however, the two conditional projectors do not commute:
No basis makes both conditional states diagonal, so they cannot be read as two orthogonal classical labels on . This is the distinction behind quantum discord: separable states can retain quantum correlations in a sense broader than entanglement. The comparison of classical correlation and entanglement develops this caution without requiring discord as an entanglement test.
Common pitfalls
Section titled “Common pitfalls”One product ensemble proves separability. One entangled ensemble does not prove entanglement; another ensemble may consist entirely of product states.
A mixed marginal does not prove mixed-state entanglement. It can reflect local noise or shared classical randomness. The reduced-purity criterion applies when the joint state is known to be pure.
Shared randomness does not make local quantum states orthogonal. Separability allows arbitrary local density operators, including noncommuting ones.
References
Section titled “References”- Ryszard Horodecki, Paweł Horodecki, Michał Horodecki, and Karol Horodecki, “Quantum entanglement,” Reviews of Modern Physics 81, 865–942 (2009). DOI.
- Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, 2010, section 2.5.
- H. Ollivier and W. H. Zurek, “Quantum Discord: A Measure of the Quantumness of Correlations,” Physical Review Letters 88, 017901 (2002 issue; published online 14 December 2001). DOI; preprint.
- John Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, chapter 6. Author-hosted text.
Exercises
Section titled “Exercises”- Prove that a convex mixture of two separable states is separable for .
Solution
If and , concatenate the two ensembles with weights and . These weights are nonnegative and sum to . Thus the separable set is convex. The set of product states is not convex, as demonstrates.
- For the nonorthogonal example above, compute and and explain why it is not a product state.
Solution
In a product state, conditioning on either outcome would leave in the same state . Here the two conditional states are and , so the systems are correlated even though the preparation is separable.
- Explain why an equal mixture of Bell projectors can still be separable.
Solution
The equal mixture of the four Bell projectors is the maximally mixed state:
But this also factors as
Since it is a product density operator, it is separable. A density operator can have many ensemble decompositions, so one decomposition using entangled kets does not prove mixed-state entanglement.
- For
for which is the state product?
Solution
The state is separable for every because it is a convex mixture of product projectors. Its reduced states are
For , the product contains nonzero probabilities for and , while does not. Thus is product only at or .