Q UANTUM C OMMUNICATION P ART 2 Aditi Harish-Chandra Research Institute, India.

Slides:



Advertisements
Similar presentations
Introduction to Quantum Teleportation
Advertisements

Strong Monogamy and Genuine Multipartite Entanglement Gerardo Adesso Informal Quantum Information Gathering 2007 The Gaussian Case Quantum Theory group.
Spin chains and channels with memory Martin Plenio (a) & Shashank Virmani (a,b) quant-ph/ , to appear prl (a)Institute for Mathematical Sciences.
Fixing the lower limit of uncertainty in the presence of quantum memory Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata Collaborators:
Quantum Communication, Teleportation, and Maxwell’s Demon
1 quantum teleportation David Riethmiller 28 May 2007.
1 Multiphoton Entanglement Eli Megidish Quantum Optics Seminar,2010.
Classical capacities of bidirectional channels Charles Bennett, IBM Aram Harrow, MIT/IBM, Debbie Leung, MSRI/IBM John Smolin,
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
Future Challenges in Long-Distance Quantum Communication Jian-Wei Pan Hefei National Laboratory for Physical Sciences at Microscale, USTC and Physikalisches.
Deterministic teleportation of electrons in a quantum dot nanostructure Deics III, 28 February 2006 Richard de Visser David DiVincenzo (IBM, Yorktown Heights)
Quantum Cryptography December, 3 rd 2007 Philippe LABOUCHERE Annika BEHRENS.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
Physics is becoming too difficult for physicists. — David Hilbert (mathematician)
QUANTUM ENTANGLEMENT AND IMPLICATIONS IN INFORMATION PROCESSING: Quantum TELEPORTATION K. Mangala Sunder Department of Chemistry IIT Madras.
Alice and Bob’s Excellent Adventure
Quantum Information, Communication and Computing Jan Kříž Department of physics, University of Hradec Králové Doppler Institute for mathematical physics.
Quantum Computing David Dvorak CIS 492. Quantum Computing Overview What is it? How does it work? –The basics –Clarifying with examples Factoring Quantum.
Memory Effect in Spin Chains Entanglement Distribution 12N Spin chains can be used as a channel for short distance quantum communication [1]. The basic.
Entangling without Entanglement T. Cubitt, F. Verstraete, W. Dür, J. I. Cirac “Separable State can be used to Distribute Entanglement” (to appear in PRL.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 2117 Lecture.
Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)
Aditi Sen (De) Harish-Chandra Research Institute, India.
Quantum information Theory: Separability and distillability SFB Coherent Control €U TMR J. Ignacio Cirac Institute for Theoretical Physics University of.
What is being plotted?. Answer: Number of papers with “quantum entanglement” in title or abstract N. D. Mermin, Phys. Rev. Lett. (1990) Entanglement is.
PRESENTED BY MIDHUN.T - EC 3 - S 61 TOPIC – QUANTUM TELEPORTATION Presented by - MIDHUN T EC 3, S 6 ROLL NO. 20 Reg no
The private capacities of a secret shared reference frame Patrick Hayden (McGill) with: PRA 75: (2005) ??? Stephen Bartlett Robert Spekkens arXiv:quant-ph/
Information Processing by Single Particle Hybrid Entangled States Archan S. Majumdar S. N. Bose National Centre for Basic Sciences Kolkata, India Collaborators:
Quantum Key Distribution Chances and Restrictions Norbert Lütkenhaus Emmy Noether Research Group Institut für Theoretische Physik I Universität Erlangen-Nürnberg.
Quantum Dense coding and Quantum Teleportation
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
What is Qu antum In formation and T echnology? Prof. Ivan H. Deutsch Dept. of Physics and Astronomy University of New Mexico Second Biannual Student Summer.
H ij Entangle- ment flow multipartite systems [1] Numerically computed times assuming saturated rate equations, along with the lower bound (solid line)
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
The Classically Enhanced Father Protocol
Recent Progress in Many-Body Theories Barcelona, 20 July 2007 Antonio Acín 1,2 J. Ignacio Cirac 3 Maciej Lewenstein 1,2 1 ICFO-Institut de Ciències Fotòniques.
Michael A. Nielsen University of Queensland Quantum Mechanics II: Examples Goals: 1.To apply the principles introduced in the last lecture to some illustrative.
1 entanglement-quantum teleportation entanglement-quantum teleportation entanglement (what is it?) quantum teleportation (intuitive & mathematical) ‘ quantum.
Nawaf M Albadia
Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.
Efficiency of Multi-Qubit W states in Information Processing Atul Kumar IPQI-2014 IIT Jodhpur
Quantum Entanglement and Distillation in Information Processing Shao-Ming Fei
Entanglement in Quantum Information Processing Samuel L. Braunstein University of York 25 April, 2004 Les Houches.
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
Basic Q.C. One moose, two moose Red moose, blue moose Live moose, dead moose.
Experimental Quantification of Entanglement in low dimensional Spin Systems Chiranjib Mitra IISER-Kolkata Quantum Information Processing and Applications.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Q UANTUM C OMMUNICATION Aditi Sen(De) Harish-Chandra Research Institute, India.
Quantum Cryptography Christian Schaffner Research Center for Quantum Software Institute for Logic, Language and Computation (ILLC) University of Amsterdam.
B OUNDS ON E NTANGLEMENT D ISTILLATION & S ECRET K EY A GREEMENT C APACITIES FOR Q UANTUM B ROADCAST C HANNELS Kaushik P. Seshadreesan Joint work with.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Distillation and determination of unknown two-qubit entanglement: Construction of optimal witness operator Heung-Sun Sim Physics, KAIST ESF conference:
Our Proposed Technique
Quantum Teleportation What does the future hold?.
Lecture from Quantum Mechanics. Marek Zrałek Field Theory and Particle Physics Department. Silesian University Lecture 11.
Institute of Physics (IOP), Bhubaneswar
ICNFP, Kolymbari, Crete, Greece August 28 – September 5, 2013
Unconstrained distillation capacities of
Quantum Teleportation
האם מכניקת הקוונטים יכולה לתת תאור שלם למציאות הפיסיקלית?
Lev Vaidman 23 August 2004, Cambridge Zion Mitrani Amir Kalev
Spin Many quantum experiments are done with photon polarization instead of electron spin Here is the correspondence between the two And the measurement.
Witness for Teleportation
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Presentation transcript:

