양자정보

-
Photonic Quantum Computing

2017 2 13-14

: 2017 2 13-14
: 6
: 13 Free discussion and welcome dinner

14 Full program
:
()
(KIST)
(2 14)

08:50 ~ 09:00 Opening ()
09:00 ~ 09:45 From quantum physics to quantum computing (KIAS)
09:45 ~ 10:30 Applications of a quantum computer (KIAS)
10:30 ~ 10:55 Break
10:55 ~ 11:40 Linear optical quantum computing ()
11:40 ~ 12:25 Technology overview on photonic quantum computing (KIST)
12:25 ~ 13:30 Lunch
Single and entangled photons via

13:30 ~ 14:15 (KRISS)
spontaneous parametric down conversion
14:15 ~ 15:00 Single and entangled photons via artificial and natural atoms (KIST)
15:00 ~ 15:25 Break
15:25 ~ 16:10 Integrated photonics quantum circuits (POSTECH)
16:10 ~ 16:55 Photonic quantum memories ()
16:55 ~ 17:40 Single-photon detection technologies (KRISS)
17:40 ~ 17:50 Closing (KIAS)

From quantum physics
to quantum computing
(KIAS)
1
Quantum beyond Nano
- The ULTIMATE Technology -
Jaewan Kim (Jaewan@kias.re.kr)

Korea Institute for Advanced Study
2012 Nobel physics prize
Haroche Wineland
Manipulate and measure single quantum systems
Contribution to Quantum Information Science
Atom and Phton in Cavity, Haroche
Laser light and trapped ion, Wineland
Before Quantum(before 1900)
Everything that can be invented has been invented!
Charles Duell, United States Commissioner of Patents
: misquoted!
Industrial Revolution, light bulb, wireless communication, movie, etc.
Newtons classical physics; Laplaces deterministic worldview
Maxwells Electromagnetism: speed of light/electromagnetic
waves
1900, Planck discovered quantum physics
Blackbody Radiation
As it gets hotter, the color shifts from red to blue to white.
(long wavelength/low frequency) (short wavelength/high frequency)
intensity 550 nm, 545 THz
frequency
Energy Quantum
Probability Energy
density
Energy
/
/

Integration
Probability
frequency
Plancks quantum hypothesis:
Energy
( 0, integer, )
Energy
density
/
/ / /

Sum of geometric progression
Physical quantity is not continuous but discretized Quantum frequency
Quantum Physics
The ULTIMATE Principle of Nature
The ULTIMATE Technology
Alchemy Chemistry
Life phenomena: DNA, Seeing, Smelling,

Tasting, Photo systhesis, etc.
Semiconducton Devices, Lasers

IT Revolution of 20th Century
Atom bonds Molecule
Energy Levels Energy Bands
Insulator
conduction band
Forbidden band
valence band
Forbidden band
Conductor
Electrons are freely wandering around

Semiconductor
With slight help, electrons can be promoted to this band

and wander around.
Laser
Light Amplification by Stimulated Emission of Radiation
Transistor
As a faucet controls the water flow, tiny control of transistor changes the
electric current enormously Amplification of electric current
anode
John Bardeen Walter Brattain
collector
grid
- base
-
- emitter
-
cathode
William Shockley
Dec. 16, 1947, Bell Lab
filament COPYRIGHT 2008 by Jack Ward. All Rights Reserved. http://www.transistormuseum.com/
Joe Knight Early Power Transistor History BTL/WESTERN ELECTRIC
Transistor
Triode
Information and Communication Technology
of 20th Century
Hardware based on Quantum Physics,
semiconductor devices, lasers
Software/Operating System Mathematics and Information Theory

by Von Neumann, Turing, Shannon, and so on.
Nanotechnology
1 nm(nano meter)=10-9m
C-C bond length = 0.12~0.15 nm
Moores Law
Number of transistors in a chip quadruples in three years. (doubles in 1.5 years)
Size of transistor: cm nm ?
kB MB GB TB PB EB ZB YB ?
Limit of Nanotechnology Quantum Information Science
Spatial distance goes below nm

microscopic world governed by quantum physics
quantum uncertainty principle
ambiguity between 0 and 1 (bits)
fatal to digital information
the end of Moores law, the limit of Nanotechnology
Instead of passive effort to avoid quantum uncertainty
Active/positive/constructive attitude to utilize quantum phenomena
Quantum Information Science
Digital Information Quantum Information
Bit Quantum bit = Qubit
0 or 1, just one of them. Quantum superposition of 0 and 1
With four bits, at the same moment
0000, 0001, 0010, 0011, Fuzzy Logic
0100, 0101, 0110, 0111, With four qubits,
1000, 1001, 1010, 1011,
1100, 1101, 1110, 1111
Among 16=24 cases,

ONE AT A TIME
All 16=24 cases are present at the same time.

Digital Computer
N bits N bits N bits
Quantum computer
N
N qubits N qubits N bits
Computational Space is blown up

EXPONENTIALLY
Digital Computer vs. Quantum Computer
Hardware: Quantum Physics Hardware: Quantum Physics
Software/OS: Software/OS: Quantum Physics
Digital Information Theory of Bits
/
Factoring large integers: Factoring large integers : IT
Data Search: Data Search : BT, IT
Quantum manybody problem: Quantum manybody problem : NT, IT

