Let us begin with a precise mathematical definition for purifications.
Definition
Suppose X is a system in a state represented by a density matrix ρ, and ∣ψ⟩ is a quantum state vector of a pair (X,Y) that leaves ρ when Y is traced out:
ρ=TrY(∣ψ⟩⟨ψ∣).
The state vector ∣ψ⟩ is then said to be a purification of ρ.
The pure state ∣ψ⟩⟨ψ∣, expressed as a density matrix rather than a quantum state vector, is also commonly referred to as a purification of ρ when the equation in the definition is true, but we'll generally use the term to refer to a quantum state vector.
The term purification is also used more generally when the ordering of the systems is reversed, when the names of the systems and states are different (of course), and when there are more than two systems.
For instance, if ∣ψ⟩ is a quantum state vector representing a pure state of a compound system (A,B,C), and the equation
ρ=TrB(∣ψ⟩⟨ψ∣)
is true for a density matrix ρ representing a state of the system (A,C), then ∣ψ⟩ is still referred to as a purification of ρ.
For the purposes of this lesson, however, we'll focus on the specific form described in the definition.
Properties and facts concerning purifications, according to this definition, can typically be generalized to more than two systems by re-ordering and partitioning the systems into two compound systems, one playing the role of X and the other playing the role of Y.
Suppose that X and Y are any two systems and ρ is a given state of X.
We will prove that there exists a quantum state vector ∣ψ⟩ of (X,Y) that purifiesρ — which is another way of saying that ∣ψ⟩ is a purification of ρ — provided that the system Y is large enough.
In particular, if Y has at least as many classical states as X, then a purification of this form necessarily exists for every state ρ.
Fewer classical states of Y are required for some states ρ;
in general, rank(ρ) classical states of Y are necessary and sufficient for the existence of a quantum state vector of (X,Y) that purifies ρ.
Consider first any expression of ρ as a convex combination of n pure states, for any positive integer n.
ρ=a=0∑n−1pa∣ϕa⟩⟨ϕa∣
In this expression, (p0,…,pn−1) is a probability vector and ∣ϕ0⟩,…,∣ϕn−1⟩ are quantum state vectors of X.
One way to obtain such an expression is through the spectral theorem, in which case n is the number of classical states of X,p0,…,pn−1 are the eigenvalues of ρ, and ∣ϕ0⟩,…,∣ϕn−1⟩ are orthonormal eigenvectors corresponding to these eigenvalues.
There's actually no need to include the terms corresponding to the zero eigenvalues of ρ in the sum, which allows us to alternatively choose n=rank(ρ) and p0,…,pn−1 to be the non-zero eigenvalues of ρ.
This is the minimum value of n for which an expression of ρ taking the form above exists.
To be clear, it is not necessary that the chosen expression of ρ, as a convex combination of pure states, comes from the spectral theorem — this is just one way to obtain such an expression.
In particular, n could be any positive integer, the unit vectors ∣ϕ0⟩,…,∣ϕn−1⟩ need not be orthogonal, and the probabilities p0,…,pn−1 need not be eigenvalues of ρ.
We can now identify a purification of ρ as follows.
∣ψ⟩=a=0∑n−1pa∣ϕa⟩⊗∣a⟩
Here we're making the assumption that the classical states of Y include 0,…,n−1.
If they do not, an arbitrary choice for n distinct classical states of Y can be substituted for 0,…,n−1.
Verifying that this is indeed a purification of ρ is a simple matter of computing the partial trace, which can be done in the following two equivalent ways.
where ∣ψθ⟩=cos(θ)∣0⟩+sin(θ)∣1⟩.
The quantum state vector
cos(π/8)∣ψπ/8⟩⊗∣0⟩+sin(π/8)∣ψ5π/8⟩⊗∣1⟩
which describes a pure state of the pair (X,Y), is therefore a purification of ρ.
Alternatively, we can write
ρ=21∣0⟩⟨0∣+21∣+⟩⟨+∣.
This is a convex combination of pure states but not a spectral decomposition because ∣0⟩ and ∣+⟩ are not orthogonal and 1/2 is not an eigenvalue of ρ.
Nevertheless, the quantum state vector
Next, we will discuss Schmidt decompositions, which are expressions of quantum state vectors of pairs of systems that take a certain form.
Schmidt decompositions are closely connected with purifications, and they're very useful in their own right.
Indeed, when reasoning about a given quantum state vector ∣ψ⟩ of a pair of systems, the first step is often to identify or consider a Schmidt decomposition of this state.
Definition
Let ∣ψ⟩ be a given quantum state vector of a pair of systems (X,Y). A Schmidt decomposition of ∣ψ⟩ is an expression of the form
∣ψ⟩=a=0∑r−1pa∣xa⟩⊗∣ya⟩,
where p0,…,pr−1 are positive real numbers summing to 1 and both of the sets {∣x0⟩,…,∣xr−1⟩} and {∣y0⟩,…,∣yr−1⟩} are orthonormal.
The values
p0,…,pr−1
in a Schmidt decomposition of ∣ψ⟩ are known as its Schmidt coefficients, which are uniquely determined (up to their ordering) — they're the only positive real numbers that can appear in such an expression of ∣ψ⟩.
The sets
{∣x0⟩,…,∣xr−1⟩}and{∣y0⟩,…,∣yr−1⟩},
on the other hand, are not uniquely determined, and the freedom one has in choosing these sets of vectors will be clarified in the explanation that follows.
We'll now verify that a given quantum state vector ∣ψ⟩ does indeed have a Schmidt decomposition, and in the process, we'll learn how to find one.
Consider first an arbitrary (not necessarily orthogonal) basis {∣x0⟩,…,∣xn−1⟩} of the vector space corresponding to the system X.
Because this is a basis, there will always exist a uniquely determined selection of vectors ∣z0⟩,…,∣zn−1⟩ for which the following equation is true.
∣ψ⟩=a=0∑n−1∣xa⟩⊗∣za⟩(1)
For example, suppose {∣x0⟩,…,∣xn−1⟩} is the standard basis associated with X.
Assuming the classical state set of X is {0,…,n−1}, this means that ∣xa⟩=∣a⟩ for each a∈{0,…,n−1}, and we find that
∣ψ⟩=a=0∑n−1∣a⟩⊗∣za⟩
when
∣za⟩=(⟨a∣⊗IY)∣ψ⟩
for each a∈{0,…,n−1}.
We frequently consider expressions like this when contemplating a standard basis measurement of X.
It's important to note that the formula
∣za⟩=(⟨a∣⊗IY)∣ψ⟩
for the vectors ∣z0⟩,…,∣zn−1⟩ in this example only works because {∣0⟩,…,∣n−1⟩} is an orthonormal basis.
In general, if {∣x0⟩,…,∣xn−1⟩} is a basis that is not necessarily orthonormal, then the vectors ∣z0⟩,…,∣zn−1⟩ are still uniquely determined by the equation (1), but a different formula is needed.
One way to find them is first to identify vectors ∣w0⟩,…,∣wn−1⟩ so that the equation
⟨wa∣xb⟩={10a=ba=b
is satisfied for all a,b∈{0,…,n−1}, at which point we have
∣za⟩=(⟨wa∣⊗IY)∣ψ⟩.
For a given basis {∣x0⟩,…,∣xn−1⟩} of the vector space corresponding to X, the uniquely determined vectors ∣z0⟩,…,∣zn−1⟩ for which the equation (1) is satisfied won't necessarily satisfy any special properties, even if {∣x0⟩,…,∣xn−1⟩} happens to be an orthonormal basis.
If, however, we choose {∣x0⟩,…,∣xn−1⟩} to be an orthonormal basis of eigenvectors of the reduced state
ρ=TrY(∣ψ⟩⟨ψ∣),
then something interesting happens.
Specifically, for the uniquely determined collection {∣z0⟩,…,∣zn−1⟩} for which the equation (1) is true, we find that this collection must be orthogonal.
In greater detail, consider a spectral decomposition of ρ.
ρ=a=0∑n−1pa∣xa⟩⟨xa∣
Here we're denoting the eigenvalues of ρ by p0,…,pn−1 in recognition of the fact that ρ is a density matrix — so the vector of eigenvalues (p0,…,pn−1) forms a probability vector — while {∣x0⟩,…,∣xn−1⟩} is an orthonormal basis of eigenvectors corresponding to these eigenvalues.
To see that the unique collection {∣z0⟩,…,∣zn−1⟩} for which the equation (1) is true is necessarily orthogonal, we can begin by computing the partial trace.
This expression must agree with the spectral decomposition of ρ.
Because {∣x0⟩,…,∣xn−1⟩} is a basis, we conclude that the set of matrices
{∣xa⟩⟨xb∣:a,b∈{0,…,n−1}}
is linearly independent, and so it follows that
⟨zb∣za⟩={pa0a=ba=b,
establishing that {∣z0⟩,…,∣zn−1⟩} is orthogonal.
We've nearly obtained a Schmidt decomposition of ∣ψ⟩.
It remains to discard those terms in (1) for which pa=0 and then write ∣za⟩=pa∣ya⟩ for a unit vector ∣ya⟩ for each of the remaining terms.
A convenient way to do this begins with the observation that we're free to number the eigenvalue/eigenvector pairs in a spectral decomposition of the reduced state ρ however we wish — so we may assume that the eigenvalues are sorted in decreasing order:
p0≥p1≥⋯≥pn−1.
Letting r=rank(ρ), we find that p0,…,pr−1>0 and pr=⋯=pn−1=0.
So, we have
ρ=a=0∑r−1pa∣xa⟩⟨xa∣,
and we can write the quantum state vector ∣ψ⟩ as
∣ψ⟩=a=0∑r−1∣xa⟩⊗∣za⟩.
Given that
∥∣za⟩∥2=⟨za∣za⟩=pa>0
for a=0,…,r−1, we can define unit vectors ∣y0⟩,…,∣yr−1⟩ as
∣ya⟩=∥∣za⟩∥∣za⟩=pa∣za⟩,
so that ∣za⟩=pa∣ya⟩ for each a∈{0,…,r−1}.
Because the vectors {∣z0⟩,…,∣zr−1⟩} are orthogonal and nonzero, it follows that
{∣y0⟩,…,∣yr−1⟩} is an orthonormal set, and so we have obtained a Schmidt decomposition of ∣ψ⟩.
∣ψ⟩=a=0∑r−1pa∣xa⟩⊗∣ya⟩
Concerning the choice of the vectors
{∣x0⟩,…,∣xr−1⟩} and
{∣y0⟩,…,∣yr−1⟩},
we can select {∣x0⟩,…,∣xr−1⟩} to be any orthonormal set of eigenvectors corresponding to the nonzero eigenvalues of the reduced state TrY(∣ψ⟩⟨ψ∣) (as we have done above), in which case the vectors {∣y0⟩,…,∣yr−1⟩} are uniquely determined.
The situation is symmetric between the two systems, so we can alternatively choose {∣y0⟩,…,∣yr−1⟩} to be any orthonormal set of eigenvectors corresponding to the nonzero eigenvalues of the reduced state TrX(∣ψ⟩⟨ψ∣), in which case the vectors {∣x0⟩,…,∣xr−1⟩} will be uniquely determined.
Notice, however, that once one of the sets is selected, as a set of eigenvectors of the corresponding reduced state as just described, the other is determined — so they cannot be chosen independently.
Although it won't come up again in this series, it is noteworthy that the non-zero eigenvalues p0,…,pr−1 of the reduced state TrX(∣ψ⟩⟨ψ∣) must always agree with the nonzero eigenvalues of the reduced state TrY(∣ψ⟩⟨ψ∣) for any pure state ∣ψ⟩ of a pair of systems (X,Y).
Intuitively speaking, the reduced states of X and Y have exactly the same amount of randomness in them when the pair (X,Y) is in a pure state.
This fact is revealed by the Schmidt decomposition: in both cases the eigenvalues of the reduced states must agree with the squares of the Schmidt coefficients of the pure state.
We can use Schmidt decompositions to establish a fundamentally important fact concerning purifications known as the unitary equivalence of purifications.
Theorem
Unitary equivalence of purifications: Suppose that X and Y are systems, and ∣ψ⟩ and ∣ϕ⟩ are quantum state vectors of (X,Y) that both purify the same state of X. In symbols,
TrY(∣ψ⟩⟨ψ∣)=ρ=TrY(∣ϕ⟩⟨ϕ∣)
for some density matrix ρ representing a state of X.
There must then exist a unitary operation U on Y alone that transforms the first purification into the second:
(IX⊗U)∣ψ⟩=∣ϕ⟩.
We'll discuss a few implications of this theorem as the lesson continues, but first let's see how it follows from our previous discussion of Schmidt decompositions.
Our assumption is that ∣ψ⟩ and ∣ϕ⟩ are quantum state vectors
of a pair of systems (X,Y) that satisfy the equation
TrY(∣ψ⟩⟨ψ∣)=ρ=TrY(∣ϕ⟩⟨ϕ∣)
for some density matrix ρ representing a state of X.
Consider a spectral decomposition of ρ.
ρ=a=0∑n−1pa∣xa⟩⟨xa∣
Here {∣x0⟩,…,∣xn−1⟩} is an orthonormal basis of eigenvectors of ρ.
By following the prescription described previously we can obtain Schmidt decompositions for both ∣ψ⟩ and ∣ϕ⟩ having the following form.
In these expressions r is the rank of ρ and
{∣u0⟩,…,∣ur−1⟩} and
{∣v0⟩,…,∣vr−1⟩} are orthonormal sets of vectors in the space corresponding to Y.
For any two orthonormal sets in the same space that have the same number of elements, there's always a unitary matrix that transforms the first set into the second, so we can choose a unitary matrix U so that U∣ua⟩=∣va⟩ for a=0,…,r−1.
In particular, to find such a matrix U we can first use the Gram-Schmidt orthogonalization process to extend our orthonormal sets to orthonormal bases
{∣u0⟩,…,∣um−1⟩} and
{∣v0⟩,…,∣vm−1⟩}, where m is the dimension of the space corresponding to Y, and then take
Here are just a few of many interesting examples and implications connected with the unitary equivalence of purifications.
We'll see another critically important one later in the lesson, in the context of fidelity, known as Uhlmann's theorem.
In the superdense coding protocol, Alice and Bob share an e-bit, meaning that Alice holds a qubit A, Bob holds a qubit B, and together the pair (A,B) is in the ∣ϕ+⟩ Bell state.
The protocol describes how Alice can transform this shared state into any one of the four Bell states, ∣ϕ+⟩,∣ϕ−⟩,∣ψ+⟩, and
∣ψ−⟩, by applying a unitary operation to her qubit A.
Once she has done this, she sends A to Bob, and then Bob performs a measurement on the pair (A,B) to see which Bell state he holds.
For all four Bell states, the reduced state of Bob's qubit B is the completely mixed state.
By the unitary equivalence of purifications, we immediately conclude that for each Bell state there must exist a unitary operation on Alice's qubit A alone that transforms ∣ϕ+⟩ into the chosen Bell state.
Although this does not reveal the precise details of the protocol, the unitary equivalence of purifications does immediately imply that superdense coding is possible.
We can also conclude that generalizations of superdense coding to larger systems are always possible, provided that we replace the Bell states with any orthonormal basis of purifications of the completely mixed state.
The unitary equivalence of purifications has implications concerning the implementation of cryptographic primitives using quantum information.
For instance, the unitary equivalence of purifications reveals that it is impossible to implement an ideal form of bit commitment using quantum information.
The bit commitment primitive involves two participants, Alice and Bob (who don't trust one another), and has two phases.
The first phase is the commit phase, through which Alice commits to a binary value b∈{0,1}.
This commitment must be binding, which means that Alice cannot change her mind, as well as concealing, which means that Bob can't tell which value Alice has committed to.
The second phase is the reveal phase, in which the bit committed by Alice becomes known to Bob, who should then be convinced that it was truly the committed value that was revealed.
In intuitive, operational terms, the first phase of bit commitment should function as if Alice writes a binary value on a piece of paper, locks the paper inside of a safe, and gives the safe to Bob while keeping the key for herself.
Alice has committed to the binary value written on the paper because the safe is in Bob's possession (so it's binding), but because Bob can't open the safe he can't tell which value Alice committed to (so it's concealing).
The second phase should work as if Alice hands the key to the safe to Bob, so that he can open the safe to reveal the value to which Alice committed.
As it turns out, it is impossible to implement a perfect bit commitment protocol by means of quantum information alone, for this contradicts the unitary equivalence of purifications.
Here is a high-level summary of an argument that establishes this.
To begin, we can assume Alice and Bob only perform unitary operations or introduce new initialized systems as the protocol is executed.
The fact that every channel has a Stinespring representation allows us to make this assumption.
At the end of the commit phase of the protocol, Bob holds in his possession some compound system that must be in one of two quantum states: ρ0 if Alice committed to the value 0 and ρ1 if Alice committed to the value 1.
In order for the protocol to be perfectly concealing, Bob should not be able to tell the difference between these two states — so it must be that ρ0=ρ1.
(Otherwise there would be a measurement that discriminates these states probabilistically.)
However, because Alice and Bob have only used unitary operations, the state of all of the systems involved in the protocol together after the commit phase must be in a pure state.
In particular, suppose that ∣ψ0⟩ is the pure state of all of the systems involved in the protocol when Alice commits to 0, and ∣ψ1⟩ is the pure state of all of the systems involved in the protocol when Alice commits to 1.
If we write A and B to denote Alice and Bob's (possibly compound) systems, then
ρ0ρ1=TrA(∣ψ0⟩⟨ψ0∣)=TrA(∣ψ1⟩⟨ψ1∣).
Given the requirement that ρ0=ρ1 for a perfectly concealing protocol, we find that ∣ψ0⟩ and ∣ψ1⟩ are purifications of the same state — and so, by the unitary equivalence of purifications, there must exist a unitary operation U on A alone such that
(U⊗IB)∣ψ0⟩=∣ψ1⟩.
Alice is therefore free to change her commitment from 0 to 1 by applying U to A,
or from 1 to 0 by applying U†, and so the hypothetical protocol being considered completely fails to be binding.
The last implication of the unitary equivalence of purifications that we'll discuss in this portion of the lesson is the following theorem known as the Hughston-Jozsa-Wootters theorem.
(This is, in fact, a slightly simplified statement of the theorem known by this name.)
Theorem
Hughston-Jozsa-Wootters: Let X and Y be systems and let ∣ϕ⟩ be a quantum state vector of the pair (X,Y).
Also let N be an arbitrary positive integer, let (p0,…,pN−1) be a probability vector, and let ∣ψ0⟩,…,∣ψN−1⟩ be quantum state vectors representing states of X such that
TrY(∣ϕ⟩⟨ϕ∣)=a=0∑N−1pa∣ψa⟩⟨ψa∣.
There exists a (general) measurement {P0,…,PN−1} on Y such that the following two statements are true when this measurement is performed on Y when (X,Y) is in the state ∣ϕ⟩:
Each measurement outcome a∈{0,…,N−1} appears with probability pa.
Conditioned on obtaining the measurement outcome a, the state of X becomes ∣ψa⟩.
Intuitively speaking, this theorem says that as long as we have a pure state of two systems, then for any way of thinking about the reduced state of the first system as a convex combination of pure states, there is a measurement of the second system that effectively makes this way of thinking about the first system a reality.
Notice that the number N is not necessarily bounded by the number of classical states of X or Y.
For instance, it could be that N=1,000,000 while X and Y are qubits.
We shall prove this theorem using the unitary equivalence of purifications, beginning with the introduction of a new system Z whose classical state set is {0,…,N−1}.
Consider the following two quantum state vectors of the triple (X,Y,Z).