Lecture 14
Lecture 14
Before we start on the bulk of this lecture, we need to cover two concepts that haven’t been covered so far. The
first is the concept of the entropy of a quantum state, which is defined as:
Exercise: What are the entropy and purity of a pure state, S(|ψihψ|) and P (|ψihψ|)? What are the
entropy and purity of the completely mixed state in d dimensions, S( Idd ) and P ( Idd )?
Note that as the mixedness or uncertainty in the state increases, the entropy increases and the purity decreases.
So far in this course you’ve mainly seen what ideal quantum operations looks like. For example, a state trans-
formation is a unitary map |ψi → U |ψi, and a projective measurement is the following map: |ψi → P√i |ψi
pi . But in
reality when we perform a quantum operation (e.g., rotation, measurement, coupling) there will inevitably be errors
due to noise in the experimental apparatus. Some examples of errors that are commonly encountered in quantum
information processing are:
1. Uncertainty in the implemented rotation angle.
2. Control pulses with electronic noise.
3. Noise from nearby “junk”, which are usually uncontrollable degrees of freedom that couple to qubits.
In this lecture and the next four we will discuss how to model these nonidealities and how to deal with them and do
quantum information tasks reliably in their presence.
A. An example
Let’s start with an example. Suppose we have a qubit that starts in the state |ψi = √1 (|0i + |1i), and we want to
2
perform a σz rotation on it. To do so we turn on a Hamiltonian in the form
ω
H= σz .
2
Then ideally,
1 ω ω
|ψ(t)i = e−iHt |ψ(0)i = √ (e−i 2 t |0i + ei 2 t |1i).
2
1 We define 0 log 0 = 0.
2
π
This affects a rotation around the Z axis, and if we apply it for t = ω, we get a Z-gate. That is,
π E 1 1
ψ( ) = √ (−|0i + |1i) ≡ √ (|0i − |1i),
ω 2 2
where the last equivalence is due to the unimportance of the global phase of a quantum state.
But now, what if ω is not exactly known? Suppose we have some uncertainty in our calibration and all we can
says is that ω ∼ N (ω0 , σ 2 ). That is, ω is Gaussian distributed around some nominal value with some variance σ 2 .
Then after a time t all we can say is that we have some distribution over Z rotations. We must average over this
uncertainty to get an estimate of the actual state. Note that this is exactly what we do in classical physics also, we
average over unknowns to get the state. Let’s see what we get when we compute this average.
Anytime we average over quantum states, we should use the density matrix formalism. The state at time t, for a
given value of ω is
1h ω ω ω ω ω ω ω ω
i
ρω (t) = |ψω (t)ihψω (t)| = e−i 2 t |0ih0|ei 2 t + e−i 2 t |0ih1|e−i 2 t + ei 2 t |1ih0|ei 2 t + ei 2 t |1ih1|ei 2 t
1 1 −iωt
2
2 2 e
= 1 iωt 1
2e 2
So then, when we average over the rotation parameters, the average state is:
Z
ρ(t) = P (ω)ρω (t)dω
Ω 1 R 1
R
R
2 Ω
P (ω)dω 2 Ω
P (ω)e−iωt dω
R
= 1 1
P (ω)eiωt dω 2 Ω P (ω)dω
2 Ω 1 1
R
R 2 2 Ω
P (ω)e−iωt dω
= 1 iωt 1 ,
2 Ω P (ω)e dω 2
where Ω is the support of the probability distribution for ω (the whole real line for the normal distribution above).
We see that the off-diagonal elements are complex conjugates of each other, so let’s look at one of them:
Z Z ∞
1 (ω−ω0 )2 (tσ)2
P (ω)e−iωt dω = √ e− 2σ2 e−iωt dω = e− 2 −iω0 t . (3)
Ω 2πσ 2 −∞
Therefore, the average density matrix is:
2 !
1 1 − (tσ) −iω0 t
2e
2
ρ(t) = 22 . (4)
1 − (tσ) +iω0 t 1
2e
2
2
Exercise: Perform the generalized Gaussian integral required to get the last equality in Eq. (3). This
is one of the most useful integrals in physics and it’s usually obtained by completing the square in the
exponent.
There are several things to note about the state in Eq. (4):
1. tr (ρ2 ) < 1 for all t > 0. That means the state becomes mixed as a result of the uncertain rotation.
2. The off-diagonal elements oscillate at frequency ω0 , but also decay exponentially with time and increasing
uncertainty (σ 2 ).
3. As t → ∞ or σ → ∞,
1 1 0
ρ→ ,
2 0 1
So if we have too much uncertainty about the rotation angle or apply the Hamiltonian for too long, we just get
the completely mixed state.
Exercise: Compute the purity and entropy of the state in Eq. (4) as a function of t and σ.
3
Environment
System
FIG. 1: A system embedded in a larger environment. Most coupling between a quantum system and its environment will result
in decoherence of the system.
This example shows how uncertainty in the operations one performs can result in an increase in entropy or mixedness
of the state. This is also true if there is noise (e.g., if ω is a time-dependent random process). In this example, the
uncertainty led to a decay of the off-diagonal element of the density matrix, which contains information about the
phase of the state (in the computational basis). Consequently, this process is called dephasing. In general, external
influences and uncertainty can lead to more general transformations of the state, and we collectively refer to the wide
class of phenomena that cause the state of a quantum system to evolve nondeterministically and/or to increase in
entropy as decoherence.
All decoherence arises from a coupling of the system we are interested in to an environment that is (at least partially)
uncontrolled and unobserved. See figure 1. For instance, in the example above, the uncertainty in ω could be due to
us not knowing the precise parameters that dictate the physics that determine this rotation frequency. As a result, we
refer to the dynamics of a system under such couplings to external environments as open system dynamics. In fact,
this perspective gives us a general way to model open system dynamics and decohernce processes mathematically.
Suppose we begin with the system and environment in a product state at an initial time:
%(0) = ρS0 ⊗ φE φE , (5)
where ρS0 is the (possibly mixed) initial state of the system and φE φE is the pure initial state of the environment.
We can always assume the environment is in a pure state initially since if it is not we can expand our definition of
the environment until it is. Then, at some late time t, the joint state of the system and environment is:
†
%(t) = USE %(0)USE , (6)
where US E is a unitary evolution that captures the evolution of the system, the environment, and any coupling
between them. Then the reduced state of the system at t is given by tracing out the environment from the above
4
state, i.e., ρS (t) = tr E (%(t)). We can formally write down what this resulting state is as so:
h
† i
ρS (t) = tr E USE ρS0 ⊗ φE φE USE
K
X
E
E † E
= aE S
k USE ρ0 ⊗ φ φ USE ak
k=1
K
X
= Ak ρS0 A†k , (7)
k=1
where
eE
k for 1 ≤ k ≤ K is a complete set of orthonormal states (a basis) in the environment Hilbert space, and
E E
Ak ≡ ak USE φ , which is an operator acting on the system Hilbert space only.
Example 1 [From Nielsen & Chuang, p.361] Consider an example
where the system and environment
are single qubits, and the environment starts off in the state 0E . Then suppose the interaction between
them after some time t, is described by the unitary
σx σy
USE = √ ⊗ I + √ ⊗ σx . (8)
2 2
Then the reduced state of the system at this time is given by Eq. (7), with
σx σ σ
A0 = 0E USE 0E = √ × h0|I|0i + √y × h0|σx |0i = √x
2 2 2
E E σx σy σy
A1 = 1 USE 0 = √ × h1|I|0i + √ × h1|σx |0i = √
2 2 2
Explicitly,
1 1
ρS = σx ρS0 σx + σy ρS0 σy (9)
2 2
Notice that Eq. (7) is a representation of the system density matrix at a fixed time t. It is a map of the density
matrix from t = 0 to some future time.
Defintion: The map E : ρ0 → ρ, with representation
K
X
ρ = E(ρ0 ) = Ak ρ0 A†k (10)
k=1
is referred to as an operator sum decomposition (OSR), or a Kraus representation, or a quantum process. The operators
{Ak }Kk=1 are referred to as Kraus operators. The only condition on Ak comes from the fact that we usually want the
output of the map to be a trace 1 density matrix 2 . Therefore,
! !
X †
X †
1 = tr (ρ) = tr Ak ρ0 Ak = tr Ak Ak ρ 0 ,
k k
where we have used the cyclic property of trace (tr (AB) = tr (BA)) to get the last equality. Since this relationship
has to hold for all ρ0 , this means
X †
Ak Ak = I
k
2 There are some special cases where the quantum process does change the trace, but we will not encounter these in this course, and so
we restrict ourselves to trace-preserving maps, where we specify that the output state has trace 1.
5
↵⌦ USE (t) h ↵⌦ i
⇢S0 ⌦ E E
⇢SE = USE (t) ⇢S0 ⌦ E E
USE (t)†
tr E tr E
⇢S0 ⇢S = Et (⇢S0 )
Et
FIG. 2: The conceptual idea behind quantum processes/CPTP maps. Just as the unitary in the joint space of system and
environment provides a map from initial state to final state (at some given time, t), the quantum process provides the map
between an initial reduced system state and a final reduced system state (at some given time, t).
P P
1. E is linear, i.e., E ( i pi ρi ) = i pi E (ρi ).
2. E preserves hermiticity and trace.
3. E preserves positivity, and is in fact, completely positive. The first part of this condition means that ρ is positive
if ρ0 is. The completely positive conditions means:
[IA ⊗ EB ] (ρAB
0 )=ρ
AB
> 0. (11)
Physically this condition means that if E is applied to one subsystem (subsystem B) while nothing is done to
another system (the IA is the identity map on subsystem A), then the resulting density matrix on the combined
system, ρAB , is positive, if the initial density matrix, ρAB
0 is positive. This has to be true regardless of the
dimension of subsystem A.
I note that these conditions are very reasonable for a physical process, and any map that satisfies these conditions is
called at completely positive, trace preserving (CPTP) map. It turns out that any map that satisfies these conditions
also has a representation as Eq. (10).
So we see that we arrive at Eq. (10) from a physical perspective as well as a mathematical one. Almost every valid
quantum process has an OSR representation, and we will see some examples below.
Notice the similarity between how we derived Eq. (7) and our definition of generalized measurements and POVMs.
This is not coincidence, because we can in fact get a nice interpretation of open system dynamics by thinking in
terms of generalized measurements. Conversely, we can think about generalized measurement as a special case of
open system dynamics.
We saw that POVMs are implemented by coupling the main system to an ancilla and projectively measuring the
ancilla, see figure 3. This is similar to what happens in open system dynamics, when a system is coupled to an envi-
ronment. However, there is a crucial difference: for POVMs we assume that we have access to the ancilla and perform
projective measurements on it. For open system dynamics, we do not assume any access to the environment. However,
any open system dynamics (and any decoherence process) can be thought of as a coupling to an ancilla/environment
after which someone else performs a projective measurement of the ancilla and does not tell you the result (but does
tell you the basis they measured in 3 ). Therefore, we should average over all generalized measurements that could
have been affected on the system to get an expression for the evolved state:
X
ρ= pk ρk , (12)
k
where ρk is the post-measurement state after the result corresponding to measurement operator Mk was seen. How-
ever, we do not know which results occurred, and so we average over all results according to their probabilities,
3 This might seem fishy that you require knowledge of the basis, but not the result. Actually, the following argument also works if you
don’t know the basis, as we shall see in the next subsection.
6
S
ψ
A USA
φ
FIG. 3: A general implementation of a POVM. The system is coupled to an ancilla which is then measured projectively.
pk . Remember from the lecture on generalized measurements that the post-measurement state corresponding to
measurement operator Mk is
Mk ρ0 Mk†
ρk = (13)
pk
which is an OSR. Therefore, we see that any open system dynamics can be interpreted as coupling to another system
(call it ancilla or environment) that is measured projectively, but then the results of the measurement are averaged
over.
The Kraus operators that appear in the OSR for a quantum process, i.e., the Ak in Eq. (10), are not unique.
PK PK
That is, k=1 Ak ρA†k could represent exactly the same process as k=1 Bk ρBk† if the two sets of Kraus operators are
related by a unitary matrix. That is,
K
X
Bi = uij Aj ,
j=1
where uij are elements of a unitary matrix. To see the equivalence between the two representations, we write
!
XK XK XK XK
Bk ρBk† = ukj Aj ρ u∗ik A†i
k=1 k=1 j=1 i=1
X
= u∗ik ukj Aj ρA†i
kij
X K
X
= δij Aj ρA†i = Aj ρA†j .
ij j=1
P
Here we have used the fact the uij are elements from a unitary matrix, and therefore k u∗ik ukj = δij .
From a physical perspective, we can trace the meaning of this unitary freedom back to the derivation of the OSR
in the steps preceding Eq. (7). In this derivation, we took the trace over the environment in the basis aE
k . However,
there is nothing that distinguishes this basis from another basis on the environment space (e.g., for a qubit, {|0i, |1i}
or {|+i, |−i} could be used as a basis). Two bases are related to each other by a unitary transform and this is exactly
how different Kraus operators for the same quantum process are related to each other.
Example 2 To illustrate the non-uniqueness of the Kraus operators for a given quantum process,
E let
us
return to setup considered in example 1. Instead of measuring the environment qubit in the 0 , 1E
basis, let us see what happens if we measure it in the +E , −E basis.
E σx σ 1 1
A+ = + USE 0E = √ × h+|I|0i + √y × h+|σx |0i = σx + σy
2 2 2 2
E E σ x σy 1 1
A− = − USE 0 = √ × h−|I|0i + √ × h−|σx |0i = σx − σy
2 2 2 2
7
Therefore the Kraus operators are different as expected. However, note that the quantum process (i.e., the
map from input states to output states) is the same, since
1 1 1 1
ρS = E(ρS0 ) = (σx + σy )ρS0 (σx + σy ) + (σx − σy )ρS0 (σx − σy ) = σx ρS0 σx + σy ρS0 σy , (15)
4 4 2 2
is the same as Eq. (9).
III. EXAMPLES
Now we will see some examples of quantum processes. All these examples are one qubit maps since these are most
relevant to quantum computing, but it should be kept in mind that the general formalism we went through in the
previous sections applies more generally to any quantum system. Chapter 8.3 of Nielsen and Chuang has very nice
geometric interpretations of each of these examples that you should definitely look at.
for some 0 ≤ p ≤ 1. This process represents scrambling of the phase of a qubit in the computational basis. Recall
that the example we went through in section II A was one physical instance of this process.
Exercise: Show that after evolution by the uncertain Hamiltonian from section II A with ω ∼ N (0, σ 2 ),
for a fixed time T , the resulting map on an arbitrary initial density matrix ρ0 is given by Eq. (16), with
(T σ)2
1 + e− 2
p= (17)
2
B. Bit-flip process
for some 0 ≤ p ≤ 1. This process represents scrambling of the amplitude of a qubit in the computational basis.
C. Depolarizing process
for some 0 ≤ p ≤ 1. This process represents scrambling of both the phase and amplitude of a qubit simultaneously.
It can also be written in an alternate form, that is not an OSR, but is sometimes more useful:
I
E(ρ0 ) = p + (1 − p)ρ0 . (20)
2
You saw this form in some of the problems in homework 4.
8
with
1 √ 0
A0 = (22)
0 1−p
√
0 p
A1 = (23)
0 0
for some 0 ≤ p ≤ 1. This process represents the relaxation of a qubit from the excited state to the ground state
(e.g., due to spontaneous emission). The parameter p represents the probability of this relaxation per unit time.
Exercise: Show that the amplitude damping channel leaves the ground state, ρ0 = |0ih0|, unchanged.