superposition |1
|+
|0
|0 +|1 0 + 1 0 + 1 0 + 1
= |0000 + |0001 + |0010 + |0011
+|0100 + |0101 + |0110 + |0111
8 +|1000 + |1001 + |1010 + |1011
+|1100 + |1101 + |1110 + |1111
Measuring Polarization
Intense light of
Half and half
calcite, birefringent=double refraction
half and half
Single photon
Only one polarization, not half and half
| |
single photon
only one
probablistically
|
Measurement of a qubit state
qubit:
representable as a superposition of two exclusive state
[photon, electron, atom, superconducting circuit, etc.
quantization: m results in only.
measurement of | in |+ , | results in | + | only.
consistency m results in only.

measurement of |+ in , | results in | + only.
quantum states before and after mesurement could be different
Collapse of quantum state by measurement
uncertainty: Measurement of results in

50% , 50%
Measurement of | + | in different basis |0 , |1 results in 50% |0 , 50%, |1
Certainty in
Security vs. Quantum Physics:
Disease and Medicine
Difficult Problems for Security
No proof for difficultness
Could be easy for quantum computation Quantum physics, the Disease
One time pad provides absolute security
if it could be distributed securely.
Quantum Key Distribution Quantum physics, the Medicine
Reveal: bases of sender and receiver; Keep secret: measured bits
Same bases perfectly same bits measured one time pad
Different bases completely uncertain bits measured discard
Eavesdropping 50% chance of different bits even for the same bases EVE caught
Worlds first QKD (1989): Charles Bennett (IBM) et al.
32cm wireless, 4 polarizations (H, V, 45deg, 135deg)
KIAS-ETRI, Dec. 2005,
25 km QKD
quantum entanglement
Schroedingers cat
+
Qubit Entanglement
Result of each measurement is entirely random.

BUT the measurement results of A and B are correlated.
This cannot be used for sending signal or information. (random results)
NO contradiction to Einsteins special theory of relativity
Quantum Teleportation
= |0 + |1
Quantum Teleportation
= |0 + |1
Sending an unknown qubit state by two bits

Bell measurement
NOT copying Original state is destroyed by Bell measurement

CANNOT be faster than light Two bits must be delivered to reconstruct the original state
Quantum beyond Nano
Quantum physics: The ULTIMATE Principle of Nature
The ULTIMATE Technology
ICT of 20th Century ICT of 20th Century
Hardwares Software/Operating System
Nanotechnology
(smaller, even smaller) Quantum Information
Limit Physics Theory
Quantum
Information ICT of 21 Century
st
QKD, Q Computer,
Quantum Teleportation, Hardware/Software/OS
Science Based on principles of Quantum Physics
Quantum Metrology, etc.
Applications of
a quantum computer
(KIAS)
2
@ OSK- KIAS Quantum Information Winter School
Applications of
a quantum computer
Seung-Woo Lee (swleego@kias.re.kr)

Quantum Universe Center, KIAS
1. Why we do Quantum Information ?
2. Towards Quantum Supremacy
3. Quantum Hardwares
4. Errors and Scalability
5. Summary
We have learned in school:
The macroscopic world is classical

The microscopic world is quantum
Classical
Quantum
e-commerce
Cryptography Carrier 11:40 AM
Storage
Seung-Woo Lee
http://www.apctp.org quantum
Hardware
Broadcasting
Computation We are living in the
world of information Software
technologies.
Entertainment
Communication
Information is physical !
Information is stored in a physical medium and

manipulated by physical processes.
Therefore the laws of physics dictate the capabilities and
limitations of any information processor. The classical laws of
Rolf Landauer (1927-1999) physics are (usually) a good approximation to the laws of physics.
Quantum realm
In 2020,
Atomic size for a single bit of
information.
At this point quantum effects will
become unavoidably dominant.
Moores law
The number of transistors placed on a single integrated circuit
chip doubles approximately every 18 - 24 months.
Gordon Moore (1965)
In quantum realm
Fundamental
quantum theories
Meso/Nanoscopic
Quantum Optics ? Sciences
Information theory
Quantum devices but

Still bit ?
Quantum switches which substitute the silicon-based transistors

to execute the classical algorithm based on Boolean logic.
In quantum realm
Fundamental
quantum theories
Quantum Optics
New challenge ! Meso/Nanoscopic
Sciences
Information theory
A logic of information processing by

exploiting the laws of quantum mechanics !
Quantum information processing
Basic unit : Qubit (Quantum Bit).
A qubit is modeled by a vector in a

two dimensional Hilbert space.
Qubits
| i = a|0i + b|1i
from
microscopic macroscopic
Quantum Classical
simple highly complex

microscopic macroscopic
Quantum Classical
simple highly complex

Exploring fundamental quantum theories
Information Quantum
theory
Physics
Mathematics
Computer Science
Application to quantum information processing

Applications to quantum information processing
Nobel Prize 2012

The Nobel Prize in Physics 2012 was awarded jointly to
Serge Haroche and David J. Wineland "for ground-
breaking experimental methods that enable measuring
and manipulation of individual quantum systems"
large-scale quantum systems

Physical realization of qubits:
which candidate would be the best ?
Single photons (polarization, number, time-bin),

Coherent state of light, Electron(spin, number)
NMR, Trapped ion/atoms, Quantum dot,
Superconducting qubits (charge, flux, phase)
Pros Cons
Applications to quantum information processing
Quantum metrology/sensing Quantum Hardwares

High resolution measurement beating fundamental (computer/simulators)
limits - standard quantum limit(SQL), Heisenberg limit.
Detection of gravitational radiation LIGO
Quantum communications
Quantum teleportation. Dense coding,

Information transfer in a network,
Quantum key distribution (QKD)
Quantum algorithms
Quantum cryptography
Quantum key distribution (QKD), Secret
Shor, Deutsch-Jozsa algorithm,
sharing, Quantum commitment
Simon algorithm, Grover search
5. Summary
Church-Turing Thesis
Alan Turing Alonzo Church Turing Machine

(1912-1954) (1903-1995)
Church-Turing Thesis
Any algorithm can be performed on any piece of hardwares, there
is a equivalent algorithm for Universal Turing Machine.
Physical Church-Turing Thesis (invalidated by randomized algorithms)
Any physically computable function (algorithmic process) can be
simulated efficiently using a (deterministic) Universal Turing Machine.
Extended Church-Turing Thesis
Any algorithmic process can be simulated efficiently using a
probabilistic Universal Turing Machine. BPP
1981 at a conference on physics and computation at MIT
Can we simulate physics on a computer?
- not exactly, not all of physics.

Richard P. Feynman
(1918-1988) Quantum mechanics, which studies the laws
of nature on the scale of individual atoms and
A device based on quantum logic particles. The full description of quantum physics has
would be ideal for simulating
quantum-mechanical systems.
so many variables that we cannot keep track of all of
them on a computer.
If we cannot simulate quantum physics on a computer,

maybe we can build a quantum mechanical computer,
which would be better than the ordinary computers?
Quantum Turing Machine
is first proposed in a 1985 article
David Deutsch
(1953-)
Any quantum algorithm can be expressed formally as a

particular quantum Turing machine.
BQP
Quantum gates could function in a similar fashion to

traditional digital computing binary logic gates
bits qubits
can be described using can only be described using
numbers (0 or 1) << complex numbers

exponentially more information
Exponential number of classical bits would be needed to store the quantum

state of qubits.
Quantum
Conventional classical
(super)computers Supremacy ?
J. Preskill 2012
to perform tasks surpassing

what can be done by classical
(super)computer
- to run an algorithm on a quantum

computer which solve a problem with a
super-polynomial speed up relative to
classical computers.
- to perform a well defined computational
task beyond the capabilities of state-of-the-
[from wikipedia]
art classical supercomputers (Not
necessarily solving a practical problem)
a. Universal quantum computer approach
- to run an algorithm on a quantum computer which solve a
problem with a super-polynomial speed up relative to classical
computers.
algorithm Universal gate

operations
Solve a problem !
Quantum Turing Machine

Quantum Parallelism
- a fundamental feature of many quantum algorithms
- evaluate a function f(x) for many different values of x simultaneously
[from http://olaqui.df.unipi.it/beginners.html]
[from http://www-mobile.ecs.soton.ac.uk/newcomms/?q=res/int/quantum]
Deutsch(-Jozsa) algorithm (D. Deutsch1992)
Problem ?
Measure
Whether a function
F is either constant
or balanced ?
F(0) = F(1)
or not ?
using one evaluation f(x)

Quantum Fourier Transformation
where
- unitary operation
- QFT for N=2 is the Hadamard transform
- QFT for 3 qubits

Shor algorithm (Peter Shor 1994)
Factoring problem ?
N=P*Q e.g. 143 = 11 * 13
For given N, P and Q ?

- Computationally secure
- Almost exponentially complex
with the number of digits, L
- RSA129 (1977): factored 17

years later using 1,600 computers
( )
(in polynomials time )
Grover algorithm (L. Grover1996)
Problem ?
searching an
unsorted database
with N entries
Quadratic speed up than

classical
b. Non-universal approach
- to perform a well-defined computational task with a quantum device
beyond the capabilities of state-of-the-art classical
(super)computers (Not necessarily solving a practical problem)
Quantum Simulator
- simulation of a real quantum physical system
I. M. Georgescu, RMP 86, 153 (2014)

Demonstration of quantum supremacy
One-Clear-Qubit model - Knill and Laflamme (1998)
BosonSampling
Commuting Quantum Circuits
- Aaronson and Arkhipov.(2011)
- M. Bremner et al.(2011)
[from J. Preskill, arXiv:1203.5813(2012)]

Computational complexity
PSPACE
(polynomial amount of space)
QMA
NP
(MA)
P (decision problems)
BQP (BPP)
Local Hamiltonian
Problem
in lattice model of qubits
[Kempe, Kitaev, and Regev, ,
2006]
factoring
[P. Shor,1994]
Sampling BQP (Bounded error, Quantum, Polynomial time)

Some oracle relation problems
[S. Aaronson,2009]
QMA (Quantum Merlin Arthur)
(Boson Sampling)
[Aaronson and Arkhipov, 2011]
5. Summary
Three types of Quantum Hardwares
[from IBM Research]
1.
[from wikipedia]
Three types of Quantum Hardwares
[from IBM Research]
2.
(Quantum Simulators)
[from Science 339, 798 (2013)]
[from RMP 86, 153 (2014)]
[from Nature News&Views 534, p480(2016),

Nature, 554, 516-519(2016)]
[from RMP 86, 153 (2014)]
3. [from IBM Research]
Different Models
Standard (Circuit-based) One-way (measurement based)
Adiabatic quantum computation Topological quantum computation
[from wikipedia]
Different Systems
from
from
[S. Boxio et al., arXiv:1608.00263(2016)]
5. Summary
Errors in Quantum Computation
- Coherent quantum errors: Gates

which are incorrectly applied
Environment Operation
- Environmental decoherence
Open Quantum System
How to protect open quantum systems?
1. Open Loop Control vs Closed Loop Control
System
System Processing System
Controller
Open Loop Closed Loop

- pulse train design, pulse shaping - real-time continuous feedback control
- learning control - measurement conditioned evolution
- system output not continuously - adaptive measurement: optimized information
obtained from measurement
monitored
- for low systems/measurements - coherent feedback for dynamical control
- need fast measurements
2. Active vs Passive ways for protecting qubits
Passive Active
Quantum Error Correction(QEC),
Dynamical
Decoherence Free Subspace (DFS) or
Decoupling (DD)
Noisless Subsytem(NS)
Quantum Error Correction
9 Qubit Code (P. Shor 95)
Correct bit flip error
- correct bit and phase flip errors
Stabilizer Formalism (D. Gottesman 97)

is stabilized by
7 Qubit Steane Code
Recent Developments
Topological codes
(Surface codes)
- defined over a 2-dim
lattice of qubits
[arXiv:0905.2794]
Dynamic Decoupling
Open Loop Control for protecting qubits from noises
Dynamic Decoupling - Viola/Lloyd `99
Model system : Single qubit dephased by bosonic bath
Control action : Train of identical pulses `bang-bang
Decoherence Suppression
[from Nature 458, 996-1000 (2009)]
Avoiding the need of quantum measurements and encoding overhead which makes them considerably
less resource-intensive and practically attractive for a large class of devices
Advanced DD schemes A practical long-time quantum memory

K.Khodjasteh et al. Nature Comm.(2013).
- DD for multiqubit systems
- Higher order DD scheme (Concatenated DD, UDD)
- Filter function approach

- Dynamically corrected gates
- High fidelity and long storage times with plateau of errors
- Realistic applications and small access latency for arbitrary single qubit
Scalability
Fault-tolerance
- Concatenation and Threshold theorem
in level g
C(k)..: each qubit in
C(k-1) is encoded and corrected
becomes arbitrarily small if
single error
correction code
C0: original circuit
- Fault-tolerance threshold
Resource-overhead
- Preparation of the encoded quantum states for qubits = resources
- The cost of resource for one-round of error correction ?
- The overall cost of resources for fault-tolerant quantum computation ?

how much $ ?
5. Summary
- to understand fundamental quantum properties and use them for
future information technologies

- universal quantum computation approach/non-universal approach
- quantum supremacy is real? real!
- developing useful algorithms (super-polynomial speed up!)
- Three types of quantum hardwares(Annealer, Simulator, Computer)
- Optimization/Simulation/Full computation
- Demonstrating quantum supremacy(with near term device)

- Quantum coherence is fragile/Open quantum systems
- Protecting quantum systems (qubits) by QEC, DD etc.
- Toward fault-tolerant and scalable quantum computation (FT
threshold and resource overhead)
Linear optical quantum
computing
()
3
Linear Optical Quantum Computing (LOQC)
QIT at HYU ERICA

web: qit.hanyang.ac.kr
Brief Introduction to Quantum Computation
What is quantum computation?
Physical models for quantum computation
Elementary Gates
What should we do to realise a quantum computer
Linear Optics Interface

Qubits in LOQC
Gates in LOQC
Elementary Gates
What should we do to realise a quantum computer?

Qubits in LOQC
Gates in LOQC
from Wikipedia : Quantum Computing
Quantum computing studies theoretical computation systems (quantum computers) that make
direct use of quantum-mechanical phenomena, such as superposition and entanglement, to
perform operations on data.
Quantum computers are different from binary digital electronic computers based on
transistors. Whereas common digital computing requires that the data be encoded into binary
digits (bits), each of which is always in one of two definite states (0 or 1), quantum
computation uses quantum bits, which can be in superpositions of states.
A quantum Turing machine is a theoretical model of such a computer, and is also known as
the universal quantum computer. The field of quantum computing was initiated by the work of
Paul Benioff and Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985.
Information Technologies Quantum Technologies
IT industry
Applied Math. Information Theory Quantum Information Theory

Computation Theory Quantum Computation Theory
1800 1900 2000
Electromagnetism Quantum Theory

Quantum mechanics (Wikipedia)
Quantum mechanics (QM; also known as quantum physics or quantum theory), including quantum
field theory, is a branch of physics which is the fundamental theory of nature at small scales and low
energies of atoms and subatomic particles.
Algorithm (Wikipedia)
In mathematics and computer science, an algorithm is a self-contained sequence of actions to be

performed. Algorithms perform calculation, data processing, and/or automated reasoning tasks.
An algorithm is an effective method that can be expressed within a finite amount of space and time
and in a well-defined formal language for calculating a function. Starting from an initial state and initial
input (perhaps empty), the instructions describe a computation that, when executed, proceeds
through a finite number of well-defined successive states, eventually producing output" and
terminating at a final ending state. The transition from one state to the next is not necessarily
deterministic; some algorithms, known as randomized algorithms, incorporate random input.
Formulation of quantum mechanics ~ axioms
- states
- dynamics
- measurement
Observables are only observed

Computational model
0 s1
0 s2
0 s3
Output
Input
0 sN
Computational model
0 gate s1
0 s2
0 s3
Output
Input
0 sN
Quantum computational model
Take-home message:
Quantum computation corresponds to realisation of a unitary transformation
0 s1
0 s2
0 s3
Output
Unitary transformation
Input
0 sN
Take-home message:
Quantum computation corresponds to a transformation from a quantum state (useless) to another
(meaningful, solution) via physical (unitary) transformation
U
| iinput 7! | ioutput
| ioutput
| iinput
Take-home message:
trivial state measurement
|0i |0i
s1 s2 sN solution!
N | ioutput
|0i
0 s1
0 s2
0 s3
Output
Unitary transformation
Input
0 sN
|0iN | ioutput A detector contains no complication
0
0
0
ex. a photon detector,

0
A general POVM measurement : Naimarks extension

complexity of algorithm
Mi =
U U
|0iN | ioutput
i) Superposition (D-J algorithm)
0
0
0
|0i|0i 7!
1
(|0i|0i + |0i|1i + |1i|0i + |1i|1i)
2
0
ii) Entanglement (Shor, Grover, Simon algorithms) iii) Hilbert space
|0i|0i 7! N
N ! H2
1
p (|0i|0i + |1i|1i) 6= | 1 i| 2 i N
dim(H2 ) = 2N
2
|0iN | ioutput
i) Superposition (D-J algorithm)
0
0
0
|0i|0i 7!
1
(|0i|0i + |0i|1i + |1i|0i + |1i|1i)
2
0
What makes the speedup? Not clear yet.
ii) Entanglement (Shor, Grover, Simon algorithms) iii) Hilbert space
|0i|0i 7! N
N ! H2
1
p (|0i|0i + |1i|1i) 6= | 1 i| 2 i N
dim(H2 ) = 2N
2
Remark. Quantum simulation (Vidal,Verstraete, Cirac)

