Quantum

Physics

Quantum Parallelism
Quantum computing is

Information
Science

Quantum Information Processing

Quantum Computer

Quantum
Information
Science

NT

Quantum Algorithms: Softwares

Simulation of quantum many-body systems
Factoring large integers
IT
Database search

exponentially larger and faster than digital computing.

Quantum Fourier Transform, Quantum Database Search,
Quantum Many-Body Simulation (Nanotechnology)

Experiments: Hardwares

No Clonability of Quantum Information,

Irrevesability of Quantum Measurement
Quantum Cryptography (Absolutely secure digital communication)

Ion Traps
NMR
Cavity QED, etc.

BT

Quantum Correlation by Quantum Entanglement

Quantum Teleportation, Quantum Superdense Coding,
Quantum Cryptography, Quantum Imaging

Quantum Information Processing

Bit and Logic Gate

01
10

Quantum Communication
Quantum Cryptography

IT

NOT

optical fiber
wireless secure satellite communication

AND

OR

000
011
101
111

Quantum Teleportation
Photons
Atoms, Molecules

NAND

000
010
100
111

Absolutely secure digital communication

Generation and Distribution of Quantum Key

Universal

Reversible
C-NOT

CCN ( Toffoli )

Quantum Imaging and Quantum Metrology

XOR

000
011
101
110

C-Exch ( Fredkin )

Universal
Reversible

Classical Computation

Turing Machine

Hilbert (1900): 23 most challenging math problems

Finite State Machine: Head

Is there a mechanical procedure

by which the truth or falsity of
any mathematical conjecture
could be decided?

Turing

Conjecture ~ Sequence of 0s and 1s

Read/Write Head: Logic Gates
Model of Modern Computers

N qubits Linear superposition

of

2N

states at the same time

Exponentially parallel computing

Quantum Parallelism
Deutsch
But when you extract result,
you cannot get all of them.

{0,1}

Infinitely long tape: Storage

Quantum Algorithms
2

{0,1} Qubit a 0 + b 1 with a + b = 1

N bits 2N states, One at a time

Linearly parallel computing AT BEST

Bit

s s'

Quantum Information
Bit

q = f ( q, s )

s = g ( q, s )
d = d ( q, s )

1. [Feynman] Simulation of Quantum Physical Systems

with HUGE Hilber space ( 2N-D )
e.g. Strongly Correlated Electron Systems

2. [Peter Shor]

Factoring large integers, period finding

tq Pol (N)
3. [Grover]

tcl Exp (N1/3)

Searching

tq N

tcl ~ N/2

Digital Computer
N bits

Quantum Gates

1 N

N bits

Time-dependent Schrdinger Eq.

i= = H
t
(t ) = eiHt / = (0) = U (t ) (0)

Digital Computers in parallel

N bits

