Introduction
It was a great realization that information is physical and that a
(classical) Turing machine is not the end of the story of
computation. The physical system in which the information is stored
and manipulated is important and qubits are quite different from
bits.
In this chapter, some background in quantum mechanics is provided.
Not all of this chapter will be directly relevant to our discussion,
but it is included to progress our understanding
of how quantum mechanics from a textbook is related to quantum
computing. The connection is clear, but the story seems
incomplete from a physicists perspective. For the subject of error
prevention methods, some of this chapter will be vital---in
particular, the section(s) concerning the density matrix. Not only
is this vital, it is often not covered in quantum mechanics
classes, both undergraduate and graduate.
It is also worth emphasizing that this chapter is primarily aimed at
physicists and for any others who are interested in the background
physics. However, it is not necessary for much of what follows.
Schrodinger's Equation
A common starting point in quantum mechanics is Schrodinger's equation. This equation is not derived or justified here, but is given in a general form:
|
|
|
(3.1)
|
where is the Hamiltonian,
is Planck's constant
(divided by ), and is time. The Hamiltonian contains what
is known about the system's evolution.
Most of the time in these notes, we let .
This equation is (formally) solved by taking the time derivative to be
an ordinary derivative (we assume no explicit time dependence for
), so
|
|
|
(3.2)
|
This means that
|
|
|
(3.3)
|
so
|
|
|
(3.4)
|
Now if is Hermitian (it is), then the matrix
|
|
|
(3.5)
|
is unitary.
(If this is unclear, see Appendix C - Vectors and Linear Algebra, in particular the section entitled Unitary Matrices.) Any
transformation on a closed system can be described by a unitary
transformation and any unitary transformation can be obtained by the
exponentiation of a Hermitian matrix.
The end result and important point is that the evolution of a quantum
state is, in general, given by a unitary matrix
|
|
|
(3.6)
|
So our objective in quantum information processing is to create a
unitary evolution, and eventual measurement, which will produce a
particular outcome.
Exponentiating a Matrix
Aside: a note about the exponentiation of a matrix.
It may seem strange to exponentiate a matrix. However, you can define
a function of a matrix according to its Taylor expansion. The details
of this are primarily unimportant here, but for demonstration purposes,
it is written out.
The Taylor expansion of an exponential is the following:
|
|
|
(3.7)
|
and this can be used to exponentiate a matrix by letting the matrix
replace in the equation. This can also be used to prove that
|
|
|
(3.8)
|
End Aside
Density Matrix for Pure States
Now let us consider the object (a density matrix, or
density operator, of rank one)
|
|
|
(3.9)
|
which is just the outer product of two vectors. (See Appendix C.2.4, Outer Product.)
Since , is also true. If we
differentiate this with respect to , we discover
|
|
|
(3.10)
|
This is merely the Schrodinger equation for a density matrix with the solution
|
|
|
(3.11)
|
This follows from .
Consider our two-state system,
|
|
|
(3.12)
|
Recall that the arbitrary superposition of these states is shown by
|
|
|
(3.13)
|
where and are complex numbers such that
. The corresponding
pure state (i.e. rank one) density matrix is given by
|
|
|
(3.14)
|
Note that the superposition in Eq.(3.13) can be obtained from any pure state by a unitary transformation. Here, the trace of
the density matrix is an important quantity; it is
|
|
|
(3.15)
|
Notice also that the determinant of this matrix is zero, indicating that it has a zero eigenvalue:
|
|
|
(3.16)
|
To see this another way, note that the density operator of rank one can be written as , so that the determinant is
|
|
|
(3.17)
|
This is a characteristic of a pure state and for two-state systems; it is a necessary and sufficient condition for the density operator to represent a pure state of the system.
Measurements Revisited
If the state of a quantum system is described by
|
|
|
(3.18)
|
then the probability of finding it in the state when measured in
the computational basis is . However, this is a
particular superposition that could be written as
|
|
|
(3.19)
|
In the section entitled Schrodinger's Equation it was shown that this matrix results
from the exponentiation of a Hermitian matrix. Recall from the section entitled The Pauli Matrices that any
Hermitian matrix can be written in terms of the Pauli matrices. To make this explicit using standard conventions,
|
|
|
(3.20)
|
where is a unit vector, and . (For a proof of this, see Section C.5.1.) One can write this matrix out explicitly,
|
|
|
(3.21)
|
Notice this is a special unitary matrix. (See Appendix C - Vectors and Linear Algebra, in particular the subsection Unitary Matrices.)
To see that any state for arbitrary coefficients
, can be obtained by choosing and
appropriately, the state can be chosen as a starting point.
Then,
|
|
|
(3.22)
|
For example, choosing gives the original state; choosing
and gives ; and choosing
and gives an equal superposition.
In general, when the system is in the state ,
the probability of finding the state when a measurement is made in the computational basis is given by
|
|
|
(3.23)
|
and the probability of finding the state if the initial state is , is
|
|
|
(3.24)
|
Notice that the probabilities add up to one if is a unit vector.
What this shows is that there is a transformation that takes the state
, which has probability of being in the state and
probability of being in the state , and transforms it
(using a "rotation'') into a state with a different (and generic)
probability of each. This means that the density matrix corresponding
to this system always has determinant zero, meaning that(for a two-state system) it has one
eigenvalue 1 and another eigenvalue 0. (The determinant is the
product of the eigenvalues.)
Density Matrix for Mixed States
For a system with dimensions, a mixed state density operator
(or density matrix, see Appendix E) is a matrix that is used to
describe a more general state of a quantum system. This can be written as
|
|
|
(3.25)
|
where , , and the are pure states. There is also a generalization of the Bloch sphere which is described in Appendix E.
Mixed state density operators are important in all descriptions of physical implementations of quantum information processing. For this reason, a bit of labor should go into understanding the density operator. The rest of this section is devoted to the physical interpretation and properties of this description of a quantum system. The first description presented is called the ensemble interpretation of the density matrix. This is perhaps the easiest to understand and is commonly used in quantum statistical mechanics. Another set of physical systems that are described by density operators will be given elsewhere.
General Properties
In general, a density operator has the following properties:
|
|
|
(3.26)
|
If, in addition, it is a pure state density operator, then
|
|
|
(3.27)
|
The second property in Eq.(3.26) really means that the eigenvalues of the density matrix are greater than or equal to zero.
Density Matrix for a Mixed State: Two States
A mixed state density operator for a two-state system is represented by a rank two matrix, , which can be written as
|
|
|
(3.28)
|
where ,
and . The are probabilities and must positive and sum to one.
(Note, if , or if one or one
is zero, then this reduces to a pure state.) In this mixture,
the probability of finding the state is
and the probability of finding the state is .
Description of Open Quantum Systems: An Example
One example of the utility of a density matrix is the following
statistical problem. Let us consider a collection of electrons in a box, where their
spin is a two-state system being either up or down when measured. If
a subset of these electrons is prepared in the state ''up'' before
being put in the box and the rest ''down,'' then the description of
the system of particles is given by
|
|
|
(3.29)
|
where the fraction of ''up'' particles is and the fraction of ''down'' is . Our system is described by this density matrix---if a particle is chosen at random from the box and measured, the state of the particle is with probability
and with probability . This is known as the "statistical
interpretation" of the density operator.
There is another example that is more relevant for our purposes. Let us consider another two-state system.
If there is some probability for an error to occur, let us say it is a unitary operator , then the density matrix for the
system is
|
|
|
(3.30)
|
This is the same form as Eq.(3.29).
Note that in each
case the probabilities associated with the density matrix , and
, (generally, ) are classical probabilities;
they are associated with a classical probability distribution---the
probability for error/no error and up/down. These are not
probabilities associated with the superposition of the quantum state
in the equation
given by the square of the moduli of the coefficients. This is an
important distinction! The state
can be taken to the state with a unitary
transformation. If this is done, then a measurement of the state can give the
result with no probability for obtaining
. However, for nonzero and a non-identity
operator , the matrix has rank two and thus can never have
probability for a measurement result of either of the two states, or .
We have maximum knowledge about a pure state since
there is a way to choose a measurement, perhaps after a unitary
transformation, which achieves a certain result with probability .
For the mixed state density operator this is not possible.
For example, the state
|
|
|
(3.31)
|
is the one for which we have the least amount of knowledge, since either result of a two-state measurement has equally probable outcomes. This is called the
maximally mixed state. The
state could be either up or down with equal probability and neither is
a better guess. If the two eigenvalues are not equal, then there is a
better guess (or bet) as to the result of a measurement. If one
eigenvalue is zero, as it is in the case of a pures state, then there is a definite best guess.
Note, however, that these outcomes are basis dependent. Changing the basis by a unitary transformation from the state with , changes the probability of obtaining the 0/1 result from 1/2 and 1/2 to 1 and 0. There is no possibility of a basis change on the maximally mixed state which will give probabilities 1 and 0. The two probabilities are always 1/2 and 1/2.
Put another way, independent of basis (unitary transformations),
one always has a probability greater than zero of measuring
and probability greater than zero of measuring
when the state is represented by a mixed state density operator. Thus the state described by the density matrix is
a mixed state in the sense
that it can be considered a statistical mixture of the two states
and . This, because classical
probabilities are included separately, is significantly different from
the pure state density matrix, which is a special case of all density
matrices.
To see that mixtures remain after a unitary transformation on the
system, note that a unitary matrix does not change the eigenvalues.
This is because the eigenvalue equation is the same for a Hermitian
matrix or its corresponding diagonal matrix. Let . It can now be seen,
|
|
|
(3.32)
|
Two-State Example: Bloch Sphere
Since our interest is primarily in qubits, which are two-state
systems, we return to a two-state example.
A very convenient representation of two state density matrices, one
that can written in the so-called Bloch sphere
representation given the fact that the density matrix is Hermitian,
|
|
|
(3.33)
|
where, for the density matrix to be positive , and the
are the Pauli matrices
|
|
|
(3.34)
|
The matrix entries on the RHS of this equation are the The Pauli matrices discussed above. It is not difficult to convince yourself that any Hermitian matrix can be written as a real linear combination of the three Pauli matrices and the identity. The eigenvalues are given by
|
|
|
(3.35)
|
When , the state is pure, i.e., that the matrix
has rank one since it has one eigenvalue one and one zero. If , the density matrix represents a mixed state since rank is
greater than one--there are two non-zero eigenvalues. These leads to
the following picture: the pure states lie on the surface of the
sphere (), and mixed states lie in the interior of
the sphere with the maximally mixed state at the origin. This is
supposedly due to Bloch. Hence the name Bloch sphere.
Using the condition that for a pure
state can also be determined. The square in the Bloch sphere
representation yields
|
|
|
(3.36)
|
and using
|
|
|
(3.37)
|
then if and only if . This technique is
used for higher dimensions. See Appendix E.
Two density matrices and
, correspond to orthogonal
states when
|
|
|
(3.38)
|
This implies that
|
|
|
(3.39)
|
Since the magnitudes must be one, the orthogonal states correspond to
pure states on a surface of a sphere which are represented by
antipodal points.
Rotations of Bloch Vectors
As shown above, the solution to the Schrodinger equation for the density operator is (see Eq.(3.11))
In general an open system will evolve according to
whether or not the time dependence is explicitly taken into account. When the density operator is represented using the Bloch vector, the vector is rotated by the unitary transformation. This is seen through an explicit calculation.
There are two ways to see this. One is to simply act with the matrices in the Euler angle parameterization in Section C.5.1 one each of the Pauli matrices to show that indeed,
|
|
|
(3.40)
|
This is easily seen to be a standard rotation matrix. (See for example http://en.wikipedia.org/wiki/Rotation_matrix.)
Another way to do this is to take
as in Eq.(3.33). (Recall .) Now act on with as given in Section C.5.1 by the so-called adjoint action ,
|
|
|
(3.41)
|
To do this calculation explicitly, it helps (but is not necessary) to use the following identity,
|
|
|
(3.42)
|
Then, if one only considers the non-trivial part of the density operator, , the result is
|
|
|
(3.43)
|
where
|
|
|
(3.44)
|
Therefore, the result of the action of is to produce, from , the vector
|
|
|
(3.45)
|
Using Eq.(3.42), this is
|
|
|
(3.46)
|
This equation can be interpreted as follows. We consider three possible components of the vector the part along the axis of rotation, and the two parts in the plane perpendicular to the axis of rotation. The part of the vector along the axis of rotation does not change. The parts perpendicular to change just like a vector rotated in a plane, but these parts are rotated in the plane perpendicular to the rotation axis and sitting at the end of the vector . One such component comes from the cross product of and and the other from .
Expectation Values
The expectation value
of an operator , is given by
|
|
|
(3.47)
|
and is the "average value" of the operator. For a pure state
, this reduces to
|
|
|
(3.48)
|
Continue to Chapter 4 - Entanglement