Quantum computation performs a unitary transformation
Shor algorithm : abelian subgroup problem / efficient Fourier transformation
O(N log N )
p
Grover algorithm : amplitude amplification O( N )
1
p (|1i + + |ti + + |N i) ! 1 |1i + + (1 )|ti + + N |N i)
N
Take-home message:
U
| ioutput
| iinput
Physical models of quantum computation |0iN | ioutput
0
Quantum Circuit Computation 0
0
Adiabatic Quantum Computation (Farhi, Gutmann)

Z 0
U = exp[ i dtH(t)]
H = (1 s(t))Hin + s(t)Hfinal
Topological Quantum Computation (Kitaev)
Linear Optical Quantum Computer (Knill, Laflamme, Milburn)
Measurement-based quantum computer (Briegel, Raussendorf)

Physical models of quantum computation
Measurement-based quantum computation
0 s1
0 s2
0 s3
input
0 sN
output
algorithm: measurement
Theorem. The followings are equivalent to a quantum circuit model.
Topological Quantum Computation
Linear Optical Quantum Computer
Adiabatic Quantum Computation
Measurement-Based Quantum Computation

Elementary Gates

Qubits in LOQC
Gates in LOQC
Topological Quantum Computation
Linear Optical Quantum Computer
Adiabatic Quantum Computation
Measurement-Based Quantum Computation

Elementary gates
Proof. A computational model can perform elementary set of gates.
Theorem. (Solovay-Kitaev)
A unitary transformation can be approximated by a sequence of elementary
gates, single-qubit gates and the Controlled-Not (CNOT) gate
U
| ioutput
| iinput
Elementary gates
Single-qubit gates

1 1 1
Hadamard gate H H=p
2 1 1
1
|0i 7! p (|0i + |1i)
2
1
|1i 7! p (|0i |1i)
2
Elementary gates
Single-qubit gates

X-gate (NOT)
0 1
X X=
1 0

Y-gate 0 i
Y Y =
i 0

Z-gate (Phase) 1 0
Z Z=
0 1
Elementary gates
0 1
CNOT gate: entangling gate 1 0 0 0
B 0 1 0 0 C
Uc = B
@ 0
C
0 0 1 A
0 0 1 0
X =II+IX
|ai|bi ! |ai|a + bi
|0i H
|00i ! |00i
|0i X
|01i ! |01i
|10i ! |11i
1 1
p (|0i + |1i)|0i p (|00i + |11i)
|11i ! |10i 2 2
Elementary gates
A unitary transformation can be approximated by a sequence of elementary gates,
single-qubit gates and the Controlled-Not (CNOT) gate
Single-qubit gates and CNOT gate.

Elementary Gates

Qubits in LOQC
Gates in LOQC
Linear optics interface
A unitary transformation can be approximated by a sequence of elementary gates,
single-qubit gates and the Controlled-Not (CNOT) gate
Single-qubit gates and CNOT gate.
Single-qubit gates and CNOT gate in linear optics

DiVincenzos criteria
1. Scalable with well characterised qubits
2. The ability to initialise the state of the quits in a simple fiducial state
3. Long relevant decoherence time
4. A universal set of quantum gates
5. A qubit-specific measurement capability

Photon
A photon is an elementary particle, the quantum of the electromagnetic field including
electromagnetic radiation such as light, and the force carrier for the electromagnetic force
(even when static via virtual photons).
1 @2
Classical electromagnetic field r2 E(r, t) E(r, t) = 0
c @t2

Quantization [ai , aj ] = ij [ai , aj ] = [ai , aj ] =0

X 1
Number operator n= ak ak H= ~wk (ak ak + )
2
k

p
Creation operator a |ni = n + 1|n + 1i
p
Annihilation operator a|ni = n|n 1i

|1ij = aj |0i Unitary Transformation |1ik = bk |0i
|0i = |vaci |0i = |vaci

Linear optics: preservation of photon numbers

X
bk = Mkj aj
j
Linear optics: preservation of photon numbers

X
bk = Mkj aj
j
Linear optical component
Phase shifter U = e i a a U |ni = ein |ni
Beam splitter
b1 a1 cos ei sin
=U U=

b2
a2 e i sin sin

DiVincenzos criteria ; Photon
4. A universal set of quantum gates
Remark. Photons hardly interact each other.

DiVincenzos criteria ; Photon
4. A universal set of quantum gates : CNOT
Remark. Photons hardly interact each other.

Elementary gates
0 1
CNOT gate: entangling gate 1 0 0 0
B 0 1 0 0 C
Uc = B
@ 0
C
0 0 1 A
0 0 1 0
X =II+IX
|ai|bi ! |ai|a + bi
|0i H
|00i ! |00i
|0i X
|01i ! |01i
|10i ! |11i
1 1
p (|0i + |1i)|0i p (|00i + |11i)
|11i ! |10i 2 2
Elementary gates
CNOT gate: entangling gate

Elementary gates

Elementary gates

Elementary gates

The key idea of linear optical quantum computing is
i) to use the dual rail logic
ii) to exploit the dual picture of entanglement and channels,

(or, equivalently, measurement-based quantum computation)
The KLM scheme

Photon polarization
|Hi
|V i
Logical Qubit in LOQC (dual rail logic)
|0iL = |01i |1iL = |10i

|0iL = |01i |1iL = |10i
Converting pol. qubit to dual rail logic |Hi + |V i

PBS
PBS
|Hi ! |01i
V
|V i ! |10i
|01i ! |Hi H
PBS
|10i ! |V i
|0iL = |01i |1iL = |10i
Single-Qubit gates
with phase shifter with beam splitter
=0
RZ ( ) RY ( 2)
Two-qubit gates ~ measurement-based quantum computation
: S(HA0 ) ! S(HB )
Pd+A
(AB)
(A0 )
(A0 )
[ ]
A0 A B
+ (AB)
[] = dtrAA [PAA0 A0
0 ]
+ (AB) +
= dh |AA0 (A0 )| iAA0
: S(HA0 ) ! S(HB )
Pd+A
(AB)
(A0 )
(A0 )
[ ]
A0 A B
+ (AB)
[] = dtrAA [PAA0 A0
0 ]
+
Telelportation: = PAB

No interaction, but preparation of entangled states
pros and cons:
i) all linear optical
ii) preparation of entangled states, and detection of entanglement

: S(HA0 ) ! S(HB )
Pd+A
(AB)
(A0 )
(A0 )
[ ]
A0 A B
+ (AB)
[] = dtrAA [PAA0 A0
0 ]
+ (AB) +
= dh |AA0 (A0 )| iAA0
: S(HA0 ) ! S(HB )
Pd+A
(AB)
(A0 )
(A0 )
[ ]
A0 A B
+ (AB)
[] = dtrAA [PAA0 A0
0 ]
+ (AB) +
= dh |AA0 (A0 )| iAA0
: S(HA0 ) ! S(HB )
Pd+A
(AB)
(A0 )
(A0 )
[ ]
A0 A B
+ (AB)
[] = dtrAA [PAA0 A0
0 ]
+ (AB) +
= dh |AA0 (A0 )| iAA0
: S(HA0 ) ! S(HB )
Pd+A
(AB)
0 0
(A ) [(A ) ]
A0 A B
: S(HA0 ) ! S(HB )
Pd+A
(AB)
0 0
(A ) [(A ) ]
A0 A B
1 iL
|
| 1 iL
+
P
X Z
+ + +
P =| ih |
| 1 iL
+
P
X Z | 1 iL
+ + +
P =| ih |
dual rail logic

| 1 iL
+
P
X Z | 1 iL
+ + +
P =| ih |
|0iL = |01i |1iL = |10i
Converting pol. qubit to dual rail logic |Hi + |V i

PBS
|Hi ! |01i
|V i ! |10i
PBS |01i ! |Hi

|10i ! |V i
dual rail logic

