Lec 2,3
Lec 2,3
2 / 45
The Model
3 / 45
The Model
4 / 45
The Model
5 / 45
Basic Formalism: Complex Numbers
A complex number is a number of the √ form a + bi for a, b ∈ R, where
i is the imaginary root of −1, i.e. i = −1.
6 / 45
Basic Formalism: Complex Numbers
A complex number is a number of the √ form a + bi for a, b ∈ R, where
i is the imaginary root of −1, i.e. i = −1.
Real and Imaginary parts:
7 / 45
Basic Formalism: Complex Numbers
A complex number is a number of the √ form a + bi for a, b ∈ R, where
i is the imaginary root of −1, i.e. i = −1.
Real and Imaginary parts:
Polar Co-ordinates:
9 / 45
Basic Formalism: Complex Numbers
10 / 45
Basic Formalism: Complex Numbers
11 / 45
Basic Formalism: Complex Numbers
12 / 45
Basic Formalism: Complex Numbers
13 / 45
Basic Formalism: Complex Numbers
14 / 45
Origins: Double Slit Experiment
16 / 45
Origins: Double Slit Experiment
When passed through one slit at a time, or observed using detectors
in front of each slit, light behaves as particle (i.e. no interference
pattern). Observation “collapses” wave function of particle.
17 / 45
Origins: Double Slit Experiment
When passed through one slit at a time, or observed using detectors
in front of each slit, light behaves as particle (i.e. no interference
pattern). Observation “collapses” wave function of particle.
Without observation, photon was in position of two states “top” and
“bottom”, going through both at same time.
18 / 45
Origins: Double Slit Experiment
When passed through one slit at a time, or observed using detectors
in front of each slit, light behaves as particle (i.e. no interference
pattern). Observation “collapses” wave function of particle.
Without observation, photon was in position of two states “top” and
“bottom”, going through both at same time.
Quantum computing seeks to use this “superposition” to generate
“parallelism”.
20 / 45
What’s the Catch?
Say that each register simultaneously stores both bits, 0 and 1.
How many bits do n registers store?
21 / 45
What’s the Catch?
Say that each register simultaneously stores both bits, 0 and 1.
How many bits do n registers store?
Can we run exponentially many threads of computation in parallel?
Then, can we solve NP-complete problems?
22 / 45
What’s the Catch?
Say that each register simultaneously stores both bits, 0 and 1.
How many bits do n registers store?
Can we run exponentially many threads of computation in parallel?
Then, can we solve NP-complete problems?
Possibly can simultaneously try all possible solutions, but must
quickly concentrate probability on “correct” solution!
24 / 45
Defining a Qubit
Inner Product
25 / 45
Defining a Qubit
Inner Product
26 / 45
Defining a Qubit
27 / 45
Defining a Qubit
28 / 45
Defining a Qubit
29 / 45
Defining a Qubit
30 / 45
Examples
31 / 45
Useful Bases
32 / 45
Useful Bases
33 / 45
Useful Bases
34 / 45
Multiple Qubits
Say we have two qubits, A and B – how can we write these?
35 / 45
Multiple Qubits
Say we have two qubits, A and B – how can we write these?
Construct a basis: perform a mapping from strings to orthonormal vectors.
36 / 45
Multiple Qubits
Say we have two qubits, A and B – how can we write these?
Construct a basis: perform a mapping from strings to orthonormal vectors.
n
When considering n qubits, consider vector space C2 where each basis
vector is labelled by an n bit string. A quantum state of n qubits can be
written as:
X X
|Ψi = αx |xi , where |αx |2 = 1.
x∈{0,1}n x∈{0,1}n
37 / 45
Multiple Qubits
Example EPR pair:
1
|EPRi = √ |00i + |11i
2
Later, we will show that this state is entangled.
38 / 45
Multiple Qubits
Example EPR pair:
1
|EPRi = √ |00i + |11i
2
Later, we will show that this state is entangled.
α
How to combine qubits: Given two arbitrary qubits |ψA i = A and
βA
α
|φB i = B , how to express their combined state?
βB
39 / 45
Multiple Qubits
Example EPR pair:
1
|EPRi = √ |00i + |11i
2
Later, we will show that this state is entangled.
α
How to combine qubits: Given two arbitrary qubits |ψA i = A and
βA
α
|φB i = B , how to express their combined state?
βB
Tensor Product:
40 / 45
Examples
Establish that the tensor product is distributive, associative but not
commutative.
41 / 45
Examples
Establish that the tensor product is distributive, associative but not
commutative.
Application: generate true randomness!
42 / 45
Examples
Establish that the tensor product is distributive, associative but not
commutative.
Application: generate true randomness!
0/1
|Ψi
Figure: A measurement of |Ψi will yield either |0i (”0”) or |1i (”1”).
44 / 45
Acknowledgements
Slides for the course are based on material in courses offered at UIUC
and Princeton (see webpage).
All images – courtesy Google Images.
This applies for all slides throughout the course.
45 / 45