Time Evolution Operator
Time Evolution Operator
|ψi → Û |ψi.
d|ψi/dt = −iĤ(t)|ψi/~,
– p. 2/25
Suppose |ψ(t)i = Û (t)|ψ(0)i for some matrix Û (t) (which we
don’t yet assume to be unitary). Plugging this into the
Schrödinger equation gives us:
– p. 3/25
For time-independent Hamiltonians we can easily write
down the solution to the Schrödinger equation. Using the
spectral theorem, we choose a basis {|ki} of eigenvectors of
Ĥ with eigenvalues Ek , Ĥ|ki = Ek |ki. We then write |ψ(t)i
in terms of this basis:
X X X
Ĥ = Ek |kihk|, |ψ(t)i = αk (t)|ki, |αk (t)|2 = 1.
k k k
– p. 5/25
Since the identity commutes with everything,
it
exp − aIˆ + bX̂ + cŶ + d
~
iat ˆ it
= exp − I exp − bX̂ + cŶ + dẐ
~ ~
= e−iat/~ exp −(it/~)(bX̂ + cŶ + dẐ) .
– p. 6/25
The most general spin-1/2 Hamiltonian is therefore
ˆ
Ĥ = bX̂ + cŶ + dẐ = E0~n · ~σ
where p
E 0 = b 2 + c2 + d 2 ,
~n = (nx , ny , nz ) = (b/E0 , c/E0 , d/E0 ),
with n2x + n2y + n2z = 1 and ~σˆ = (X̂, Ŷ , Ẑ). The unitary is
ˆ.
exp(−iĤt/~) = cos(E0 t/~)Iˆ − i sin(E0 t/~)~n · ~σ
for any τ .
– p. 8/25
Building up unitaries
Unfortunately, we cannot always choose the exact values of
the eigenvalues Ek or the eigenvectors |ki. These are
generally given to us by nature. But we sometimes can
increase the range of our options by combining several
different unitaries in a row. The important thing to remember
is that any product of unitary operators is also unitary:
Û † Û = V̂ † V̂ = Iˆ =⇒ (Û V̂ )† (Û V̂ ) = V̂ † Û † Û V̂ = I.
ˆ
– p. 9/25
We can also do the unitaries
Û2 (τ2 )Û1 (τ1 ), and Û2 (τ3 )Û1 (τ2 )Û2 (τ1 ),
These produce unitaries Û1 (θ) and Û2 (θ) which correspond,
in the Bloch sphere representation, to rotations by θ about
the X and Y axes, respectively.
– p. 10/25
There is a theorem in geometry that a rotation by any
angle θ around any axis ~n can be done by doing three
rotations in a row around the X and Y axes:
for some φ1 , φ2 , φ3 .
Since every 2 × 2 unitary is equivalent to a Bloch sphere
rotation about some axis ~n, any 2 × 2 unitary equals
– p. 12/25
Tensor products of unitaries
We have seen that Hilbert spaces of composite systems are
represented by tensor products of the Hilbert spaces of the
component systems:
H12 = H1 ⊗ H2 .
– p. 13/25
Ĥ1 ⊗ Iˆ and Iˆ ⊗ Ĥ2 commute, so
Û (t) = exp(−iĤt/~)
= exp(−i(Ĥ1 ⊗ Iˆ + Iˆ ⊗ Ĥ2 )t/~)
ˆ ~) exp(−iIˆ ⊗ Ĥ2 t/~)
= exp(−iĤ1 ⊗ It/
= exp(−iĤ1 t/~) ⊗ exp(−iĤ2 t/~)
≡ Û1 (t) ⊗ Û2 (t).
– p. 14/25
Interactions and entanglement
If the Hamiltonian has the form
– p. 15/25
Let’s take an example for two spin-1/2s: Ĥint = Eint Ẑ ⊗ Ẑ .
This yields unitary transformations of the form
– p. 17/25
Consider now a superposition state |χi = α|ψi + β|φi.
By linearity,
– p. 18/25
This simple result has many profound consequences.
For one, the state |ψi of a system is not an observable. Given a
quantum system, there is no way to tell in what state |ψi
it was prepared.
If the state |ψi is known, the state can be “copied” by
preparing another system. But it is impossible to copy
an unknown quantum state.
This means that many techniques of classical
information theory (such as protecting information by
making redundant copies, or having a fanout gate from a
single bit) are impossible in quantum information theory.
– p. 19/25
Quantum gates and circuits
We have seen that it is possible to build up new unitary
operators by multiplying together some set of standard
ones. This is rather analogous to the situation in classical
logic, where any Boolean function can be built up from a set
of standard functions of one or two bits, called logical gates:
– p. 20/25
First we define the basic unit of quantum information:
the quantum bit. This is the simplest possible quantum
system, one with two distinguishable states. In other
words, the quantum bit (or q-bit) is our old friend, the
spin-1/2! We take the standard basis to be |0i ≡ | ↑Z i,
|1i ≡ | ↓Z i.
The simplest gate, affecting only a single q-bit, is the
NOT gate:
|0i ↔ |1i.
We see that this is also a familiar operator: X̂ .
NOT is the only nontrivial one-bit classical gate. But in
quantum mechanics, there are far more possibilities.
– p. 21/25
One important example with no classical analogue is
the Hadamard gate:
!
1 1 1
ÛH = √ .
2 1 −1
The wires of the circuit diagrams are q-bits, and the gates
are unitary transformations acting on those qubits.
(Such unitaries act on other q-bits as the identity.)
– p. 22/25
We can also define two-bit quantum gates. One
example is the controlled-not (CNOT):
– p. 23/25
Quantum circuits
There are infinitely many possible two-bit gates; but in
practice such unitaries are difficult to do. Fortunately, it
turns out that just the CNOT (or almost any other two-bit
gate), together with one-bit gates, can be used to build
up any unitary. (We will prove this later in the class!)
When we combine standard unitary gates, we call the
resulting unitary a quantum circuit. Here’s a simple
example that uses three CNOT gates to swap the first
and second bits:
– p. 24/25
You can check that this this circuit does indeed swap
the two q-bits by acting with it on each of the basis
states for two q-bits:
Note that the control and target bits can all be switched,
and this will still be a swap gate.
A quantum circuit for a less trivial unitary will in general
be much more complicated. The problem of designing
quantum algorithms is largely the task of designing such
quantum circuits.
Next time: some simple examples with light.
– p. 25/25