| 1 iL
+
P
X Z | 1 iL
| iL
1
50 : 50
50 : 50
4
C
| iL
1
0 1
50 : 50
1 0
50 : 50
4
C
+ (AB)
[] = dtrAA0 [PAA 0 A 0 ]
+ +
id[| iL ] = 2trAA [PAA0 |
0 iL h | PAB ] = | iL
teleportation
dual rail logic
| 1 iL
+
P
The goal is to realize CNOT.

X Z | 1 iL
| 1 iL
+
P
X Z | 1 iL
X Z | 2 iL Z
P+
| 2 iL
=
Z H X H
| 1 iL
+
P
X Z
X Z Z
P+
| 2 iL
=
Z H X H
| 1 iL
+
P
X Z
X Z Z
+
P
| 2 iL
| 1 iL
+
P
X Z
Z Z X Z Z
+
P
| 2 iL
| 1 iL
+
P
X Z
Z Z X Z Z
+
P
| 2 iL
| 1 iL
+
P
X Z
Z Z X Z Z
+
P
| 2 iL
| 1 iL
+
P
X X Z
Z X Z X
+
P
| 2 iL
| 1 iL
Measurement
+
P Local operations
X X Z
State (Entangled)
Preparation
Z X Z X
+
P
| 2 iL
| 1 iL
Measurement
+
P Local operations
X X Z
State (Entangled)
Preparation
Z X Z X
+
P
Measurement
| 2 iL
|0iL = |01i |1iL = |10i
Single-Qubit gates
with phase shifter with beam splitter
=0
RZ ( ) RY ( 2)
| 1 iL
Measurement
+
P Local operations
X X Z
State (Entangled)
Preparation
Z X Z X
+
P
Measurement
| 2 iL
| 1 iL
Measurement
+
P Local operations
X X Z
State (Entangled)
Preparation
Z X Z X
+
P
Measurement
| 2 iL

| 1 iL
Measurement
+
P Local operations
X X Z
State (Entangled)
Preparation
Z X Z X
+
P
Measurement
| 2 iL
| 1 iL
Measurement

X
bk = Mkj aj
j
+
P Local operations
X X Z
State (Entangled)
Preparation
Z X Z X
+
P
Measurement
| 2 iL
Elementary Gates
What should we do to realise a quantum computer

Qubits in LOQC
Gates in LOQC
Take-home message: LOQC with entanglement as a computational resource
LOQC is constrained with the preservation of photon numbers

Reference for further details (specific schemes, error correction, etc.)
P. Kok et. al., Review of Modern Physics 79 135 (2007)

Technology overview on
photonic quantum computing
(KIST)
4
Technology overview on
photonic quantum computing
Kim, Yong-Su
Centre for Quantum Information, KIST, Korea
yong-su.kim@kist.re.kr
2017. 2. 14.
1
Talks at the winter school
Photon
preparation
Photon
operation
Photon measurement
2
Contents
1. Photonic quantum information processing
2.1. Qubit preparation
2.2. Qubit operation
2.3. Qubit measurement
2. Examples of experimental studies
3. Conclusion
3
Qubit implementation
Energy level Current flux
Qubit
Energy
Electron position
Any two-level quantum system

can be a qubit.
4
Di Vincenzos criteria
Quantum computation Networkability
Approach #1 #2 #3 #4 #5 #6 #7
Photon
Trapped ion
Neutral atom
Solid state
Superconducting
NMR
1. Scalability 2. Qubit initialization 3. Long decoherence time

4. Universal quantum gates 5. Qubit measurement
6. Inter-convertibility 7. Transmissivity
5
5
1. Photonic quantum
information processing
6
Contents
3. Conclusion
7
Single-photon state?
Single-photon state is a state that has only one photon
But what it really means?
ND filter
Energy
Single photon?
ND filter strength
8
A single-photon for a qubit resource
Making a single-photon state is not trivial.
2
Bunching
(thermal)
1
Random
(laser)

Anti-bunching
(single-photon)
0
0 1 2 3
9
How to make a single-photon state?

Isolated single quantum system
Atom Quantum dot Artificial atom
A lot of effort has been made with these topics.
10
Spontaneous parametric down-conversion

Heralded single-photon state generation
Two- or more photon pair generation
Phase matching condition

1. Momentum conservation
2. Energy conservation
11
10-photon entanglement generation with SPDC
PRL 2016
10 photon GHZ state generation
12
Photonic qubit state
Polarization qubit (E-field oscillation)
Time-bin qubit
13
Polarization state as a qubit
Bloch sphere Poincare sphere
14
High-dimensional quantum states
d-dimensional quantum states
Path qudit OAM qudit
BS
Qubit generationQubit Measurement

15
Contents
3. Conclusion
16
Polarization state as a qubit
Phase
retardation
Polarization
change
17
Polarization change due to phase readers
Wave plates change the polarization states
18
Single-qubit operation and wave plates
Single-qubit operations
Jones matrix
Any single-qubit operation can be implemented

with a set of HWP and QWP.
19
Two-qubit gate operation : CNOT
Input Output
Control
C T C T
0 0 0 0
Target 0 1 0 1
1 0 1 1
1 1 1 0
H
: Bell state
Single-qubit gates + C-Not gate Universal gates

20
CNOT implementation
Nonlinear optical C-NOT implementation

?
Control
Target
BS BS
Weak photon-photon interaction

Hard to achieve high nonlinearity
21
Linear optical quantum computing
Nature 2001
All optical CNOT gate implementation Nature Photon. 2014
Ancillary photons
C
Linear optics
T (BS, Waveplates, etc)
(Bad) Probabilistic implementation

(Good) Increasing the number of ancillary photons,
one can make a near-deterministic CNOT gate. (KLM)
22
CNOT with linear optics : examples
Probabilistic
implementation,
but increasing the
number of

ancillary photons,
Ps increases.
23
How to make a deterministic CNOT gate?
Teleportation based CNOT gate PNAS 2010
0. Want to implement CNOT

between 1-2
1. Prepare two qubit entangled states
of 3-4 and 5-6
2. CNOT operation between 4-6
3. BSM between 1-3 and 2-5
4. 4-6 will become the CNOT output of
1-2
Deterministic CNOT implementation problem becomes

deterministic Bell state measurement problem.
24
Deterministic Bell state measurement
Signal Ancilla
Number of BSM success
No.
ancillary photons probability
1 0 0.5
2 2 0.75
3 6 0.875
4 14 0.94
Signal Ancilla
5 25 30 0.97
LOQC architecture (KLM protocol)
Near-deterministic
BSM
Teleportation based
Ancillary CNOT
photons
Optical
switch
26
Contents
1. Introduction to quantum information science
4. Conclusion
27
Single-photon measurement

Avalanche photodiode
QE ~ 70 % (800 nm)
DC ~ 100 cps
Superconducting single-photon detector
QE ~ 90 %
DC ~ 10 cps
28
Polarization qubit measurement
Single-qubit state tomography
Q H Pol. SPD
Two-qubit state tomography
Q H Pol. SPD X
29
Bell state measurement
C-NOT as an entangler
: Bell state
Reverse operation : Bell state a product state
Therefore, implementing C-NOT operation provides

a mean to Bell state measurement.
30
Two-photon interference and Bell state measurement
Bell state measurement implementation with two-photon

interference

Quantum
memory
: {D1V, D1H} or {D2V, D2H}
D1V D2V
BS
: {D1V, D2H} or {D2V, D1H}

PBS
: Cant determine
D1H D2H
31
1. Quantum computation (Shor algorithm)

2. Quantum simulation
32
Shor algorithm
Factoring a large number
33
Implementation of (compiled version of) Shor algorithm
PRL 2007
Nature Photon. 2014
Boson sampling
35
Boson sampling
ArXiv 2016
5 boson sampling for the matrix permanent calculation
36
3. Conclusion
A Photonic quantum computer requires
- Good deterministic single-photon sources,
- Low-loss optical elements and waveguides,
- Good single-photon detectors.
37
Thank you for your attention!
For more information, visit quantum.kist.re.kr
Contact to yong-su.kim@kist.re.kr
38
Single and entangled photons
via spontaneous parametric
down conversion
(KRISS)
5
Spontaneous Parametric Down-Conversion
Hee Su Park
Center for Quantum Measurement Science, KRISS

1 Introduction: SPDC
2 Basics
3 Frequency Entanglement & Purity
4 Multiplexed SPDC
Single Photon Source
clock time pA
A
photon
SPS counter p AB
beam B pB
splitter
Emission probability 2nd-order correlation

p AB
p1 pA pB g (2) suppression of
p A pB multi-photon
emission
Center for Quantum Measurement Science

Single Photon Source
clock time pA
A
photon
SPS counter p AB
beam B pB
splitter
SPDC Photon Pair Source

Emission probability 2nd-order correlation
gHeralded
p(conditional) p1: up to 85%
p1 pA pB
(2)
AB suppression of
heralding p A pB multi-photon
Conditional g(2): negligibleemission

SPDC
signal ls
l spontaneous conversion
pump
idler li

l 2l wavelength
nonlinear crystal ((2) )
Sum-frequency generation (SFG) vs. SPDC
SFG: ls & ls lp classical P E2

SPDC: lp ls & ls quantum (no perturbation)
(1/lp = 1/ls + 1/ls)

Chronology
1961 Louisell, Yariv, Siegman: SPDC theory

(zero-point fluctuation of a parametric amplifier)
1970 Coincidence detection of two photons (Klyshko et al, Burnham et al)
1987 Quantum interference experiments (Hong-Ou-Mandel: ~2 CCs/s)
1995 Entangled photon pair source (Kwiat-95, ~103 CCs/s)
1997 Quantum teleportation experiments

2016 Ten-photon entanglement (~106 pairs/s, ~4 ten-fold CCs/h)
Scalability limit?
CC: coincidence count

Advantages of SPDC as a Photon Source
1. Control over Spectrum & Spatial/Temporal Profile
Telecom wavelength, compatibility with quantum memory, etc
2. Natural Entanglement Source
(from the CQT at the

NUS)
3. Hyper-Entanglement:
Multiple Degrees of Freedom
(from the Physics Dept
at the UIUC)

Practical Issues
1. Choice of an SPDC Crystal & a Pump Laser

CW laser ps laser fs laser?
Crystal (BBO, KTP, LN, ) & thickness?
2. Optical Alignment with Almost Invisible Single Photons