Q UANTUM C OMMUNICATION P ART 2 Aditi Harish-Chandra Research Institute, India

O UTLINE Communication Secure Communication Quantum Cryptography Communication Without security Classical info transmission Classical info transmission Quantum state transmission

DC C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver Many Senders – Single Receiver Solved

Dense Coding Network 3

D ISTRIBUTED DC: T WO RECEIVERS Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 )

D ISTRIBUTED DC: T WO RECEIVERS Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 ) LOCC i1i1 i2i2

D ISTRIBUTED DC: T WO RECEIVERS Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 )

D ISTRIBUTED DC: T WO RECEIVERS Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 ) Alices send her particles to Bobs

D ISTRIBUTED DC: T WO RECEIVERS Bob (B 1 ) Bob (B 2 ) Bobs task: gather info abt i k by LOCC

D ISTRIBUTED DC: T WO RECEIVERS Bob (B 1 ) Bob (B 2 ) Bobs task: gather info abt i k by LOCC LOCC

C = Max D ISTRIBUTED DC: T WO RECEIVERS

C = Max Max LOCC Holevo bound Maximization over all encodings i.e. over all {p i, U i } D ISTRIBUTED DC: T WO RECEIVERS

C = Max Max LOCC Holevo bound Maximization over all encodings i.e. over all {p i, U i } Badziag, Horodecki, ASD, Sen, PRL’03 D ISTRIBUTED DC: T WO RECEIVERS

C = Max Max LOCC Holevo bound Maximization over all encodings i.e. over all {p i, U i } Bruss, D’Ariano, Lewenstein, Macchiavello, ASD, Sen, PRL’ 04 D ISTRIBUTED DC: T WO RECEIVERS

DC C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver Many Senders – Single Receiver Solved

DC C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver Many Senders – Single Receiver Solved Many Senders – Two Receivers

