Title: Alice and Bob in the Quantum Wonderland
1Alice and Bob in theQuantum Wonderland
2Two Easy Sums
- 7873 x 6761 ?
-
- ? x ? 26 292 671
3Superposition
4(No Transcript)
5How can a particle be a wave?
6Polarisation
7Three obstacles are easier than two
8Addition of polarised light
?
9The individual photon
PREPARATION
MEASUREMENT
Yes
No
10How it looks to the photon in the stream (2)
PREPARATION
MEASUREMENT
MAYBE!
11States of being
E?
NE ?
N ?
NW?
N ?
NE ?
12Quantum addition
Alive Dead ?
13Schrödingers Cat
CAT? ALIVE? DEAD?
14Entanglement
Observing either side breaks the entanglement
15Entanglement killed the cat
According to quantum theory, if a cat can be in a
state ALIVE ? and a state DEAD?, it can also be
in a stateALIVE? DEAD?.
Why dont we see cats in such superposition
states?
16Entanglement killed the cat
ANSWER because the theory actually predicts..
17Entangled every which way
18Einstein-Podolsky-Rosen argument
If one photon passes through the polaroid, so
does the other one.
Therefore each photon must already have
instructions on what to do at the polaroid.
19(No Transcript)
20The no-signalling theorem
I know what message Bob is getting right now
Quantum entanglement can never be used to send
information that could not be sent by
conventional means.
But I cant make it be my message!
21Quantum cryptography
0
0
1
1
0
0
0
0
1
1
Alice and Bob now share a secret key which
didnt exist until they were ready to use it.
22Quantum information
Yes
?
No
1 qubit T0.0110110001
1 bit 0 or 1
To calculate the behaviour of a photon,
infinitely many bits of information are required
but only one bit can be extracted.
Yet a photon does this calculation!
23Available information one qubit
0
1 qubit
1 bit
1
or
x
1 qubit
1 bit
y
24Available information two qubits
0 0
0 1
1 0
1 1
2 qubits ? 2 bits
25Teleportation
Transmission
Reception
Measurement
Reconstruction
?
26Quantum Teleportation
Measure
W,X,Y,Z?
27Dan Dare, Pilot of the Future. Frank Hampson,
Eagle (1950)
28Dan Dare, Pilot of the Future. Frank Hampson,
Eagle (1950)
29Nature 362, 586-587 (15 Apr 1993)
30Computing
INPUT N digits
COMPUTATION Running time T
OUTPUT
How fast does T grow as you increase N?
31Quantum Computing
64
20/3
But you can choose your question
E.g. Are all the answers the same?
32Two Easy Sums
- 7873 x 6761 ?
-
- ? x ? 26 292 671
53 229 353
33Not so easy .
But on a quantum computer, factorisation can be
done in roughly the same time as multiplication
T N 2 (Peter Shor, 1994)
N T for multiplying two N-digits T for factorising a 2N-digit number
1 1 2
2 4 4
3 9 8
4 16 16
5 25 32
10 100 1,024
20 400 1,048,576
30 900 1,073,741,824
40 1600 1,099,511,627,776
50 2500 1,125,899,906,842,620
T N 2 T 2 N
34 Key Grip Lieven
Clarisse Visual Effects
Bill Hall Focus Puller Paul
Butterley Best Boy Jeremy
Coe
No cats were harmed in the preparation of this
lecture
Alice Sarah
Page Bob Tim
Olive-Besly