Mixed States (Conceptual Introduction)
Track: Foundations · Difficulty: Beginner · Est: 14 min
Mixed States (Conceptual Introduction)
Overview
So far, we described systems using pure states like . Pure states are powerful, but they are not always enough.
This page introduces mixed states conceptually: situations where the best description is not a single ket, but a probabilistic mixture of different possible pure states.
The main goal is to remove a common confusion: uncertainty (mixture) is not the same thing as superposition.
Intuition
There are two different ways a system can look “uncertain,” and they have different meanings.
1) Classical uncertainty about preparation (mixture)
Imagine a lab procedure:
- Flip a classical coin.
- If heads, prepare .
- If tails, prepare .
After this procedure, the qubit is definitely in either or . The uncertainty is in your information: you do not know which branch happened, because you did not look at the coin.
That is a mixed-state situation.
2) Quantum superposition (pure state)
Now compare with preparing
Here there is no hidden coin and no “which branch.” There is a single pure state with well-defined amplitudes.
Both procedures can produce the same probabilities for some measurements (for example, measuring 0/1), but they are still physically different descriptions because they behave differently under other measurements.
This is the key intuition:
- A mixture is “one of several states, chosen by classical randomness.”
- A superposition is “one state with multiple amplitude components.”
Formal Description
We will describe mixtures using an “ensemble” viewpoint.
An ensemble is a list of possible pure states together with classical probabilities:
- with probability
- with probability
- …
where:
- each
- and .
If you perform a measurement, the overall outcome probabilities are computed by averaging over the classical uncertainty:
- First compute probabilities within each branch using Born’s rule.
- Then average those probabilities using the classical weights .
In words: “probability of an outcome = expected value of the branch-probability.”
This is the correct rule as long as the randomness is classical and you truly do not condition on which branch occurred.
Worked Example
Consider two different preparations.
Preparation A: classical mixture
- With probability , prepare .
- With probability , prepare .
If you measure in the computational basis:
- In the branch, you get outcome 0 with probability 1.
- In the branch, you get outcome 0 with probability 0.
So overall:
Similarly .
Preparation B: pure superposition
Prepare .
Measuring in the computational basis also gives .
So far, the two preparations look identical.
Now measure in the basis.
- In Preparation B, if the state is , you get “” with probability 1.
- In Preparation A, the state is sometimes and sometimes . Each of those gives “” with probability in that basis.
So for Preparation A:
while for Preparation B:
Conclusion: mixture and superposition can agree on one measurement but disagree on another. That is why mixed states are a genuinely new idea.
Turtle Tip
If two preparations give the same 0/1 probabilities, don’t conclude they are “the same state.” Try a different measurement basis. Superpositions reveal themselves through basis changes; mixtures don’t.
Common Pitfalls
Don’t say a mixed state is “a superposition you don’t know.” That mixes up two different kinds of uncertainty.
Also, don’t assume mixed states only happen because you are careless. Mixed-state descriptions arise naturally when you ignore part of a larger system (like tracing out an environment).
Quick Check
- Give one sentence distinguishing mixture vs superposition.
- Why can a mixture and a pure state look identical under one measurement but differ under another?
What’s Next
We described mixtures using a list of states and classical probabilities. That list is not unique: different ensembles can describe the same mixed situation. Next we introduce a single mathematical object—the density matrix—that represents mixed states cleanly and avoids keeping track of arbitrary ensemble lists.