DC C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver Many Senders – Single Receiver Solved Many Senders – Two Receivers Partially Solved

DC C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver Many Senders – Single Receiver Solved Many Senders – Two Receivers Partially Solved Many Senders – Many Receivers Not Solved 

O UTLINE Communication Secure Communication Quantum Cryptography Communication Without security Classical info transmission Classical info transmission Quantum state transmission

Quantum Dense Coding Task: Classical info transmission Quantum Dense Coding Task: Classical info transmission Quantum Dense Coding

Task: Classical info transmission Medium: Quantum State Quantum Dense Coding Task: Classical info transmission Medium: Quantum State Quantum Dense Coding

Task: Classical info transmission Medium: Quantum State Quantum Dense Coding Task: Classical info transmission Medium: Quantum State Task: quantum state/info transmission Task: quantum state/info transmission Task: Quantum state/info transmission Task: Quantum state/info transmission Quantum Dense Coding

Task: Classical info transmission Medium: Quantum State Quantum Dense Coding Task: Classical info transmission Medium: Quantum State Task: Quantum state/info transmission Medium: Quantum State Task: Quantum state/info transmission Medium: Quantum State Quantum Dense Coding

Task: Classical info transmission Medium: Quantum State Task: Classical info transmission Medium: Quantum State Task: Quantum state/info transmission Medium: Quantum State Task: Quantum state/info transmission Medium: Quantum State Quantum Dense Coding Quantum Teleportation

Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters, PRL 1993

Q UANTUM T ELEPORTATION Task: Sending arbitrary quantum state

Q UANTUM T ELEPORTATION Task: Sending

Q UANTUM T ELEPORTATION Task: Sending

Q UANTUM T ELEPORTATION Task: Sending Classical: Infinite communication

Q UANTUM T ELEPORTATION Task: Sending Classical: Infinite communication

Q UANTUM T ELEPORTATION A in B Alice Bob

Q UANTUM T ELEPORTATION A in B Alice Bob Alice performs measurements on “in’’ and A

Q UANTUM T ELEPORTATION A in B Alice Bob After measurement

Q UANTUM T ELEPORTATION A in B Alice Bob After measurement 2 bits of classical comm. sent by Alice to Bob

Q UANTUM T ELEPORTATION A in B Alice Bob After measurement Bob performs unitary

Q UANTUM T ELEPORTATION A in B Alice Bob After measurement State is with Bob

M ORAL Classical Quantum Vs. Task: sending arbitrary quantum state Infinite classical comm 2 bits of classical comm

M ORAL Classical Quantum Task: sending arbitrary quantum state Infinite classical comm 2 bits of classical comm Vs.

I S IT MAGIC ?

Of course not!

I S IT MAGIC ? Ingredient: Quantum Mechanics

I S IT MAGIC ? Entangled states

W HAT IS ENTANGLEMENT ? Unentangled/Useless states : Entangled/Useful states :

W HAT IS ENTANGLEMENT ? Unentangled/Useless states : Entangled/Useful states :

W HAT IS ENTANGLEMENT ? Unentangled/Useless states : Entangled/Useful states :

Is it just theory ?

Experiments

P HOTONS

143 Km Teleportation

~100KM

E NTANGLEMENT S WAPPING Zukowski, Zeilinge, Horne, Ekert, PRL 71, 4287 (’93)

E NTANGLEMENT S WAPPING Zukowski, Zeilinge, Horne, Ekert, PRL 71, 4287 (’93)

P HOTONS Photons

P HOTONS Photons

IONS

IONS 14 ions entangled

ION E NTANGLED S TATES Phys. Rep. 2008

Quantum Teleportation between Light and Matter

Quantum Teleportation between Light and Matter

Quantum Teleportation between Light and Matter Polzik’s group, Nature 443, 557 (’06)

Quantum Teleportation between Light and Matter Polzik’s group, Nature 443, 557 (’06)

IONS: T ELEPORTATION

NMR Entangled states in NMR

T ELEPORTATION BY NMR

Nielsen, Knill, Laflamme, Nature 395 (’98)

