220 likes | 301 Views
-Rishabh Sahu. Linear Optical Quantum Computing. Summary. Qubits: (Dual-rail bits). |1>. |0>. |0>. |1>. |0>. |1>. Single bit unitary transformation are trivial. Two-bit gates are challenge as photons don’t interact. Two-qubit CZ gate. >. CZ >. >. Success probability is.
E N D
-Rishabh Sahu Linear Optical Quantum Computing
Summary • Qubits: (Dual-rail bits) |1> |0> |0> |1> |0> |1> • Single bit unitary transformation are trivial. • Two-bit gates are challenge as photons don’t interact.
Two-qubit CZ gate > CZ> > Success probability is .
Quantum Teleportation Fix • Proposed by Gottesman and Chuang, 1999 • Introduction Bell Measurement > > >
Quantum Teleportation Fix • Several identities:
Quantum Teleportation Fix > > CZ> > >
Quantum Teleportation Fix > > CZ> > >
Quantum Teleportation Fix > > CZ> > >
Quantum Teleportation Fix > > CZ> > >
Quantum Teleportation Fix > > CZ> > >
Quantum Teleportation Fix > > OfflineSystem CZ> > >
Quantum Teleportation using Linear Optics Dual-Railbit Entangled Resource : :
Quantum Teleportation using Linear Optics QFT > Mode 1 > Mode 2 Entangled Resource
Quantum Teleportation using Linear Optics Probability Measurement Output Mode Total probability of success = 2/3(for 3-dimensional system) For a n-dimensional system,success probability=