Basically placement of the components based on calculation
Example (The HOM interferometer: A new procedure for alignment, Rev Sci Inst (2009))

SPDC Theory
U
ak H


Entangled Photon Pairs
Photon pairs from double-crystal SPDC Coincidence counts of the pairs

Ref: PG Kwiat et al., Phys Rev A 1999
(pol1, pol2) Count rate
(all, all) 100%

q1 (H, H) 50%
SPCs
(V, V) 50%
(H, V) 0%
q2
polarizers (V, H) 0%
Probabilistic emission of H & H or V & V pairs

Meaning of the zero-count condition
E1 (t ) E1H (t ) x E1V (t ) y What if we set (pol1, pol2)

as (-45, -45) or (-45, +45)?
E2 (t ) E2 H (t ) x E2V (t ) y
very probably both rates = 25%
E1H (t ) E2V (t ) 0 or E1V (t ) E2 H (t ) 0
50%
One of E1H(t) and E1V(t) must be zero.
-45, -45
E (t ) x E2 H (t ) x -45, 45
E1 (t ) E2 (t ) 1H
E1V (t ) y E2V (t ) y 0%

Quantum Description of Light
Quantum Mechanical Equations of Motion

dX 1
[X , H] [qi , pi ] i ij
dt i
Maxwell Equations
E 0 B 0 E B t B 0 0 E t 0 J
Quantum Description (field vectors operators)

(1) Discrete mode structures of EM fields (with quantization volume V)
(2) Photon ~ (equiv.) harmonic-oscillator-like excitation of each mode

Electric Field and Creation Operators
Ex ( z, t ) Aj qs j (t ) sin(k j z ) Aj qc j (t ) cos(k j z )
E, H
kj = pj/L
j j
Quantum theory + Maxwell equation
Ex ( z, t ) Ck ak e ik t ikz h.c.
k
z=0 z=L

k ak ak 1 2

1

2
d
0E
x
2

0H
2
y
k V
number operator
a
m
, an mn a, a a , a 0 (harmonic oscillator)

SPDC Photon Pair State
Hamiltonian for SPDC interaction

1
2V d
E 2

1
2V
d ijk
( 2)
Ei E j Ek i: pump field
j, k: signal & idler
2
p p

p
E p E0 d p e
i ( k ( p ) z p t )
Pump field e c.c. (Gaussian pulse: passing origin at t=0)
Two-photon state vector

p p p

i Hdt iijk
( 2)
t ( )
dt dE
( )
e 0 0 p Es (r , t ) Ei (r , t ) 0 L: length of crystal
2 V

t 2
0 A0 dt d r d p d 3ks d 3ki e p
p i ( s i p ) t i ( k s ki k p )r
3
e e ak ak 0
V s i
0 A0 d p dks dki s i p e p
2 0

p i ( k s k i k p ) z
dze ak ak 0
L s i
Phase-matching factor
- determines coherence time of SPDC photons.
- makes the difference between type I and II.
- errors in some references.

Phase Matching
0
i ks ki k p z
Phase-matching factor
L
dze
1 1 1
0
ns ni n p l s li l p
k s ki k p 2 p 0
Center wavelength: l l l
s i p from energy conservation
Example: Refractive Indices of BBO
Type-I SPDC: (e) (o) & (o)
ks ki k p p D 0.25(s i ) 2 D"
Type-II SPDC: (e) (o) & (e)
ks ki k p p D 0.5(s i ) D

Polarization-Entangled Photon Pairs
pump pulse (780 nm)
Cascaded
(390 nm, 45-pol.) BBO
A B
Ti:S laser 1
+ SHG
coincidence
Polarizer
counter
2
AB
Polarizer
A B output
H V ?
1
+ superposition
H V ?
2
H1 H 2 V1V2 H1 H 2 V1V2
2

Frequency Entanglement
& Quantum State Purity

Quantum State of Heralded Photons
signal
trigger
Ref: YP Huang et al, Phys Rev A, 2010
pump
idler
(2) crystal
Two-photon joint spectrum: set of phase-matched wavelengths

decomposition
Highly entangled Factorable Realistic (SVD)
P0 P1
P2
Heralded Completely Mixture of
Pure state
photon: mixed state a few modes

What This Means
Heralding
counters
Highly entangled
Statistical mixture
Factorable
Identical pure state

State of the Heralded Photon
State after Tracing out Heralding Photon States
l0 0 0 l1 1 1 l2 2 2
probabilities
0
1
Tr[ ] i 1 li 1
N
Tr[ 2 ] i 1 li2
N
Tr[ 3 ] i 1 li3
N
2

Factorable Photon Pair Sources
Pure-State Photon Generation without Narrow-Band Filters
Type I, degenerate
crystal thickness,
dispersion
pump pulse width (1) Slope = -1
(2) Precise control of the pump pulse width
Type II or non-degenerate
slope: f(vp, vs, vi)
(1) Find a crystal to make the slope = 0 or

Scaling Up: Multiplexing

Ten-Photon Experiment
10-photon
coincidences
~ 1/1000 Hz

Near-Deterministic Single Photon Sources
Spatial Multiplexing Temporal Multiplexing
1N optical switch heralding

pump counter
pulses SPDC
crystal
storage/
emission
control
pump
pulse heralding
signal
periodic
storage cavity single
SPDC photons
crystals
Ref: Migdall et al., Phys. Rev. A (2002) Ref: Pittman et al., Phys. Rev. A (2002)

Near-Deterministic Single Photon Sources
Spatial & temporal multiplexing, N=4: Ma et al, PR A 2011 (U Vienna), Yoshikawa et al, PR X 2013 (U Tokyo)
Temporal multiplexing + indistinguishability, N=4: Xiong et al, Nat Comm 2016 (U Sydney)
Spatial+temporal multiplexing, N=24: Mendoza et al, Optica 2016 (U Bristol)

Temporal Multiplexing up to N=30 (2015)

Single-Photon Multi-Dimension States
Degrees of Freedom of Single Photons
Polarization Path Spatial mode Temporal mode
0 1 0 1
> 100-dimension OAM entanglement (Austria) Transmission through fibers (KRISS)

Quantum vs. Classical Measurements
Classical Alphabet
0 , 1, 2 , 3 , , N
Quantum Information
a0 0 a1 1 a2 2 aN N
coherent superposition with arbitrary

amplitudes & phases

High-Dimensional Quantum Communication
0
1 Multi-core fiber for
space-division multiplexing
2
3
2p
1 4
2 3
0
1 2 0 0 1 1 2 2 3 3 SLM pattern example

QST and CGLMP Inequality
Re( ideal ) Im( ideal )
Ideal - 256 projection measurements

- Maximum likelihood estimation
- Fidelity = 91 1 %
Re( d 4 ) Im( d 4 )
- CGLMP inequality (Collins et al,
PRL 2002)
exp. 2.27 0.06 > 2 (classical bound)

Summary
SPDC Basics
- Spontaneous emission of photon pairs in the phase-matched modes
Joint Spectrum and Single-Photon Purity

- Mode decomposition
- Generation of pure-state single photons through joint spectrum engineering
Scale-up of Single-Photon Experiments

- Multi-photon, multi-dimension, deterministic quantum state generation
Center for Nano- & Quantum Science

via artificial and natural atoms
(KIAS)
6
KIAS-OSK Quantum Information Winter School (14th Feb. 2017) Photonic Quantum Computing

via artificial and natural atoms
Young-Wook Cho
Center for Quantum Information

Korea Institute of Science and Technology (KIST)
Single Photon State
Quantum nature of light : Photon
Einsteins photoelectric effect : Light quantum (lichtquant)
Photon?
Gilbert N. Lewis
Original intention: carrier of radiant energy, not a particle itself.

Quantum nature of light : Photon
Light consists of particles : Photon

Counting photons : Single Photon Detector
Photon counting statistics
P(n)
Light source
Different Different photon

light source counting statistics
Characterization of Light
PRL 15, 912 (1965)
thermal light
(Bose-Einstein distribution)
coherent light
(Poisson distribution)
Single photon source
Single photon level and Single photon state are different!
Single photon state: Each optical pulse has a single photon.
How to generate?
|2i
Emission from a single two-level system

(e.g. Natural atom, artificial atom)
|1i
How to quantify
1. Second-order coherence measurement
Multi-photon emission noise
Hanbury Brown and Twiss (HBT) measurement
BS D1
Glauber
(Nobel prize 2005)
Second-order correlation function
D2 Start
Stop
g(2)(0) < 1 : Signature of non- (2) g(2)()

g (0) = 0
classical nature of radiation.
(anti-bunching)
g(2)(0) = 0 : Single photon state
0
2. Indistinguishability
Linear optical quantum computing is based on the

quantum interference between single photons.
Indistinguishability is very important for photonic

quantum computing.
Hong-Ou-Mandel (HOM) interference PRL 59, 2044 (1987)

C.C.
BS
Case 1 Case 2 Case 3 Case 4
Distinguishable
photons + - +
Indistinguishable
photons + - +
Destructive No contribution
interference to C.C.
What causes the distinguishability?
Mode matching. (polarization, spatial, spectrum, temporal, etc.)
Emission timing-jitter
Should be transform-limited.
i.e. spectral width ~ 1/T1 .
|2i
1 1 Characteristic rate & time

= =
T1 T2 : relaxation rate
|1i : dephasing rate
T1 : fluorescent lifetime
pure dephrasing without loss of energy T2 : coherence time
due to bath interaction - e.g. phase diffusion
12 1

: pure dephasing rate

= T2: pure dephasing time
T2
t
HOM visibility vs. characteristic times.
T2 T2
V = 2
2T1
1 1 1 1 1
Note T2
=
2T1
+
T2
=
2T1
+
T2
T1
1
T1 = T2 /2 =
2T1
- Transform-limited
- Pure temporal mode emission (not mixed)
T1 T2 Environment control
- Low temp. (isolation to phonon)
- E & B fields shielding if sensitive.
- Excitation control (resonant excitation etc.)
Reduce lifetime.
- Cavity coupling
- Purcell effect
3. Efficiency
Detector Efficiency x Source Efficiency > 2/3