O PTICAL L ATTICES

Entangled states in Optical lattices

O PTICAL L ATTICES Entangled states in Optical lattices

O PTICAL L ATTICES Resonating valence bond states in Optical lattices

T ELEPORTATION : N EUTRAL A TOMS Wu, Yang, Shen, Zheng, J. Phys. B: At. Mol. Opt. Phys. 46, (’13)

T ELEPORTATION : S PIN CHAIN 1. Initially the spin chain is in the ground state:

T ELEPORTATION : S PIN CHAIN 1. Initially the spin chain is in the ground state: 2. Alice places an arbitrary state at her end:

T ELEPORTATION : S PIN CHAIN 1. Initially the spin chain is in the ground state: 2. Alice places an arbitrary state at her end: 3. The state evolves according to some Hamiltonian:

T ELEPORTATION : S PIN CHAIN 1. Initially the spin chain is in the ground state: 2. Alice places an arbitrary state at her end: 3. The state evolves according to some Hamiltonian: 4. Bob receives the state after some time. Bose, PRL(’03), Subrahmanyam, PRA (’03)

Many other systems …….

Teleportation for arbitrary states

AB Alice & Bob share a state

AB

A in B Task: To send to Bob single copy of is available CdCd

A in B Allowed operations: LOCC

A in B Not allowed operations: exchange qubits

A in B Alice & Bob perform some LOCC, T,

A in B Alice & Bob perform some LOCC, T, and create at Bob’s side

A in B Alice & Bob perform some LOCC, T, and create at Bob’s side Check its closeness with

A in B Quantify closeness: integration over all inputs Teleportation fidelity

Singlet Fraction: : max singlet fraction from by LOCC Bennett, Divincenzo, Smolin, Wootters, PRA 54, 3824 (’97) MPR Horodeccy, PRA 60, 1888 (’99) M.A. Nielsen, quant-ph/

Singlet Fraction: : max singlet fraction from by LOCC Horodeccy, PRA 60, 1888 (’99) Nielsen, arXiv: Verstreate, Verschele, PRL 90, (’03)

Popescu, PRL 72, 797 (’94) Alice & Bob share separable state, then f max =2/3

T ELE C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver d  d Solved

Teleportation Network 1

T ELEPORTATION : M ONOGAMY Alice Debu Charu Nitu Bob SendersReceiver

T ELEPORTATION : M ONOGAMY Alice Debu Charu Nitu Bob SendersReceiver Teleportation monogamy Faithful teleportation cannot be freely performed

T ELEPORTATION : M ONOGAMY Tele mono ineq: Lee and Park, PRA 79, (’09)

T ELEPORTATION : M ONOGAMY Holds for pure states: Lee and Park, PRA 79, (’09)

T ELEPORTATION : M ONOGAMY Holds for pure states: Lee and Park, PRA 79, (’09) Follows from monogamy of concurrence squared in 2  d

T ELEPORTATION : M ONOGAMY Does Not hold for mixed states: Lee and Park, PRA 79, (’09)

Teleportation Network 2

T ELEPORTATION N ETWORK Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 ) ASD, U. Sen, PRA 81, (’01)

T ELEPORTATION N ETWORK Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 ) ASD, U. Sen, PRA 81, (’01)

T ELEPORTATION N ETWORK Alice (A 1 ) Alice (A 2 ) Bob (B 1 ) Bob (B 2 ) ASD, U. Sen, PRA 81, (’01) Establish relation between capacity & entanglement

T ELE C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver d  d Solved

T ELE C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver d  d Solved Many Senders – single Receiver Not Solved 

T ELE C APACITY : K NOWN /U NKNOWN Single Sender – Single Receiver d  d Solved Many Senders – single Receiver Not Solved  Many Senders – many Receiver Not Solved 

Single Sender – Single Receiver Many Senders – Single Receiver Solved Many Senders – Two Receivers Many Senders – Many Receivers Partially Solved Not Solved  Classical info transmit known/Unknown known/Unknown Quantum info transmission Single Sender – Single Receiver d  d Solved Many Senders – Single Receiver Not Solved  Many Senders – Many Receivers Not Solved 