Purifications
Definition of purifications
Let us begin with a precise mathematical definition for purifications.
Definition. Suppose is a system in a state represented by a density matrix and is a quantum state vector of a pair that leaves when is traced out:
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 and the equation
is true for a density matrix representing a state of the system 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 and the other playing the role of
Existence of purifications
Suppose that and are any two systems and is a given state of We will prove that there exists a quantum state vector of that purifies — which is another way of saying that is a purification of — provided that the system is large enough. In particular, if has at least as many classical states as then a purification of this form necessarily exists for every state Fewer classical states of are required for some states in general, classical states of are necessary and sufficient for the existence of a quantum state vector of that purifies
Consider first any expression of as a convex combination of pure states, for any positive integer
In this expression, is a probability vector and are quantum state vectors of
One way to obtain such an expression is through the spectral theorem, in which case is the number of classical states of are the eigenvalues of and 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 and to be the non-zero eigenvalues of This is the minimum value of 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, could be any positive integer, the unit vectors need not be orthogonal, and the probabilities need not be eigenvalues of
We can now identify a purification of as follows.
Here we're making the assumption that the classical states of include If they do not, an arbitrary choice for distinct classical states of can be substituted for 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.
More generally, for any orthonormal set of vectors the quantum state vector
is a purification of
Example
Suppose that and are both qubits and
is a density matrix representing a state of
We can use the spectral theorem to express as
where The quantum state vector
which describes a pure state of the pair is therefore a purification of
Alternatively, we can write
This is a convex combination of pure states but not a spectral decomposition because and are not orthogonal and is not an eigenvalue of Nevertheless, the quantum state vector
is a purification of
Schmidt decompositions
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 A Schmidt decomposition of is an expression of the form
where are positive real numbers summing to and both of the sets and are orthonormal.
The values
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
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 of the vector space corresponding to the system Because this is a basis, there will always exist a uniquely determined selection of vectors for which the following equation is true.
For example, suppose is the standard basis associated with Assuming the classical state set of is this means that for each and we find that
when
for each We frequently consider expressions like this when contemplating a standard basis measurement of
It's important to note that the formula
for the vectors in this example only works because is an orthonormal basis. In general, if is a basis that is not necessarily orthonormal, then the vectors are still uniquely determined by the equation but a different formula is needed. One way to find them is first to identify vectors so that the equation
is satisfied for all at which point we have
For a given basis of the vector space corresponding to the uniquely determined vectors for which the equation is satisfied won't necessarily satisfy any special properties, even if happens to be an orthonormal basis. If, however, we choose to be an orthonormal basis of eigenvectors of the reduced state
then something interesting happens. Specifically, for the uniquely determined collection for which the equation is true, we find that this collection must be orthogonal.
In greater detail, consider a spectral decomposition of
Here we're denoting the eigenvalues of by in recognition of the fact that is a density matrix — so the vector of eigenvalues forms a probability vector — while is an orthonormal basis of eigenvectors corresponding to these eigenvalues. To see that the unique collection for which the equation is true is necessarily orthogonal, we can begin by computing the partial trace.
This expression must agree with the spectral decomposition of Because is a basis, we conclude that the set of matrices
is linearly independent, and so it follows that
establishing that is orthogonal.
We've nearly obtained a Schmidt decomposition of It remains to discard those terms in for which and then write for a unit vector 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:
Letting we find that and So, we have
and we can write the quantum state vector as
Given that
for we can define unit vectors as
so that for each Because the vectors are orthogonal and nonzero, it follows that is an orthonormal set, and so we have obtained a Schmidt decomposition of
Concerning the choice of the vectors and we can select to be any orthonormal set of eigenvectors corresponding to the nonzero eigenvalues of the reduced state (as we have done above), in which case the vectors are uniquely determined.
The situation is symmetric between the two systems, so we can alternatively choose to be any orthonormal set of eigenvectors corresponding to the nonzero eigenvalues of the reduced state in which case the vectors 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 of the reduced state must always agree with the nonzero eigenvalues of the reduced state for any pure state of a pair of systems
Intuitively speaking, the reduced states of and have exactly the same amount of randomness in them when the pair 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.
Unitary equivalence of purifications
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 and are systems, and and are quantum state vectors of that both purify the same state of In symbols,
for some density matrix representing a state of There must then exist a unitary operation on alone that transforms the first purification into the second:
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 that satisfy the equation
for some density matrix representing a state of
Consider a spectral decomposition of
Here 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 is the rank of and and are orthonormal sets of vectors in the space corresponding to
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 so that for In particular, to find such a matrix we can first use the Gram-Schmidt orthogonalization process to extend our orthonormal sets to orthonormal bases and where is the dimension of the space corresponding to and then take
We now find that
which completes the proof.
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.
Superdense coding
In the superdense coding protocol, Alice and Bob share an e-bit, meaning that Alice holds a qubit Bob holds a qubit and together the pair 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 Once she has done this, she sends to Bob, and then Bob performs a measurement on the pair to see which Bell state he holds.
For all four Bell states, the reduced state of Bob's qubit 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 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.
Cryptographic implications
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 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: if Alice committed to the value and if Alice committed to the value 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 (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 is the pure state of all of the systems involved in the protocol when Alice commits to and is the pure state of all of the systems involved in the protocol when Alice commits to If we write and to denote Alice and Bob's (possibly compound) systems, then
Given the requirement that for a perfectly concealing protocol, we find that and are purifications of the same state — and so, by the unitary equivalence of purifications, there must exist a unitary operation on alone such that
Alice is therefore free to change her commitment from to by applying to or from to by applying and so the hypothetical protocol being considered completely fails to be binding.
Hughston-Jozsa-Wootters theorem
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 and be systems and let be a quantum state vector of the pair Also let be an arbitrary positive integer, let be a probability vector, and let be quantum state vectors representing states of such that
There exists a (general) measurement on such that the following two statements are true when this measurement is performed on when is in the state
- Each measurement outcome appears with probability .
- Conditioned on obtaining the measurement outcome the state of becomes
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 is not necessarily bounded by the number of classical states of or For instance, it could be that while and are qubits.
We shall prove this theorem using the unitary equivalence of purifications, beginning with the introduction of a new system whose classical state set is Consider the following two quantum state vectors of the triple
The first vector is simply the given quantum state vector tensored with for the new system For the second vector we essentially have a quantum state vector that would make the theorem trivial — at least if were replaced by — because a standard basis measurement performed on clearly yields each outcome with probability and conditioned on obtaining this outcome the state of becomes
By thinking about the pair as a single, compound system that can be traced out to leave we find that we have identified two different purifications of the state
Specifically, for the first one we have
and for the second one we have
There must therefore exist a unitary operation on satisfying
by the unitary equivalence of purifications.
Using this unitary operation we can implement a measurement that satisfies the requirements of the theorem as the following diagram illustrates. In words, we introduce the new system initialized to the state, apply to which transforms the state of from into and then measure with a standard basis measurement, which we've already observed gives the desired behavior.
The dotted rectangle in the figure represents an implementation of this measurement, which can be described as a collection of positive semidefinite matrices as follows.