Pure versus Mixed States
A ket is the whole story only when you have prepared a system with maximal knowledge and kept it perfectly isolated. Reality rarely obliges, and two situations break the pure-ket picture. First, you may know only that a preparation machine emitted with classical probability — a coin flip you did not see. Second, and more deeply quantum, your qubit may be one half of an entangled pair whose partner has wandered into an environment you cannot touch. In neither case does a single vector reproduce the statistics, and quantum mechanics forces you up a level to the density operator . The pure-versus-mixed distinction is the founding dichotomy of that language. A pure state carries the maximal information a quantum system can hold; it is a rank-one projector and passes the idempotency test . A mixed state carries an irreducible probabilistic spread — eigenvalues strictly between and , . The scalar that grades them is the purity : exactly for pure states, dropping toward the floor as the state becomes more mixed. Two subtleties give the topic its depth. First, ensemble ambiguity: many different preparation recipes produce the identical , and since every prediction depends on alone, they are physically indistinguishable — the density operator, not the recipe, is the state. Second, the two origins of mixedness — honest classical ignorance versus entanglement with an inaccessible partner — leave exactly the same behind, so no local measurement tells them apart. This article builds the test, the Bloch geometry, the ensemble structure, and both origins in density-operator language throughout.
- A quantum state is a density operator : Hermitian, positive semidefinite, unit trace () — the object that reproduces all measurement statistics via the Born rule.
- A state is pure iff for a unit ket, equivalently iff (a rank-one projector); every other density operator is mixed.
- The purity is the scalar that separates them ( pure, mixed, at the floor ); for a qubit it is , so pure states sit on the Bloch surface and mixed ones strictly inside.
- A mixed state is a classical ensemble of pure states — but the ensemble producing a given is not unique, and only is physical.
- Mixedness has two origins no measurement distinguishes: classical ignorance of the preparation, and entanglement with an inaccessible environment (the reduced state via partial trace).
- Key idea: pure has a single nonzero eigenvalue equal to ; mixed is everything else, and its spread is measured by the purity .
Pure has a single nonzero eigenvalue (which equals ); mixed is everything else, with the spread measured by the purity .
Where this lives today
The pure/mixed boundary is the working diagnostic of every quantum-hardware lab. On superconducting and trapped-ion processors, quantum state tomography reconstructs , and the drop of the purity — the shrink of the Bloch radius away from — is how decoherence and dephasing are quantified as a single number; a "state fidelity" report is a purity statement in disguise. In entanglement science, reduced purity is an entanglement witness: for a pure bipartite state certifies entanglement, and the linear entropy (concurrence-related for two qubits) turns an abstract correlation into a local measurement. Ensemble ambiguity is load-bearing, not a curiosity: because a distant party cannot change your reduced by its basis choice, it is the no-signaling principle, and the same freedom (the HJW theorem) underlies quantum steering and entanglement-based QKD security. Even mixedness-as-resource has a home — the DQC1 "one clean qubit" model computes with a nearly maximally mixed register plus one pure control qubit — a reminder that purity is a budget, quantified by exactly the entropy von Neumann wrote down.
The physical picture
Read as a joint statement of what you know and how much you do not. A pure state is a fully specified preparation — a unit-length arrow; a mixed state reports residual probability, the arrow retracted. The purity is a sharpness dial: turn it to and the qubit collapses to one point on the Bloch surface; turn it down and the Bloch vector shrinks toward the centre, where at you hold total ignorance, . The first figure makes this geometry concrete, with the pure-mixed boundary as the sphere's skin.
The same can arise two ways no laboratory can pull apart. Either someone flipped a fair coin and handed you or (classical ignorance), or your qubit is half of a Bell pair whose partner was carried into the environment (entanglement, decoherence). The density operator is precisely the data these stories share — the view from inside the system, blind to how the mixedness was produced. And a mixture is less than its pure parts in coherence yet equal in linear statistics: gives . Mixing erases the off-diagonal coherences that carry interference while preserving linear averages — which is why a mixed state behaves like a classical probability distribution over quantum states — as the second figure isolates on the smallest example.
The core equations
A quantum state, in full generality, is a density operator. The three axioms below single out exactly the operators that can serve as states: Hermiticity makes statistics real, positivity keeps probabilities non-negative, unit trace normalizes them.
where: — density operator on a -dimensional Hilbert space; — positive semidefinite, for every ; — normalizes total probability. Reading: these three are jointly necessary and sufficient for to represent a physical preparation. The pure states are the extreme points of this set — those not writable as a nontrivial average of others. Four equivalent characterizations pin them down, each a practical test on a matrix.
where: — a normalized vector, ; — idempotency, the defining property of a projector; — the purity. Reading: to decide pure vs mixed, square the matrix and trace — no eigen-decomposition needed. Every mixed state can be realized as a classical ensemble of pure states with weights — how mixedness enters from honest ignorance of a preparation.
where: — classical probability of preparing ; — pure states in the ensemble, need not be orthogonal, may outnumber . Reading: this is a recipe for , not a property of it — the same has infinitely many recipes. Whatever the recipe, all observable content is squeezed through — expectation values and outcome probabilities are traces against it.
where: — an observable (Hermitian operator); — the projector onto outcome , . Reading: because every prediction is linear in , two preparations with equal are operationally identical — the root of ensemble ambiguity. For a single qubit the state set is the solid Bloch ball, where purity becomes geometry: it increases with the Bloch radius, so the surface is exactly the pure locus.
where: — the Bloch vector, ; — the Pauli operators; pure, mixed, maximally mixed. Reading: the eigenvalues show a qubit is pure iff one vanishes. Purity is a coarse summary; the sharper, information-theoretic grade of mixedness is the von Neumann entropy, counting the qubits of uncertainty in .
where: — the eigenvalues of ; for a pure state; for the maximally mixed state. Reading: vanishes exactly when is pure and is maximized by , mirroring the purity ordering but weighting the spectrum logarithmically. The second, deeper origin of mixedness is not ignorance but entanglement: tracing an inaccessible subsystem out of a pure joint state generally leaves a mixed reduced state.
where: — a pure state of the joint system; — partial trace over the unobserved subsystem ; — reduced state of , mixed iff is entangled. Reading: the purity is bounded by (saturated by ) below and (pure states) above — the inequality organizing every limiting case.
The purity test , the projector test , and the statement " has exactly one nonzero eigenvalue" look like three different claims, yet they cut out precisely the same density operators. The goal is to prove all three equivalent from one fact — that a density operator's eigenvalues form a probability distribution — so you may use whichever test is cheapest.
Step 1. Because is Hermitian and positive with unit trace, the spectral theorem gives with orthonormal eigenvectors, , . Why: the eigenvalues literally form a probability distribution — the constraint that forces the pure case to be an all-or-nothing spectrum.
Step 2. Squaring on the orthonormal eigenbasis kills every cross term, leaving . Why: this reduces operator statements about to statements about the numbers .
Step 3. Idempotency holds iff , i.e. each ; with , exactly one eigenvalue is and the rest vanish, so is a rank-one projector. Why: the probability constraint turns into uniqueness — one and only one occupied eigenvector.
Step 4. For the purity, , since the cross terms ; equality forces all but one to zero — the same rank-one condition. Why: is not a weaker proxy but an exact restatement of purity, so certifies mixedness. *Verified: eigenvalues give , ; give , (N&C §2.4).*
Go deeper · Derivation B · 1 minMany ensembles, one density operator
The ensemble is a story about how was made, and quantum mechanics erases that story on contact: distinct ensembles produce the identical and are indistinguishable by any measurement. The goal is to exhibit this on the maximally mixed qubit, then state exactly which ensembles collapse to one — the freedom underlying no-signaling and quantum steering.
Step 1. Take the computational ensemble: a fair coin selects or , giving . Why: this reading of as ignorance about a bit fixes a reference to reproduce another way.
Step 2. Take the diagonal ensemble instead: a fair coin selects or . With , the coherences cancel on averaging and . Why: two ensembles from non-overlapping bases give the same operator — the preparation basis is not encoded in .
Step 3. Conclude operationally: since depends only on , every measurement gives identical statistics — no experiment reveals which coin was flipped. Why: the precise sense in which the ensemble is not part of the state; only is.
Step 4. State the general rule (Hughston–Jozsa–Wootters): two ensembles of subnormalized vectors and give the same iff they are related by a rectangular isometry (a unitary after zero-padding). Why: this turns "infinitely many recipes" into a checkable equivalence, and is the theorem behind an EPR party steering a distant ensemble by its local basis choice. *Verified: both ensembles sum entrywise to ; HJW unitary freedom is standard (N&C §2.4).*
Go deeper · Derivation C · 1 minEntanglement makes the local state mixed
The deepest source of mixedness is not classical: a subsystem of a pure entangled whole is itself mixed, its mixedness measuring the entanglement. The goal is to trace one qubit out of a Bell pair and watch a globally pure, perfectly known state give a locally maximally mixed reduced state — coherences dying under the partial trace.
Step 1. Start from the Bell state , whose joint density operator is pure, . Why: we begin with maximal knowledge of the whole, so any mixedness cannot be blamed on ignorance of the global state.
Step 2. Expand into four terms, , of which the middle two are cross-subsystem coherences. Why: isolating them shows what the partial trace will discard.
Step 3. Partial-trace over via ; the coherence terms carry and vanish, leaving . Why: the inaccessible partner is an environment whose orthogonal records decohere into a classical-looking mixture.
Step 4. Compare purities: . Local mixedness with global purity is the signature of entanglement, and the linear entropy is maximal. Why: the bridge to entanglement detection — reduced purity below one certifies correlation with the outside, no access to needed. *Verified: recomputing gives with reduced purity , the qubit minimum (N&C §2.4.3).*
Limiting cases
The single inequality organizes every state, from the sharpest ket to total ignorance.
| Case | Result | Meaning |
|---|---|---|
| Pure state | Single eigenvalue ; rank-one projector; Bloch radius ; von Neumann entropy . | |
| Maximally mixed | Flat spectrum ; total ignorance; Bloch radius ; (one bit for a qubit). | |
| Generic mixed qubit | Strictly inside the Bloch ball; eigenvalues , both nonzero; . | |
| Reduced state of a pure pair | Mixed iff and are entangled; certifies entanglement of a globally pure state. | |
| Convex combination | Mixing never increases purity; strict inequality unless all coincide. |
Worked examples
1 · Is this qubit pure or mixed — and how mixed? (fully worked)
A qubit is prepared as . Classify it, and compute its purity, eigenvalues, von Neumann entropy, and linear entropy.
Step 1. Read off the Bloch vector. Comparing with gives , so . Already this places the state strictly inside the Bloch ball, hence mixed — no further work needed to classify it.
Step 2. Purity from the Bloch formula (equation 5): . Since , this confirms mixed and quantifies it.
Step 3. Eigenvalues: , both nonzero, so is not a projector. Cross-check: , matching the purity.
Step 4. von Neumann entropy: bits; linear entropy . Both lie strictly between the pure () and maximally mixed ( bit / ) values, placing this state firmly in the generic-mixed regime. Verdict: mixed, purity , spectrum , bit.
2 · Coherence is the difference (superposition vs mixture)
Show numerically that and are told apart by a measurement but not by a measurement.
Step 1. Write the matrices in the computational basis: and . They have the same diagonal but differ in the off-diagonal coherences versus .
Step 2. Measure (projectors ): for both states and . cannot distinguish them — it only sees the (identical) diagonal.
Step 3. Measure (projectors ). For the pure state, , a certain outcome. For the mixture, , a coin flip.
Step 4. Confirm with purity: (pure) versus (maximally mixed). The coherences ignored are exactly what make one state pure and deterministic under . Same diagonal, opposite statistics — coherence is physical.
3 · Reduced purity gauges partial entanglement
A two-qubit pure state has . Find , its purity and entropy, and interpret.
Step 1. Partial-trace over : since are orthogonal, cross terms drop and — already diagonal, so these are the eigenvalues. Purity , entropy bits.
Step 2. Interpret. Since the pair is entangled but not maximally. Dialling sends , purity , bit (maximal); sends , purity , (product, none). Reduced purity is a continuous entanglement gauge. , purity , bit.
Physics of the portrait
The pure-versus-mixed distinction was engineered, deliberately, by one person who wanted quantum mechanics to have the rigor of measure theory. The density operator and its entropy are his, and they are what let us speak of "the state of a subsystem" at all.
Origins · 1 minJohn von Neumann and how this was discovered
John von Neumann arrived in Göttingen in the mid-1920s to find quantum mechanics split between Heisenberg's matrices and Schrödinger's waves and patched together by Dirac's brilliant but unrigorous formalism. In a burst of work from 1927 he rebuilt the theory on Hilbert space and self-adjoint operators, and in doing so introduced the object of this article: the statistical operator (density operator) , together with the entropy that now bears his name. It was von Neumann who drew the sharp line between a pure state — a one-dimensional projector carrying maximal information — and a mixture, whose spectrum spreads across several eigenvalues, and who saw that the same governs both a classically uncertain preparation and the reduced description of an entangled subsystem. His 1932 treatise Mathematische Grundlagen der Quantenmechanik codified all of this, including the measurement postulates and the entropy as the quantum analogue of Gibbs' thermodynamic entropy. Lev Landau, independently in that same year 1927, introduced the density matrix specifically to describe a quantum subsystem, so the tool has two fathers — but the systematic pure/mixed framework, and the entropy that grades it, are von Neumann's. The whole modern edifice of quantum information is written in the language he built.
Going further
Texts. Nielsen & Chuang, Quantum Computation and Quantum Information, §2.4 (the density operator) · Preskill, Quantum Information Lecture Notes, Ch. 2 (density operators, ensembles) · Watrous, The Theory of Quantum Information, Ch. 2 · Wilde, Quantum Information Theory, Ch. 4 · Kitaev, Shen & Vyalyi, Classical and Quantum Computation, §10 · Mermin, Quantum Computer Science, Ch. 1–2.
Provenance. A verifier should recompute: (1) the spectral proof rank-one projector (N&C §2.4); (2) the Bloch purity identity from (Preskill Ch. 2); (3) the Bell-state partial trace , reduced purity (N&C §2.4.3); (4) the ensemble equality and the HJW unitary freedom. All numbers — bounds , eigenvalues , bit, bit, partial-pair purity with bit — are standard or directly checkable.
Builds on. Density Operators · The Qubit and Its State Space · Dirac Bra-Ket Notation · Born Rule · Inner Product, Norm, and Normalization. Leads to. Expectation Values and Variance · Projective Measurements · Pauli Operators · Global and Relative Phase.
Ask the tutor: Hand me any density matrix and I will classify it pure or mixed, read off its Bloch vector, purity, and entropy, and tell you whether its mixedness is classical ignorance or hidden entanglement.
What exactly makes a state "mixed" rather than "pure"?
Purity is the litmus test: compute . If it equals the state is pure, for a single ket; if below it is mixed and no single ket reproduces it. Equivalently, a pure state has one eigenvalue and the rest zero (a rank-one projector, ), a mixed state at least two nonzero eigenvalues. Physically, a pure state is maximal knowledge — everything predictable packed into one vector — while a mixed state carries an irreducible spread, from classical ignorance or from entanglement with something you cannot see.
Is a superposition a mixture?
No, and conflating them is the classic mistake. The superposition is a pure state with definite phase relations; it gives a certain outcome () under , and its matrix has nonzero off-diagonal coherences. The mixture is a classical "either/or"; gives a random result and its off-diagonal entries are zero. They share the diagonal , so won't separate them — but a rotated-basis measurement will, because it probes the coherences only the superposition has.
If many ensembles give the same ρ, which one is "real"?
None is more real than any other — that is the point. The density operator is the complete physical state; the ensemble is one story about how might have been prepared, and quantum mechanics gives no way to recover it. The maximally mixed qubit is equally a coin flip between and a coin flip between , and no measurement distinguishes them because every probability depends on alone. The Hughston–Jozsa–Wootters theorem says exactly which ensembles collapse to a given : those related by a unitary on the purifying system.
How can a subsystem be mixed if the whole system is in a definite, pure state?
This is entanglement, the most quantum way to be mixed. If two qubits are in a Bell state , the pair is perfectly definite and pure — you know everything about the joint system. But ask only about one qubit, tracing out the other, and you get : maximally mixed. The information is not lost; it lives in the correlations between the qubits, which a description of one alone cannot capture. So local mixedness with global purity is the signature of entanglement, and the reduced entropy measures how entangled the pair is.
What is the difference between purity and von Neumann entropy?
Both grade mixedness, at different resolutions. The purity is a quadratic in the eigenvalues, cheap to compute (square and trace) and ranging from to . The von Neumann entropy weights the spectrum logarithmically, ranges from to , and counts the qubits of uncertainty — the quantity in coding theorems and entanglement measures. They agree at the extremes and order states alike, but the entropy is the fundamental one; the purity is its convenient, differentiable proxy.
Does decoherence turn a pure state into a mixed one?
Yes — that is essentially the definition of decoherence. A qubit coupled to an environment becomes entangled with it, and once you (necessarily) ignore the environment, the qubit's reduced state is mixed: its Bloch vector shrinks, purity drops below , coherences decay. This is the Bell-state partial trace played out continuously as the environment carries away which-path information. It is why real qubits have finite coherence times , why purity is the standard figure of merit for how "quantum" a device still is, and why error correction — the fight to keep the working state pure — is the central engineering problem of quantum computing.