3. Efficiency
Efforts to improve collection efficiency
Parabolic mirror Solid immersion lens (SIL)
Cavity coupling
Waveguide coupling
4. Other considerations
Emission wavelength should be a favorable color
Emission speed 1/
Consider the quantum memory compatibility
Emission polarization
Operating temperature
System size
Single emitter based
single photon sources
Examples of a single emitter system
Neutral atom
Molecule
Color center in diamond
Trapped ion Quantum dot

Efforts toward ideal single photon source
Nanophotonics cavity and waveguide technologies to improve
indistinguishability & efficiency.
Cavity
waveguide
RMP 86 347 (2015)

Ensemble based
single photon sources
Ensemble based system - collective enhancement
Single photon Atom in a cavity : Cavity QED
Single photon Atomic ensemble
Easy to implement Dicke state

Strong coupling
Collective excitation
Collective enhancement Robust to the atom loss
Ensemble based system - 1
L.-M. Duan et al. Nature 414 413 (2001)
D. Felinto et al. Nature Physics 2 844 (2006)
Z.-S.Yuan et al. Phys. Rev. Lett. 98 180503 (2007)
Core technique of the well-known DLCZ quantum repeater protocol
Prepare single Generation of single photon

atomic excitation from single excitation on demand
|2i |2i
Stokes Single photon Read
Write
(Anti-Stokes)
|1i |1i
|0i later time |0i
Stokes Read pulse
Write pulse Anti-Stokes
D1
Atomic
Atomic ensemble
ensemble Emission into well-defined mode
due to atomic collective enhancement
Rydberg blockade effect
- High principal n quantum number (Rydberg state)
- Large dipole moment
- Long range interaction ( ~ um)
Rydberg superatom
Can be considered as a single atom
x x x x
M.D. Lukin et al. PRL 87 037901 (2001)

Rydberg atom based single photon source
- On-demand time is limited to the short Rydberg excitation lifetime. Science 336 887 (2012)
- Rydberg excitation is mapped onto long-lived ground state excitation (Quantum memory).
Nat. comm. 7 13618 (2016)
Photon pair generation
in atomic ensemble
Photon pair source
Trigger
SPDC
Heralded
single photon
Emission into well-defined mode. (Phase matching)

Photon pair source (SPDC or SFWM) is inherently probabilistic.
But, can be heralded.
Heralded single photon source.
Natural entangled photon pair source.
Photon pair source in atomic ensemble
Spontaneous Four-Wave Mixing Double Lambda Energy level

configuration in Rb87
(SFWM)
coupling |4i
( 3) coupling
|3i
anti-Stokes
pump Stokes
Anti-Stokes
Atomic Stokes
pump ensemble |2i
|1i
Two-photon state
kL
= d as (3) ( as , as )sinc as ( p + c as )aas ( as ) 0
2
Quantum memory compatible

Very narrow bandwidth (even sub-natural linewidth)
Time-resolved detection is possible with current single
photon detectors.
Cold atoms
Hot vapor cell
in magneto optical trap (MOT)
PRL 100 183603 (2008) Nat. comm. 7 12783 (2016)

Discrete variable entangled photon pair generation
Polarization entanglement Frequency-bin entanglement
PRL 112, 243602 (2008)

Optica 2, 505 (2015) arXiv: 1609.02282 (2016)
Continuous variable entangled photon pair generation
EPR type X-P entanglement Frequency-time entanglement
PRL 113, 063602 (2014)

PRL 117, 250501 (2016)
Heralded single photon source
Indistinguishability of heralded single photons
Trigger Trigger
BS
Photon Photon
pair source pair source
- Pair photons naturally have the frequency-time entanglement.

- This entanglement might be useful for some applications.
- But, we have to remove this frequency-time entanglement for
indistinguishability.
Relation with frequency-time entanglement
Z Z
Frequency-time entangled Separable in Frequency-time | i= d!s !i S(!s , !i )as ai |0i
!i !i Schmidt mode decomposition
If entangled,
Xp
| i= k |k (!s )i|k (!i )i
k
After trace out the idler mode,
!s !s mixed state -> poor HOM visibility
ti ti If not entangled (separable),

| i = |1 (!s )i|1 (!i )i
After trace out the idler mode,
pure state -> high HOM visibility
For indistinguishable heralded single

ts ts photons, the frequency-time
entanglement should be removed!
Relation with frequency-time entanglement
Frequency-time entangled Separable in Frequency-time
ti ti
Trigger click Trigger click
ts ts
T2 T2
2 2
T1 T1
Not transform-limited, mixed single photon state. Transform-limited, pure single photon state.
Timing jitter No timing jitter
Distinguishable. Indistinguishable.
Some experiments to solve this issue.
Engineering the frequency-time entanglement
PRL 113, 063602 (2014)
Time resolved detection on frequency-time entangled photon pairs.

PRL 117, 013602 (2016)
Summary
Single photon state.

Important aspects for photonic quantum computing.
How to generate the single photon state
Single two-level system
Ensemble based system
How to generate the entangled photon pairs
Thanks!
Integrated photonics
quantum circuits
(POSTECH)
2/19/2017
Quantum Photonic
Integrated Circuits
POSTECH
Heedeuk Shin
Department of Physics, POSTECH
Realization
2
Quantum Integrated Circuits
Phys. Rev. Lett. 105, 200503 (2010)

Science 320, 646 (2008)
Using Nano-Photonics:
Realization of future quantum photonic technologies
including Photonic Quantum Computing
3
Why Quantum Integrated Circuits?
Photon: quantum of the electromagnetic field

Qubit encoded into photon's degrees of freedom
- Single photon polarization
- Spatial mode
- Time bin
-...
Quantum Information Processing:

Preparation + Manupulation + Detection
Still not clear? 4

Quantum photonic integrated circuits

Seamless integration of quantum photonics
http://www.quantum-munich.de
Minimization
5
Interferometer
C-NOT gate
Science 320, 646 (2008)
OK for simple free space setup

What if complex optical interferometers?
Large physical size, low stability, difficulty to apply outside laboratory
6
Minimization
+ Stabilization
Mono-chip
7
Scalability
8
Waveguides
9
What is waveguide?
Many different types of waveguides.
Total internal reflection
Fiber optic is the prototypical optical waveguide.

10
Nano-scale waveguide
n_core>n_cladding
Nanoscale Silicon Waveguide
Si
SiO2
Silicon: n = 3.5
Silica: n = 1.45
11
Silicon nano-photonics
Silicon waveguide
air
Phys. Rev. Lett. 105, 200503 (2010)
Optical properties
Refractive index diff.: ~0.1 vs ~2 Absorption (< 1 dB/m)
Refractive index (Si: 3.45 vs.
Mode area: ~100 um^2 vs < 1 um^2 SiO2: 1.52)
Bending radius: ~10 cm vs < 10 um Strong light confinement
Propagation loss: ~0.5 dB/cm vs ~1 dB/cm
CMOS compatible: Difficult vs Yes
12
Silicon waveguides
Silicon waveguide High n = 3.45 & low propagation loss

Small bending radius ( < 5 mm)
Compatible with CMOS & MEMS technologies.
Photonic integrated circuit
http://www.amitbhawani.com/blog/photonic-integrated-circuit/
13
E-beam lithography
Negative e-beam resist
Si
SiO2
Si 14
E-beam lithography
e-beam patterning
Si
SiO2
Si 15
E-beam lithography
e-beam patterning
Development
Si
SiO2
Si 16
E-beam lithography
e-beam patterning
Development
Etching
Si
SiO2
Si 17
E-beam lithography
e-beam patterning
Development
Etching
Si
SiO2
Si 18
Fabrication methods
19
SiN waveguides
20
Optics Express 24, 6843 (2016)
Silicon-chip sourc of Bright photon pairs
Optics Express 23, 20884 (2015)
21
On-chip polarization entangled states
Scientific Reports 2, 817 (2012)
22
Quantum photonic
integrated circuits
23
Quantum light source

Linear photonic circuits
Single photon detectors
Single photon
detectors
Quantum Linear photonic

light source circuits
24
Entangled photon pairs
Non-classical states of photons
P Phase
S matching
S AS condition
P
AS
| + |
2 25
Spontaneous Four-Wave Mixing
26
Spontaneous Four-Wave Mixing
Mathematically, SFWM is described via the following nonlinear Hamiltonian,
3
2 + . .
where , , are the pump field annihilation operator and signal and
idler creation operators, respectively.
The Hermitian conjugate (h.c.) term describes the reverse process.
27
2. Spontaneous Four Wave Mixing
Spontaneous Four p p
Wave Mixing
2p = sig + idl sig idl

2p = sig + idl + 2p
Photon flux
With near perfect phase matching, narrow bandpass filter Q. Lin, et al., PRA 75, 023803 (2007)

sFWM Generation rate
Raman scattering rate

Optical fiber
M. Fiorentino, et al., IEEE Photo. Tech. Lett. 14, 983 (2002)
H. Takesue , Phys. Rev. A 70, 031802(R) (2004).
X. Li, et al., Phys. Rev. Lett. 94, 053601 (2005).
Silicon nano-waveguide & ring resonators

Q. Lin and G. P. Agrawal, Opt. Lett. 31, 3140 (2006).
J. Sharping, et al., Opt. Express 14, 12388 (2006) 28
R. Kumar, et al., Nat. Comm. 5, 5489 (2014)
Waveguide design for sFWM
Computational simulation
Design
Fabrication
Optical properties
Quantum characteristics
eff () consists of materials dispersion and waveguide (structural) dispersion.
2 2
= 2
2
Zero Group Velocity Dispersion Phase Matching Curve
Normal Anomalous
1558 Anomalous
dispersion dispersion dispersion
s
1550
W = 800 nm
i h = 260 nm
1542
C. Ha, et al., OSK conference (2015) 1542 1550 1558 29
Pump Wavelength (nm)
Formula of Joint Spectral Intensity
Spectral function Optics Express 16, 32 (2008)

, = + , ,
2
+ 2
with, , = 42
2 2
, = + + + +
8 16
= 0 0
= 0
= 0
0 .
2 2
= + + +
4 8 0 .
2 0 2 0 .
= = 0 0
2 =0 2
0
2 2
3 0 2
= = 0
3 =0 2
0
22
=

