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 for the sake of completeness of our understanding
of how quantum mechanics from a textbook is related to quantum
computing. The connection is, as of yet, clear but the story seems
incomplete from a physicists perspective and 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, but not usually covered in most quantum mechanics
classes, either undergraduate or graduate.
It is also worth emphasizing that this chapter is primarily aimed at
physicists and for those others which are interested in the background
physics. 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, and it is, then the matrix
|
|
|
(3.5)
|
is unitary.
(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 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 just to show how it goes,
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 outter product of two vectors. For example, if
|
|
|
(3.10)
|
then
However,
|
|
|
(3.11)
|
Again , so . If we
differentiate this with respect to ,
|
|
|
(3.12)
|
which is the Schrodinger equation for the density matrix, with solution,
|
|
|
(3.13)
|
This follows from .
Consider our two-state system
|
|
|
(3.14)
|
A superposition of these two states is
|
|
|
(3.15)
|
where and are complex numbers such that
. The corresponding
pure state, (i.e. rank one) density matrix is given by
|
|
|
(3.16)
|
Note that the superposition in Eq.(3.15) 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.17)
|
Notice also that the determinant of this matrix is zero:
|
|
|
(3.18)
|
To see this another way, note that the density operator of rank one
can be written as , so that the determinant
is
|
|
|
(3.19)
|
Measurements Revisited
If the state of a quantum system is described by
|
|
|
(3.20)
|
the probability of finding it in the state when measured in
the computational basis is . However, this is a
particular superposition which could be written as
|
|
|
(3.21)
|
In the section entitled Schrodinger's Equation it was shown that this matrix results
from the exponentiation of a Hermitian matrix and from the section entitled The Pauli Matrices any
Hermitian matrix can be written in terms of the Pauli matrices. To make this explicit using standard conventions,
|
|
|
(3.22)
|
where is a unit vector, and .
One can write this matrix out explicitly
|
|
|
(3.23)
|
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.24)
|
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.25)
|
and the probability of finding is
|
|
|
(3.26)
|
Notice 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 0 of being in the state and transform 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 (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 matrix
(or density operator, see Appendix \ref{app:cohvec}), is a matrix which us used to
describe a more general state of a quantum system and can be written as
|
|
|
(3.27)
|
where , and the are pure states. There is also a generalization of the Bloch sphere which is described in Appendix {app:polvec}.
The mixed state density matrices 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 matrix, 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. Another set of physical systems which are described by density matrices will be given elsewhere.
General Properties
In general, a density matrix has the following properties:
|
|
|
(3.28)
|
If, in addition, it is a pure state, then
|
|
|
(3.29)
|
Eq.(\ref{eq:dmatpos}) 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 matrix (for a two-state system) is a rank two density matrix, , which can be described by
|
|
|
(3.30)
|
where ,
and . The are probabilities and must sum to one.
(Note, if , or if one or one
is zero, this reduces to a pure state.) For
example, the probability of finding the state is
and the probability of finding the state is .
Density Matrix for the Description of Open Quantum Systems: An Example
One example of the utility of a density matrix is the following
statistical problem. Let us consider the collection of two-state
systems, this will be a collection of electrons in a box and their
spin is a two-state system, being either up or down when measured. If
a subset of these electrons was 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.31)
|
where the fraction of ''up'' particles is and the fraction of ''down'' is . Our system is described by this density matrix because 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 which is more relevant for our purposes. For
a certain system (again a two-state system is take as an example)
if there is some probability for an error to occur, let us say our
example is a unitary operator , then the density matrix for the
system is
|
|
|
(3.32)
|
This is the same form as Eq.(\ref{eq:tsdmatex1}).
Note that in each
case the probabilities associated with the density matrix , and
, (generally, the ) are classical probabilities. That
is, 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 for the following reason. The state
can be taken to the state with a unitary
transformation. This state is deterministic in the sense that the
result will be obtained from a measurement in the
computational basis since there is no probability for obtaining
. However, for nonzero and a non-identity
operator , the matrix has rank two and thus can never have
probability for either of the two states, or .
Thus, 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 one.
For the mixed state density operator this is not possible. The state
|
|
|
(3.33)
|
for which we have the least amount of knowledge 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 and if one
eigenvalue is zero, there is a definite best guess.
To be more specific, independent of basis (unitary transformations),
one always has probability greater than zero of measuring
and probability greater than zero of measuring
. 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 and its corresponding diagonal matrix. Let , then
|
|
|
(3.34)
|
Two-State Example: Bloch Sphere
Since our interest is primarily in qubits, which are two-state
systems, we return again to an example.
A very convenient representation of two state density matrices, one
can written in the so-called Bloch sphere
representation given the fact that the density matrix is Hermitian,
|
|
|
(3.35)
|
where, for the density matrix to be positive , and the
are the Pauli matrices
|
|
|
(3.36)
|
The matrix entries on the RHS of this equation are called the Pauli matrices.
The eigenvalues are given by
|
|
|
(3.37)
|
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.38)
|
and using
|
|
|
(3.39)
|
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.40)
|
This implies that
|
|
|
(3.41)
|
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.
Expectation Values
The expectation value
of an operator , is given by
|
|
|
(3.42)
|
and is the "average value" of the operator. For a pure state
, this reduces to
|
|
|
(3.43)
|
Continue to Chapter 4 - Entanglement