m{

m N

N bits

1 0
1 0
0 1
P( ) =
I =
X =

0 ei
0 1
1 0

Quantum Computer : Quantum Parallelism

N bits

1 0
0 1
1 1 1
Z =P( )=
Y = XZ =
H=

2 1 1
0 1
1 0

N bits

1 1 1 1

=
2 1 1 0
1 1 1 0
H1 =

=
2 1 1 1
H 0 =

H1 H 2 ... H N 0 1 0 2 ... 0 N
1
1
1
=
0 1+ 11
0 2 + 1 2 ...
0 N+1
2
2
2
1
=
( 0102...0 N + 1102...0 N + ... + 1112...1N )
N
2
N 1
1 2
=
k (binary expression)
N
2 k =0

1 1 1
(0 +1)
=
2 1
2
1 1 1
(0 1)
=
2 1
2

Hadamard

Universal Quantum Gates

Hadamard Gate

Unitary Transform
Norm Preserving
Reversible

General Rotation of a Single Qubit

i
N

ie sin
cos
2
2

V( ,) =
+i

cos
ie sin
2
2

Xc: CNOT (controlled - NOT) or XOR

1

0
= 0

0 1 0 0 0 0 1

0 0 1 0 1 1 0
0 I+ 1 1 X

Xc a b = a a b

Quantum Network
DiVincenzo, Qu-Ph/0002077
Scalable Qubits

Unitary evolution
: Deterministic
: Reversible
Universal Gates

Initial State

|0
| |0
|0

X
H
t

X1H2

CX

M
|
13
M
M

Physical systems actively considered

for quantum computer implementation

Liquid-state NMR
NMR spin lattices
Ion-trap
Neutral-atom optical
lattices
Cavity QED + atoms
Linear optics with
single photons
Nitrogen vacancies in
diamond

QKD[E91]
SingleQuantum Repeater
& Two-Qubit Gates
Quantum Teleportation
Quantum Error Correction SingleQuantum Computer
& Two-Qubit Gates

Quantum measurement
: Probabilistic
: Irreversible change

Cohere,
Not Decohere

Quantum Key Distribution

Single-Qubit Gates
[BB84,B92]

Electrons on liquid He
Josephson junctions
charge qubits
flux qubits
Spin spectroscopies,
impurities in semiconductors
Coupled quantum dots
Qubits: spin,charge,
excitons
Exchange coupled,
cavity coupled

15 = 3 5

Chuang
Nature 414, 883-887 (20/27 Dec 2001)
OR QP/0112176

~3
~3

Ion Traps
Couple lowest centre-of-mass modes to
internal electronic states of N ions.

Quantum-dot array proposal

Quantum Error Correcting Code

Three Bit Code

No Male
F

Encode

Recover

Decode

channel

Um1m2

0
0
noise

No Female

No Male

No Young
No Female

F
O

Female / Male vs. Young / Old

Y F O
M

No Young

No Male

No Female

No Young

No Male
M
F

No Female
O

O
M

Cryptography and QIP

Giving disease (Q Comp),
Giving medicine (QKD).

Public Key Cryptosystem (Asymmetric)

Computationally Secure
Based on unproven mathematical conjectures
Cursed by Quantum Computation

One-Time Pad (Symmetric)

Unconditionally Secure
Impractical
Saved by Quantum Cryptography

Quantum Key Distribution is a major paradigm

shift in the development of cryptography.
Conventional and quantum cryptography are a
powerful combination in making a secure
communications a reality.
-Burt Kaliski, Chief Scientist, RSA Laboratories

[Symmetric]

[Symmetric]

One-Time pad
Alice

One-Time Pad
Vernam

Bob

Alice

Tell me the password.

M = 01100110001
K = 01010100101
E = 00110010100

(random)

E = 00110010100
K = 01010100101
M = 01100110001

(random)

Pass word + key =

4672856

Eve

Bob

4672856
4672856 key
= pass word

Unconditionally Secure
Impractical: Generation and Distribution

[Symmetric]
Encoding
MK: 00=0, 01=1, 10=1, 11=0
KEY

11011001011011001010101010101010010101010
01010101001010100111001000101001010101010
10010101001010101010010101101010100101010
01010100101001010101001011010010100010010
10010101001010101001010110101010011001111

11011101011000111000100001010010010101010
Cypher 01010001001110101101000010101001010101010
10010001001110100000011110010010100101010
Text
01010000101101011100011001010010100010010
10010010111001011001110101010010011001111

KEY

11011001011011001010101010101010010101010
11011101011000111000100001010010010101010
01010101001010100111001000101001010101010
01010001001110101101000010101001010101010
10010101001010101010010101101010100101010
10010001001110100000011110010010100101010
01010100101001010101001011010010100010010
01010000101101011100011001010010100010010
10010101001010101001010110101010011001111
10010010111001011001110101010010011001111

Why is it called One-Time?

E1 = M1 K
E2 = M2 K
E1 E2
= ( M1 K ) ( M2 K )
=
M1 M2 ( K K )
=
M1 M2 (
0
)
=
M1 M2

[Asymmetric]

[Asymmetric]

Public Key Cryptosystem

Diffie, Hellman
RSA : Rivest, Shamir, Adleman

Alice1, Alice2,

Bob

RSA Cryptosystem
Message M
n = p q , e d = 1 mod (p-1)(q-1)

Message [m]

Eve

Message [m]

n, e : Public Key (Encryption)

Encryption

Cryptogram
[c]

Decryption

n, d : Secret Key (Decryption)

Encryption Key

Decryption Key

[k]

[d=f(k)]

Computationally Secure
Could be broken,
especially by Quantum Computers

RSA Example
Bobs Keys
p = 11, q = 13, n = p q = 143
d = 103, e = 7
d e mod (p-1)(q-1) = 103 x 7 mod 120 = 1

Alice : E = Me mod n
Bob :

M = Ed mod n

M Message

How Hard is Factoring?

Almost exponentially complex with the
number of digits, L
RSA129 (1977)
Factored 17 years later using 1,600 computers

Alices Message:
M=9
E = Me mod n = 97 mod 143 = 48

Bob
M=Ed mod n = 48103 mod 143 = 9

2,000 Digit Number

Impossible to factor even

Vazirani

With as many digital computers as the number of

particles in the Universe (1080)
In as long time as the age of the universe (1018 sec)

No Cloning Theorem
An Unknown Quantum State Cannot Be Cloned.
Zurek, Wootters
Diks

<Proof>

U( 0 )=

U( 0 )=

1
Let =
( + ).
2
1
Then U ( 0 ) =
( +
2

XOR

X AB = 0

Qubit Copying Circuit?

0000
0101
1011
1110

Controlled-NOT

1
=
0
1
0
=
0

0
1
0
=
0

AA

0 IB + 1

AA

1 XB

0
1 0 0

0 A 0 1 B 0
0 0 0
0 0

0 0
1 0 0
+
0 0
0 0 0

0 0 0 AB 0 0
0 0 0
1 0 0
0 0 1

0 1 0 AB

0
0 1

1 A 1 0 B
0 0
0 0
0 1

1 0 AB

x
0

y x y

x
x

= a 0 +b 1
0

= a 0 +b 1
a 00 + b 11
= a 0 +b 1

IF an unknow quantum state

CAN be cloned
Quantum States can be measured as
accurately as possible ???
| | , | , | , |
measure, measure,
Communication Faster Than Light?
| = |1A |0B - |0A |1B for 0
= |+A |-B - |-A |+B for 1

Mysterious Connection
Between QM & Relativity
Weinberg: Can QM be nonlinear?
Experiments: Not so positive result.
Polchinski, Gisin:
If QM is nonlinear,
communication faster than light is
possible.

Communication Faster Than Light

when unknown quantum state can be copied.
Alice wants to send Bob 1.
Alice mesures her qubit in {|+>,|->}.
Alices state will become |+> or |->.
Bobs state will become |-> or |+>.
Lets assume it is |+>.
Bob makes many copies of this.
He measures them in {|+>, |->}, and gets 100% |+>.
He measures them in {|0>, |1>}, and gets 50% |0> and
50% |1>.
Thus Bob can conclude that Alice measured her state in
{|+>, |->}.

Irreversability of
Quantum Measurement
If you describe it as that, that is not it anymore --

|= a|0 + b|1 = c|0' + d|1'

Measure in {|0,

|1} |0 or |1

Measure in {|0',

|1'} |0' or |1'

Quantum Cryptography

BB84: 4 Polarizations

Quantum Key Distribution

BB84, B92, E91
No Cloning & Irreversability of Quantum Measurement
EVE (eavesdropper)
Alice

Bob
Single Photon, Ent., Coh.

1. Interconvertibility between stationary and flying qubits.

Laser

0o,90o 0o,45o

0o,45o

PC1

PC2

PC3

A1

A2

D1
PBS

D0

Alice
A1 =
A2 =
P =

Bob
B
D

0 1 1 0 0 1 0 0 0 0 1 1

2. Faithful transmission of flying qubits.

DiVincenzo, Qu-Ph/0002077

=
=

0 1 0 0 0 1 0 0 0 0 1 1
1
1 1 1
1 1

BB84 full implementation

Authenticated Public Discussion

Mesurement in
random basis

Same
basis?

No

Yes

Transmission of
raw data:
Random coding
on single photons

Initial Authentication
NEEDED

Null result
or different
basis

Check random
sample

Discard

No
Stop

Error < Q%
Yes
Reconciliation
of bit strings
Parity check
n bits
Secret
key s bits

Estimate information
leakage
k bits
Privacy
Amplification
Keep the parities

Worlds first QKD (1989): Bennett(IBM) et al.

32 cm in free space with 4 polarizations

QKD via QE
Alice

Quantum Key Distribution

over 67 km with a plug&play system
Gisin, Zbinden, QP/0203118

Ekert 91

Bob

- Measurement of same polarization: Anticorrelation

- Measurement of different polarization :
Bells Inequality to check the eavesdropping

Practical free-space quantum key

distribution over 10 km
in daylight and at night
30km

45km

Richard J. Hughes, Jane E. Nordholt, Derek Derkacs

and Charles G. Peterson QP/0206092

http://www.eqcspot.org/
Autumn 2001: 23.4km Qinetiq-MPQ joint free space key
exchange trial between Zugspitze and Karwendel
Autumn 2000: Key exchange over 1.9km
between Qinetiq site and the local pub!

Rarity

144 km free-space, Zeilinger (2007)

AQIS 2008 hosted by KIAS

KIAS-ETRI, December 2005.

25 km Quantum Cryptography

Deutsch Algorithm

Global property of f

Quantum Fourier Transform

Molding a Quantum State

|0
| |0
|0

~n2=(log2N)2 vs N log2N
***can be used only as a subroutine, used for factoring

X
H

X1H2CX13|

t
Molding

M
M
M

Sculpturing a Quantum State

- Cluster State Quantum Computing |+

|+

|+

|+

|+

|+

|+

|+

|+

|+

|+

|+

|+
|+

|+
|+

|+
|+

|+
|+

|+
|+

Entanglement
EPR & Nonlocality
Alice

1
1
2

|+
|+

1.

Initialize each qubit in |+ state.

2.

Contolled-Phase between the neighboring qubits.

3.

Single qubit manipulations and single qubit measurements only [Sculpturing].

No two qubit operations!

Bob

Local Hidden Variable Bells Inequality

Aspects Experiment Quantum Mechanics is nonlocal!

GHZ State:

1
2

(0 A

+ 1

Entanglement
Alice
x

Quantum correlation

Classical physics: x and y are decided when picked up.

Bob
y

0 A1B or 1A0 B

Quantum physics: x and y are decided when measured.

{0,1} basis 0 or 1
1
1A 0 B 0
=
{+,-} basis + or -

Bells inequality, CHSH inequality (Classical)

Violation of inequality (Quantum)

1 B)
(
A
2
1
=
( + A B A + B)
2
1
+ =
( 0 + 1 ), = 1 ( 0 1
2
2

Charles Bennetts analogy

Entanglement and Two-Qubit Gate

I dont know what I think.

You dont know what you think.
But we know what we think.
- Hippies

a |0 + b |1
a |0|0 + b |1|1
|0
a |0 + b |1
a |0|0|0 + b |1|1|1

|0
|0

Classical Teleportation?
Alice

Quantum Teleportation

Bob

Transportation

1 bit

X am

b m1 X

Continuous movement through space

1 bit
P

Correlated Pair

1 bit

1 bit

X = 0 or 1
1 bit

x a b 1


{0,1}

Quantum Teleportation

= x 11
=x

B1, B2
X

B
X

Bennett et al.

Quantum Teleportation
Transmit an unknown qubit
without sending the qubit

Alice

2 Bits

Classical Information

Bell State Measurement

,

Bob

Unitary Transform
I , Z , X , Y

Entangled
Pair

1
unknown

= 0 + 1

= 0 + 1

EPR-Source

= 17.51798...

= 17.51798...

0 0
3 3

1 1

2 2

0
1

= 17.51798...

= 17.51798...

Bell Measurement
0

0
3

Leave it as
it is.

0
1

X A

= 17.51798...

= 17.51798...

Bell Measurement
1
Rotate it
by -90o.

X A

X A

Quantum Teleportation

Single Particle Entanglement

H = t c1+ c 2 + c 2+ c1

Single Electron

Single Photon

1
=
(1 + 2 )
2
1
or =
( f1e 2 + e1f 2 )
2

Beam Splitter

1
(1 0 + 0 1
2

using Single Particle Entanglement

Lee, JK, Qu-ph/0007106;
Phys. Rev. A 63, 012305 (2001)

PRL88,070402 (2002) or QP/0204158

"Active" Teleportation of a Quantum Bit

Quantum Teleportation of
Single Particle Entanglement

S. Giacomini, F. Sciarrino, E. Lombardi and F. De Martini

Lee, Qu-ph/0104097;
Phys. Rev. A 64, 014302 (2001)

Quantum Superdense Coding

Quantum Superdense Coding

Transmit two bits by sending one qubit

Alice

Bob

1 qubit

XcAB
HA

I , X ,Y , Z

2 bit

0A

0
IA : 0 0 + 1 1
0 0 + 1 0 =( 0 + 1 ) 0

X : 1 0 + 0 1
1 1 + 0 1 = (1 + 0 ) 1
A

0
0 B + 1 A 1 B
XcAB :
HA :
YA : 1 0 0 1
1 1 0 1 = (1 0 ) 1
1
ZA : 0 0 1 1
0 0 1 0 = ( 0 1 ) 0
1

Entanglement
A

B
EPR

Bobs
manipulation

Alices
manipulation

Alice sends
the qubit to Bob
1 qubit

4 states
differentiated
2 bit

0
1
1
0

Tripartite Qubit Entanglement

Z -basis: 0 with 1, 1 with + 1

Not expectation values

X -basis: a 0 + 1 with 1, b 0 1 with + 1

Bipartite Qubit Entanglement

Not expectation values

0 a+b , 1 a b
Y -basis: c 0 +i 1 with 1, d 0 i 1 with + 1
0 c + d , 1 i ( c b

{ 000 + 111 } : Z-basis

2
(a + b)(a + b)(a + b) + (a b)(a b)(a b)
aaa + abb + bab + bba : xxx = 1

GHZ =

= a 00 + b 01 + c 10 + d 11 with a + b + c = 1
N
2

=0

00 = 0 = a B 0 0
00 = 0 = a A 0 0
p = 00

=a

B
A

+ b B 0 1
+ c A 0 1

=
A 0 0
B 0 0
 A
 B

= pA

= pB

p A pB (1 p A )(1 pB )
1 p A pB

Maximize p !

(a + b)(c + d )(c + d ) (a b)(c d )(c d )

acd + adc + bcc + bdd

: xyy = +1

xxx = 1
xyy = +1
yxy = +1

(x y ) (x y ) (x y )
2

=1

p
p
=
= 0 1 2 p A + p A 2 pB = 1 2 p A + p A 2 p B = 0
p A pB

counterfactual argument

5 1
1 5
p A = pB =
= g : golden mean
2
2
p= g 9 %

p A = pB = 1,
5

yyx = +1

1
2

(3

+ 4

LR = =

3 3
R
4

Zurek, QP/0306072

3

 4
1

2 12

12 12

Parametric Down Conversion

: Splitting a photon into two

LR

=
2

=
2

Delayed Choice Quantum Erasure

REVISITED

Kim et al., PRL84, 1(2000); C.K.Hong and T.G.Noh, JOSA B15, 1192(1998)

(3
2
=

+ 4

3 3
R
4

C K Hong and T Noh (1998)

Y-H Kim and Y Shi (2000)

(3

+ 4

L 1 R 2 L 4 R
1

2L
3 L 2

L
L
3 + i L
= UL UL+ = L + i
LR
4 R
+
+
h.c.

2
2
2
2
2

2
2

LR =

D3

BSA

D1
D2

BS
BSB
1
i

2
2

i
1

2
2

0
i

3 3
R

4 L4

D4

UL =

2
0

2
i
1
2
2

1
0
2

1
0
2

D0
4

R D1 =

1 UL UL+ 1 L

1
{ 3 R + i 4 R }{ R 3 i
8
3

4

i
8
3
8

i
1
4

8
8

D3

2
BSA

3 3
R
3L

D1
D2

4 L4

BS
BSB

2 UL UL+ 2

1
= {i 3 R 4 R }{i
8
3

4
1
i
3
8
8
=

4
i 8 1 8

R D3 =

3 R 4

3 UL UL+ 3

D3

D2

D3

1
4
4

3 3
R
D0
4

D0

D2

0 0

4 =
0 1
4

(3
2
=

LR

+ 4

BSA
3

3 3
R

4 L4

BS
BSB

D4

R R

R (D1+D2+D3+D4)

D0
4

1
1 1 0

3R R 3 + 4R R 4}=
{
2
2 0 1
1

0 0 0 2 0
4 0 1
4
+

=
+
=
0 1 0 0 0 1 0 1
4

4
2

R = trL LR =
4 UL UL+ 4

4 L4

BS

D1

3 3
R
3L

BSB

D1

Environment
Decoherence

1
0
3 = 4

0 0

R R

D4
R D4 =

BSA

1
i 1
i 1
0
8
8 8
8
4

R (D1+D2) =
+
=
i
1 i
1 0 1
8
8 8
8
4

BS

D4

BSA

D1

D3

BSB

1
3
4

D2

D0

D4
R D2 =

Entanglement and Decoherence

1. Quantum Repeater
~100 km Indefinite distance

Zurek

B or Environment
A

Briegel, Durr, Cirac, and Zoller, quant-ph/9803056

Transmission: Photon
Storage, Processing: Atomic Physics, etc.

When system A is entangled with environment,

state of A cannot be described by a state vector,
but by a density matrix.

|AB = a |0A |0B + b |1A |1B = |A |B

A = TrB AB = TrB |AB AB| =

= |A A |

Quantum Repeater

|a|2 0

& Entanglement
Purification

ab*

2. Multiuser Quantum Network

1:1 multiusers

0 |b|2

Phoenix, Barnett, Townsend, and Blow, JMO 42, 1155 (1995)

ba*

Biham, Huttner, and Mor, Phys. Rev. A 54, 2651 (1996)

Optical Imaging by
Two-Photon Entanglement
Shih et al., PRA52, R3429 (1995).

no

yes

yes
no

Quantum Lithography

Quantum Interferometric Optical Lithography: Exploiting

Entanglement to Beat the Diffraction Limit

Agedi N. Boto,1 Pieter Kok,2 Daniel S. Abrams,1 Samuel L. Braunstein,2

Colin P. Williams,1 and Jonathan P. Dowling1,* PRL85, 2733 (2000)

Two-Photon Diffraction and Quantum Lithography

Milena DAngelo, Maria V. Chekhova,* and Yanhua Shih PRL87, 13602 (2001)

Quantum Metrology

We are applying our understanding of the quantum nature

of entangled-photon pairs for the characterization of
optical-detector quantum efficiency, source radiation
density, and photonic-material characteristics, all without
the necessity of employing a reference. The use of this
unique light source provides particular advantages over
the classical counterparts that are traditionally used.
Another example is provided by a technique we call
quantum ellipsometry. The high accuracy required in
traditional ellipsometric measurements necessitates the
absolute calibration of both the source and the detector.
These requirements can be circumvented by using
spontaneous parametric down-conversion in conjunction
with a novel polarization interferometer and coincidencecounting detection scheme.

Entangled-photon ellipsometry

A. F. Abouraddy, K. C. Toussaint, Jr., A. V. Sergienko, B.

E. A. Saleh, and M. C. Teich
J. Opt. Soc. Am. B. 19, 656-662 (2002). [PDF]

Ellipsometric measurements by use of photon

pairs generated by spontaneous parametric
downconversion

Ayman F. Abouraddy, Kimani C. Toussaint, Jr., Alexander V.

Sergienko, Bahaa E. A. Saleh, and Malvin C. Teich
Opt. Lett. 26, 1717-1719 (2001). [PDF]

Quantum
Physics

Quantum Parallelism
Quantum computing is

Information
Science
Quantum
Information
Science

exponentially larger and faster than digital computing.

Quantum Fourier Transform, Quantum Database Search,
Quantum Many-Body Simulation (Nanotechnology)

No Clonability of Quantum Information,

Irrevesability of Quantum Measurement
Quantum Cryptography (Absolutely secure digital communication)
Quantum Correlation by Quantum Entanglement
Quantum Teleportation, Quantum Superdense Coding,
Quantum Cryptography, Quantum Imaging