2 30
Joint Spectral Intensity
, 2 , 2 , 2
31
W:450nm H:260nm L:1cm SiO2-cladding
Pump Pump
power = 100mW power = 100mW
Band width = 3nm Band width = 1nm
32
W:450nm H:260nm L:1cm SiO2-cladding
Pump Pump
power = 100mW power = 1W
Band width = 3nm Band width = 3nm
33
Photon pair generation
experimental results
34
Fabrication (Photo+Ebeam)
Photo lithography at KANC and E-beam lithography at NINT
KANC
260 nm
810 nm
SOI silicon rib waveguides
Top layer: 260 nm

Box layer: 2 um NINT
Handle: 600 um
Grating coupler 35
36
Optical properties
Transmittance and fiber-to-waveguide coupling efficiency
Propagation loss: ~ 0.76 dB/cm

Fiber-to-waveguide coupling
efficiency: ~ 55% per coupler
37
Optical properties
Experimental Setup
Tunable laser
Pin
Pout
Pin/Pout
-4
-6
Transmittance(dB)
-8
-10
-12
1500 1525 1550 1575 1600
Wavelength(nm) 38
detector gate width = 20 ns
dead time = 1 s
quantum efficiency = 10%
Variable
Pump Laser (pulsed) attenuator
= 1552.52 nm
Ppeak = > 500 mW
Pulse width = 5 ns
DWDM filter
(0=1552.52nm) DUT
Rep. rate = 500 kHz
pair photon detection
InGaAs
SPDM signal, as
(s =1549.32nm)
TCSPC
trigger
PD (0 =1552.52nm)
(PicoHarp pump
DWDM
300)
(i =1555.75nm)
InGaAs
SPDM
idler, s
Transmittance spectrum of filter system
TCSPC time resolution = 32ps

integ. time = 300s
Total detection efficiency: < 2% 39
Equipment From Prof. Yoon-ho Kim
Tunable laser
TCSPC
InGaAs APD SPD
InGaAs APD SPD

OSA
40
First photon-pair generation through
silicon waveguides in Korea CAR of ~ 12
sFWM1 + sFWM1
260 nm FWHM of ~500 ps
Detector jittering: ~ 200 ps
Dark + Dark
Raman + Raman
Raman + sFWM
sFWM + Dark
sFWM1 + sFWM2
41
On-Chip Quantum Photonic Circuits
A promising approach to realize future Optical Components
quantum photonic technologies. Polarization rotator Polarization splitter

or single photon
Four wave mixing in waveguide, fiber, and Optics Letters, 30, 138 (2005) OPTICS Lett. 30, 967 (2005)
micro-ring resonator Interferometer
Microring filter
OPTICS EXPRESS Optica 2, 88 (2015) Nat. Phot. 8, 104 (2014)

20, 21978 (2012) Optics Letters, 31, 2571 (2006)
Micro beam splitter

On-Chip Single-Photon Detector
Waveguide
Superconducting Nanowire Grating coupler
Single-Photon Detector
Optics Express, 19, 17 (2011) Nat. Comm. 10.1038/ncomms6873

42
Acknowledgement
Post-doctoral appointee Graduate students
Dr. Gyeongdeuk Park Changwoo Ha Woncheol Shin Hyeongpin Kim
Undergraduate students
Kiwon Kwon
Special thanks to
Prof. Yoon-ho Kim (POSTECH)
Dr. Hokeun Sung (KANC)
Mr. Donghyun Kim (NINT)
43
Thank you
heedeukshin@postech.ac.kr
44
Photonic quantum memories
()
8
KIAS winter school 2017
Photonic quantum memories
1
- Where can it be used?
- What is an optical quantum memory?
- Quantum memories based on atomic ensemble
- What should it be able to do?
/
, ,
2
Quantum memory
Quantum memories are important elements for

quantum information processing applications
such as quantum networks, quantum repeaters,
and linear optics quantum computing.
3
Quantum memories are essential for quantum
information processing and long-distance
quantum communication.
4
In the realm of photonics-based quantum technologies key
quantum components include: quantum memories, photon
sources, frequency converters, quantum random number
generators and single-photon detectors.
5
Where can it be used?
The ability of quantum memories to synchronize probabilistic events
makes them a key component in quantum repeaters and quantum
computation based on linear optics.
Quantum repeaters
Long distance quantum communications

synchronization
Quantum computers
Implementing scalable LOQC (Linear optical quantum computation)
- synchronization of multiple independent nondeterministic
operations
Deterministic single photon sources
6
What is an optical quantum memory?
Non-classical states of photons are mapped onto stationary matter
states and preserved for subsequent retrieval.
Quantum memories are technical realizations enabled by exquisite
control over interactions between light and matter.
Storage of quantum information (qubits)
Transformation of flying qubits to stationary qubits
7
Stopped light
NATURE | VOL 409 | 25 JANUARY 2001
8
Light storage in cold atoms

e Writing Reading
coupling
probe
C
P
g1
g2
NATURE | VOL 409 | 25 JANUARY 2001
9
Electromagnetically induced transparency
Electromagnetically induced transparency (EIT) is a coherent optical n

onlinearity which renders a medium transparent over a narrow spectra
l range within an absorption line. Extreme dispersion is also created wit
hin this transparency "window" which leads to "slow light", described b
elow. Basically it "is a quantum interference effect that permits the prop
agation of light through an otherwise opaque atomic medium.
e Linear absorption
Absorption(arb.unit)
EIT
coupling
probe
C
P EIT
g1 g2
-600 -300 0 300 600 900 1200
Frequency(MHz)
10
: (Group Velocity)
group velocity
d c
vg = =
dk n( ) + dn( )
d
dn()/d <<0
dn()/d >>0
11
Slow light
0.14
0.12
Transmission (arb.units)
0.10
0.08
0.06
Slow light
0.04
0.02
c
0.00
vg = <c
-300 -200 -100 0 100 200 300 400
dn( )
1.006
-0 (MHz)
n( ) +
1.004 d
Refrective index (n)
1.002
dn( )
1.000
0.998
>0
0.996 d
0.994
-300 -200 -100 0 100 200 300 400
-0 (MHz)

12
Experimental setup for light storage
in warm atoms
M
PD
Rb Cell
electric feedback
BS
BS -metal
BS M
LC
(Coupling laser)
Isolator
BS
EOM HWP
6.843 GHz
Heater
BS
AOM
LP
(Probe laser)
Isolator M Rb Cell
HWP BS HWP
PD APD
-metal
PD
Rb Cell RF input
BS
BS -metal
13
Slow light pulse in EIT medium
Absorption (arb. unit)

Im[()]
Re[()]
Dispersion (arb. units)

Absorption (arb. units)
-9 -6 -3 0 3 6 9
Frequency (MHz)
1.0
Input pulse
Amplitude (arb. units)

0.8 Slow light
Light storage (laser probe light)
0.6 Light storage (pseudo-thermal probe light)
-300 -200 -100 0 100 200 300 0.4
Frequency (MHz) 0.2
0.0
0 10 20 30 40 50
Time (s)
14
Light storage in Rb vapor cell
1.0
Input pulse
Amplitude (arb. units)
0.8 Slow light

Light storage (laser probe light)
0.6 Light storage (pseudo-thermal probe light)
0.4
0.2
0.0
0 10 20 30 40 50
Time (s)
In-Ho Bae, et. al., Opt. Express 18, 19693 (2010).
Y.-S. Lee, 22(13) Opt. Express 22, 15941 (2014).
15
Multi-writing
Transmission (arb. units) 2.0
Input pulse
Slow light
1.5 Light storage
Gate 1
Gate 2
1.0
0.5
0.0
-30 -20 -10 0 10 20 30 40 50 60
Time (s)
In-Ho Bae, et. al., Opt. Express 18, 19693 (2010).
16
Understanding light storage in atomic
ensemble
probe coupling
E ( z , t ) (t )
b c
Atomic coherence
Dark-state polariton
Fleischhauer, M. & Lukin, M. Dark-state polaritons in electromagnetically

induced transparency. Phys. Rev. Lett. 84, 50945097 (2000).
http://www.jqc.org.uk/research/project/rydberg-quantum-optics/12291/
17
Transformation of flying qubits to
stationary qubits
Long distance transportation
Fiber
Photon
e e
Atom
g1 g1
g2 g2
Long living time at local sites
Remote Entanglement
18
Correlated photon pair source
Optical nonlinear process Phase-matching condition
Hamiltonian (Medium translational
symmetry)

0 A L/2 P + C = S + I k P + kC = k S + k I
H I
4 dz (3) EP( + ) EC( + ) E S( ) E I( ) + h. c.
L/ 2 Signal
Two-photon state (First-order perturbation theory)

= L d I K (I , P + C I ) sinc [ kL 2] a I (I )aS (P + C I ) 0 Idler
Pump Idler Correlated

Quantum Time
device Energy
Coupling Signal Spatial mode
Polarization
Spontaneous Parametric Down Conversion Application
(2) - Coincidence count Entanglement generation

Signal
Pump ~ 104 cps/mW Heralded single photon source
- Large SNR
- Broad bandwidth Quantum communication
Idler : 0.1~2THz Quantum computer
19
Spontaneous four-wave mixing (SFWM)
coupling
pump Stokes
Anti-Stokes
Engineering spectral quantum correlation
Y.-W. Cho et. al,

PRL 113, 063602 (2014)
20
Highly bright photon-pair generation in
Doppler-broadened ladder-type atomic system
Signal
2 3.0
Heralded Idler photon
2.5
(104 counts)
Idler
M SMF 2.0
ECDL FWHM
Frequency stabilization
775.8nm 1 1.5 = 1.87 0.3 ns

OI C
E
IF 1.0
H
P Three layers of -metal P 0.5
Signal M
N
PBS 0.0
M
PBS P H OI ECDL
-4 -3 -2 -1 0 1 2 3 4 5 6 7 8
Idler
P P 780.2nm
150 Life time measurement
Intensity (counts)
IF
Hanbury Brown-Twiss Experiment
E
120 2 ns excitation pulse
D1
SMF
C.C.
Signal D2 90 tI = 27.3 0.4 ns
TCSPC
Idler 60
FBS
D3
30
0
-10 0 10 20 30 40 50 60 70 80
Time (ns)
Coincidence counts rate : N C = 30,300 cps/mW
Y.-S. Lee et. al,
OE 24, 28083 (2016) 21
Quantum memory based on atomic ensemble
EIT-memory
Far off-resonant Raman memory
Gradient echo memory (GEM)
Atomic frequency comb (AFC)
22
EIT quantum memory
Electromagnetically induced transparency
Storage of light by electromagnetically induced transparency
If the signal state is a single photon, the atomic

