Rishabh Sahu Summary Qubits Dualrail bits 1gt 0gt 0gt 0gt 1gt 1gt Single bit unitary transformation are trivial Twobit gates are challenge as photons dont interact ID: 802409
Download The PPT/PDF document "Linear Optical Quantum Computing" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Linear Optical Quantum Computing
-Rishabh Sahu
Slide2Summary
Qubits: (Dual-rail bits)
|1>
|0>
|0>
|0>
|1>
|1>
Single bit unitary transformation are trivial.
Two-bit gates are challenge as photons don’t interact.
Slide3Two-qubit CZ gate
Control
Target
CZ
|0>
|0>
|0,0>
|0>
|1>
|0,1>
|1>
|0>
|1,0>
|1>
|1>-|1,1>> >
CZ
>
Success probability is
.
Slide4Quantum Teleportation Fix
Proposed by Gottesman and Chuang, 1999
Introduction
>
>
>
Bell Measurement
Slide5Quantum Teleportation Fix
Several identities:
Slide6Quantum Teleportation Fix
>
>
CZ
>
>
>
Slide7Quantum Teleportation Fix
>
>
CZ
>
>
>
Slide8Quantum Teleportation Fix
>
>
CZ
>
>
>
Slide9Quantum Teleportation Fix
>
>
CZ
>
>
>
Slide10Quantum Teleportation Fix
>
>
CZ
>
>
>
Slide11Quantum Teleportation Fix
>
>
CZ
>
>
>
Offline
System
Slide12Quantum Teleportation using Linear Optics
Entangled
Resource
Dual-Rail
bit
:
:
Slide13Quantum Teleportation using Linear Optics
Entangled
Resource
>
>
Mode 1
QFT
Mode 2
Slide14Quantum Teleportation using Linear Optics
Measurement
Output
Mode
Probability
Total probability of success = 2/3
(for 3-dimensional system)
For a n-dimensional system,
success probability
=
Slide15Experimental Realization?
Slide16Thank You