state becomes
Corrective Effect
nature photonics | VOL 3 | DECEMBER 2009 23

24
Raman memory
Far off-resonant (18 GHz)
a
20 x inhomogeneous linewidth
Retrieval Signal Large bandwidth (1.5 GHz)

Signal Reading
Writing Dynamically generated by control field
E ( z , t ) (t )
Room temperature operation
Large optical depth
b
Quantum-ready memory
c Noise floor down to single photon level
NATURE PHOTONICS | VOL 4 | APRIL 2010

25
before
after
storage efficiency: 26.7%, 26

Gradient echo memory
Inner coil
Outer coil
30
20
B field (T)
10
-10
-20
0 5 10 15 20 25 30 35
Length (cm)
27
http://photonics.anu.edu.au/qoptics/ALE/Research/coherentpulseseq.html
EIT-memory GEM-memory
28
Gradient echo memory
nature communications | 2:174 (2011)

29
30
Memory efficiency & storage time
T : measure of how well the

signal-to-noise ratio of the
quantum state is preserved
V : measure of the noise

added to the output state
m : number of pulses in the

dataset
Low noise (Fidelity)
31
Atomic frequency comb memory
- Preparation of a periodic absorption feature, or comb, with equal peak spacing by optical
pumping in an inhomogeneously broadened ensemble.
- After absorption of the signal pulse, which spans multiple comb spacings, the inverse of this peak
spacing pre-determines the rephasing time, and thus re-emission from the memory.
H.De Riedmatten, Nature 456,773 (2008).

32
Quantum storage of entangled broadband light fields:
C.Clausen, et.al.,Nature 469, 508 (12 January 2011).
E. Saglamyurek, et.al., Nature 469, 512-515 (12 January 2011).
Quantum storage of 1060 temporal light modes:
M. Bonarota, et. al., New J of Physics 13 (2011) 013013
33
What should it be able to do?
Long storage time
This is clearly very important for long-distance quantum communication
applications, where the communication time between distant nodes
imposes a lower bound on the required storage time.
Low noise (Fidelity)

In general terms, fidelity is related to the overlap between the quantum
state that is written into the memory and the state that is read out.
High memory efficiency

It is most clearly defined for the case of memories that are meant to
store and emit single photons, where it is the probability to re-emit a
photon that has been stored.
High bandwidth
This will influence the practical usefulness of a given memory for most
applications, because it determines the achievable repetition rates, and
also the multiplexing potential, cf. below.
34
Performance of quantum memories
M. Hosseinis thesis in ANU, Australia (2012)
96 %
87 % 0.6 ms
96 %
[91] H. Zhang et al., Nat. Phot. 5, 628 (2010).

[100] K. Jensen et al., Nat. Phys. 7, 13 (2010).
[102] K. F. Reim et al., Phys. Rev. Lett. 107, 053603 (2011).
[130] E. Saglamyurek et al., Nature 469, 512 (2011).
[230] M. Hosseini et al., Nat. Phys. 7, 794 (2011). 35
Y.-W. Cho, et. al., Optica 3(1), 100-107 (2016).
36
Implementation challenges
True single photon storage

- Single-photon source (narrow bandwidth)
- Noise (Fluorescence noise, Thermal population of the storage state,
Four-wave mixing)
Improve memory efficiency

- Pulse shaping
- Enhance laser power
- Backward retrieval
Qubit memory
- Implement qubit memory with real single photons
- Telecom wavelength storage
37
.
38
Single-photon
detection technologies
(KRISS)
9
(SUPERCONDUCTING)
SINGLE PHOTON DETECTOR
Yonuk Chong (KRISS)

2017.02.14. High1 Resort
(SINGLE) PHOTON DETECTOR
Quick & Easy References

- Opto-Semiconductor Handbook Chap. 3 (Hamamatsu).
- Photon Counting for Brainies (IDQuantique).
SINGLE PHOTON DETECT ??
SINGLE PHOTON DETECT ??
Quantization of Electromagnetic Wave
Photoelectric Effect (Einstein)

PHOTOSENSORS AND SOURCES
Hamamatsu Opto-Semiconductor Handbook

SENSITIVITY
Hamamatsu Opto-Semiconductor Handbook

AVALANCHE PHOTODIODE (APD)
PHOTON DETECTION
Detection Efficiency (DE) : Probability of a photon impinging on the detector to be detected
Dark Count Rate (DCR) : Detection signal without photon
Count Rate or Dynamic Range :
Jitter or Timing Resolution :
InGaAs/InP Photodiode
PHOTON NUMBER COUNTING
MPPC : Multi-pixel photon counting
SINGLE PHOTON DETECTOR
SUPERCONDUCTIVITY
DC resistance = 0 Meissner Effect
How to BREAK Superconductivity?
Quasi-particle electrons

H. K. Onnes
1913 Nobel Prize Cooper pair condensate
(exp. done by G. Holst) ei

non-superconductor From Schdingers equations
I I c sin(1 2 )
1 ei1 2 ei2 d
V (t ) (1 2 )
2e dt
Josephson Relations
E
Current Quantum
Voltage Mechanics
12
SUPERCONDUCTING TUNNEL JUNCTION (STJ)
TRANSITION EDGE SENSOR (TES)
14
NUMBER-RESOLVING TES (NIST)
Miller, APL 2003 (NIST Boulder)
Lita, OPEX 2008

(NIST Boulder)
SNSPD
: Superconducting Nanowire Single Photon Detector
1) High Detection Efficiency @1550nm

2) Low Jitter
3) Low Dark Count Rate
4) Relatively High Count Rate
5) Cryogenic
6) ......
EARLY WORKS
G. N. Goltsman, APL 2001
(Moscow-Rochester)
SuST 2002
K. S. Ilin, APL 2000

(Moscow-Rochester)
Moscow State Pedagogical University

University of Rochester
EARLY WORKS
Goltsman, IEEE TAS 2003

(Moscow-Rochester)
EARLY WORKS
Verevkin, APL 2002

(Moscow-Rochester)
Korneev, APL 2004

(Moscow-Rochester)
(NIST)
Hadfield, OPEX 2005 (NIST Boulder)
Hadfield, APL 2005 (NIST Boulder)

(MIT)
Kerman, APL 2006 (MIT)

(MIT)
Kerman, APL 2007 (MIT)
OPTICAL CAVITY
Rosfjord, OPEX 2006 (MIT)

OPTICAL CAVITY
Baek, APL 2009 (NIST)
Baek, APL 2011 (NIST)

SELF-ALIGNING PACKAGE
Miller, OPEX 2011 Mar (NIST Boulder)
Dorenbos, ArXiv 1109.5809 (2011 Sep, Delft)

POLARIZATION
S. N. Dorenbos, APL 2008 (Delft)
V. Verma, APL 2012 (NIST Boulder)

JITTER
L. You, AIP Advances 2013 (SIMIT)
(NICT)
S. Miki, OPEX 2013 (NICT)
(NIST)
Marsili, Nat. Photon. 2013 (NIST Boulder)

REVIEW
Natarajan, Hadfield,
SuST 2012
REVIEW
Natarajan, Hadfield,
SuST 2012
MARKET PRODUCTS
MARKET PRODUCT EXAMPLE
SNSPD
In System Level,
High Detection Efficiency @1550nm

> 90% max, >80% commercial
Low Timing Jitter
< 20 ps max
Low Dark Count Rate
< 100 Hz typical
Relatively High Count Rate
> 10 MHz or more
Low After-pulsing events
Dont worry about Cryogenics

양자정보

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

양자정보

Uploaded by

Copyright:

Available Formats

-

Photonic Quantum Computing

: 13 Free discussion and welcome dinner

08:50 ~ 09:00 Opening ()

09:00 ~ 09:45 From quantum physics to quantum computing (KIAS)

09:45 ~ 10:30 Applications of a quantum computer (KIAS)

10:30 ~ 10:55 Break

10:55 ~ 11:40 Linear optical quantum computing ()

11:40 ~ 12:25 Technology overview on photonic quantum computing (KIST)

12:25 ~ 13:30 Lunch

Single and entangled photons via

15:00 ~ 15:25 Break

15:25 ~ 16:10 Integrated photonics quantum circuits (POSTECH)

16:10 ~ 16:55 Photonic quantum memories ()

16:55 ~ 17:40 Single-photon detection technologies (KRISS)

17:40 ~ 17:50 Closing (KIAS)

Jaewan Kim (Jaewan@kias.re.kr)

intensity 550 nm, 545 THz

Life phenomena: DNA, Seeing, Smelling,

Semiconducton Devices, Lasers

Electrons are freely wandering around

With slight help, electrons can be promoted to this band

Software/Operating System Mathematics and Information Theory

Spatial distance goes below nm

Among 16=24 cases,

All 16=24 cases are present at the same time.

N bits N bits N bits

Computational Space is blown up

Data Search: Data Search : BT, IT

Quantum manybody problem: Quantum manybody problem : NT, IT

half and half

consistency m results in only.

uncertainty: Measurement of results in

Result of each measurement is entirely random.

Sending an unknown qubit state by two bits

NOT copying Original state is destroyed by Bell measurement

Seung-Woo Lee (swleego@kias.re.kr)

2. Towards Quantum Supremacy

4. Errors and Scalability

The macroscopic world is classical

Cryptography Carrier 11:40 AM

Information is stored in a physical medium and

Quantum devices but

Quantum switches which substitute the silicon-based transistors

A logic of information processing by

Quantum information processing

Basic unit : Qubit (Quantum Bit).

A qubit is modeled by a vector in a

simple highly complex

simple highly complex

Quantum Information Science

Application to quantum information processing

Nobel Prize 2012

large-scale quantum systems

Single photons (polarization, number, time-bin),

Quantum metrology/sensing Quantum Hardwares

Quantum teleportation. Dense coding,

2. Towards Quantum Supremacy

4. Errors and Scalability

Alan Turing Alonzo Church Turing Machine

Can we simulate physics on a computer?

- not exactly, not all of physics.

If we cannot simulate quantum physics on a computer,

Any quantum algorithm can be expressed formally as a