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.

Slides:



Advertisements
Similar presentations
Entanglement in fermionic systems M.C. Bañuls, J.I. Cirac, M.M. Wolf.
Advertisements

I NFORMATION CAUSALITY AND ITS TESTS FOR QUANTUM COMMUNICATIONS I- Ching Yu Host : Prof. Chi-Yee Cheung Collaborators: Prof. Feng-Li Lin (NTNU) Prof. Li-Yi.
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 data locking, enigma machines and entropic uncertainty relations Saikat Guha, Patrick Hayden, Hari Krovi, Seth Lloyd, Cosmo Lupo, Jeffrey H. Shapiro,
Erasing correlations, destroying entanglement and other new challenges for quantum information theory Aram Harrow, Bristol Peter Shor, MIT quant-ph/
Short course on quantum computing Andris Ambainis University of Latvia.
Quantum communication from Alice to Bob Andreas Winter, Bristol quant-ph/ Aram Harrow, MIT Igor Devetak, USC.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
A Family of Quantum Protocols Igor Devetak, IBM Aram Harrow, MIT Andreas Winter, Bristol quant-ph/ IEEE Symposium on Information Theory June 28,
Future Challenges in Long-Distance Quantum Communication Jian-Wei Pan Hefei National Laboratory for Physical Sciences at Microscale, USTC and Physikalisches.
CSEP 590tv: Quantum Computing
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Quantum Cryptography Prafulla Basavaraja CS 265 – Spring 2005.
Coherent Classical Communication Aram Harrow (MIT) quant-ph/
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Erasing correlations, destroying entanglement and other new challenges for quantum information theory Aram Harrow, Bristol Peter Shor, MIT quant-ph/
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Quantum Communication, Quantum Entanglement and All That Jazz Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering,
Quantum Shannon Theory Patrick Hayden (McGill) 17 July 2005, Q-Logic Meets Q-Info.
Is Communication Complexity Physical? Samuel Marcovitch Benni Reznik Tel-Aviv University arxiv
Witnesses for quantum information resources Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata, India Collaborators: S. Adhikari,
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
Feynman Festival, Olomouc, June 2009 Antonio Acín N. Brunner, N. Gisin, Ll. Masanes, S. Massar, M. Navascués, S. Pironio, V. Scarani Quantum correlations.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
The Operational Meaning of Min- and Max-Entropy
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography (III)
Equality Function Computation (How to make simple things complicated) Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Guanfeng.
Test for entanglement: realignment criterion, entanglement witness and positive maps Kai Chen † CQIQC, Toronto, July 2004 † Kai Chen is now a postdoctoral.
Quantum information Theory: Separability and distillability SFB Coherent Control €U TMR J. Ignacio Cirac Institute for Theoretical Physics University of.
QCCC07, Aschau, October 2007 Miguel Navascués Stefano Pironio Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Cryptographic properties of.
Experimental generation and characterisation of private states Paweł Horodecki Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska.
Device-independent security in quantum key distribution Lluis Masanes ICFO-The Institute of Photonic Sciences arXiv:
Rei Safavi-Naini University of Calgary Joint work with: Hadi Ahmadi iCORE Information Security.
Q UANTUM C OMMUNICATION P ART 2 Aditi Harish-Chandra Research Institute, India.
1 A Randomized Space-Time Transmission Scheme for Secret-Key Agreement Xiaohua (Edward) Li 1, Mo Chen 1 and E. Paul Ratazzi 2 1 Department of Electrical.
The Operational Meaning of Min- and Max-Entropy Christian Schaffner – CWI Amsterdam, NL joint work with Robert König – Caltech Renato Renner – ETH Zürich,
Multi-Partite Squeezing and SU (1,1) Symmetry Zahra Shaterzadeh Yazdi Institute for Quantum Information Science, University of Calgary with Peter S. Turner.
Quantum Teleportation and Bit Commitment Chi-Yee Cheung Chung Yuan Christian University June 9, 2009.
A reversible framework for entanglement and other resource theories Fernando G.S.L. Brandão Universidade Federal de Minas Gerais, Brazil Martin B. Plenio.
Borsós, K.; Benedict, M. G. University of Szeged, Szeged, Hungary Animation of experiments in modern quantum physics Animation of experiments in modern.
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
Copyright © 2006 Keio University Applications of an Entangled Quantum Internet Conference on Future Internet Technologies Seoul, Korea June 20, 2008 Rodney.
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/
Quantum correlations with no causal order OgnyanOreshkov, Fabio Costa, ČaslavBrukner Bhubaneswar arXiv: December2011 Conference on Quantum.
Quantum correlations with no causal order OgnyanOreshkov, Fabio Costa, ČaslavBrukner Bhubaneswar arXiv: December2011 Conference on Quantum.
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.
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
Quantum Coding with Entanglement Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of Southern.
Optimal Trading of Classical Communication, Quantum Communication, and Entanglement Mark M. Wilde arXiv: ERATO-SORST Min-Hsiu Hsieh 4 th Workshop.
Uni-Heidelberg Physikalisches Insitut Jian-Wei Pan Multi-Particle Entanglement & It’s Application in Quantum Networks Jian-Wei Pan Lecture Note.
A generalization of quantum Stein’s Lemma Fernando G.S.L. Brandão and Martin B. Plenio Tohoku University, 13/09/2008.
Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.
1 Conference key-agreement and secret sharing through noisy GHZ states Kai Chen and Hoi-Kwong Lo Center for Quantum Information and Quantum Control, Dept.
On Minimum Reversible Entanglement Generating Sets Fernando G.S.L. Brandão Cambridge 16/11/2009.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
1 WELCOME Chen. 2 Simulation of MIMO Capacity Limits Professor: Patric Ö sterg å rd Supervisor: Kalle Ruttik Communications Labortory.
Quantum Cryptography Antonio Acín
Q UANTUM C OMMUNICATION Aditi Sen(De) Harish-Chandra Research Institute, India.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
Fernando G.S.L. Brandão and Martin B. Plenio
ICNFP, Kolymbari, Crete, Greece August 28 – September 5, 2013
Information-Theoretical Analysis of the Topological Entanglement Entropy and Multipartite correlations Kohtaro Kato (The University of Tokyo) based on.
Unconditional Security of the Bennett 1992 quantum key-distribution protocol over a lossy and noisy channel Kiyoshi Tamaki * *Perimeter Institute for.
Unconstrained distillation capacities of
On Monogamy of Measurement Induced Non-locality
Presentation transcript:

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 Masahiro Takeoka & Mark M. Wilde arXiv: [quant-ph] QIPA, HRI, 12/12/2015

M OTIVATION 2

Point-to-point Links Trusted Relay nodes End-user domain End-user domain End-user domain Q UANTUM N ETWORKS Secure Classical Communication Distributed Quantum Information Processing (QIP) 3 Secret Key Agreement (SKA) Entanglement Distillation (ED) One-Time Pad Secure Classical Communication Teleportation Quantum Communication

Charlie Q UANTUM N ETWORKS Our Focus  Multiuser Secret Key Agreement Multipartite Entanglement Distillation 4 Alice Bob Quantum Internet End-User Domain

2) A Quantum Broadcast Network. Townsend Nature 385, 47–49 (1997) E ND -U SER D OMAIN : P OSSIBLE A RCHITECTURES 5 3) A Quantum Access Network. Bernd Frohlich et al. Nature 501, 69–72 (2013) 1) Point-to-Point Links between each pair of users. Prohibitively Expensive!!

B ACKGROUND 6

Rate-loss tradeoff SKA AND ED OVER POINT - TO - POINT LINKS 7 Takeoka, Guha & Wilde Nature Comm. (2014) Main tool used: Squashed Entanglement  A fundamental limitation of the optical comm. channel. Pirandola et al., arXiv: Reverse Coherent Information Lower Bound

O UR C ONTRIBUTION Rate-loss tradeoffs for SKA and ED over quantum broadcast channels Main tool: Multipartite Squashed Entanglement 8 Yang et al. (2009)

O UTLINE Setting up the Arena Entanglement Distillation and Secret Key Agreement over a Quantum Broadcast Channel Protocol: One-sender two-receiver case Tool Multipartite Squashed Entanglement Bounds for ED and SKA over a QBC Open Questions and Conclusions 9

S ETTING UP THE A RENA : E NTANGLEMENT D ISTILLATION & S ECRET K EY A GREEMENT OVER A Q UANTUM B ROADCAST C HANNEL 10

A Q UANTUM B ROADCAST C HANNEL QBC as a resource to generate shared entanglement and shared secret key Other available resources: Local Operations and Classical Communication (LOCC) for ED Local Operations and Public Class. Comm. (LOPC) for SKA 11

E NTANGLEMENT D ISTILLATION Distilling generalized “ GHZ states” under unlimited LOCC A bipartite maximally entangled state: Entanglement Distillation Capacity of a Channel: Largest achievable rate of distilling maximally entangled states using the channel along with unlimited two-way LOCC. 12 An m -partite GHZ state:

S ECRET K EY A GREEMENT Key Distillation under LOPC  “ Private State ” Distillation under LOCC A bipartite Private State: Explicit form: 13 Shield Systems Twisting Unitary Shared Secret Key Measurement Maps. (In general, POVMs) A purification of the state Horodecki et al., IEEE Trans. Inf. Theory 55, 1898 (2009)

S ECRET K EY A GREEMENT Key Distillation under LOPC  “ Private State ” Distillation under LOCC An m -partite Private State: Secret-Key Agreement Capacity of a Channel: Largest achievable rate of distilling private states using the channel along with unlimited two-way LOCC. 14 Shield Systems Twisting Unitary Augusiak & P Horodecki, Phys. Rev. A 80, (2009)

ED AND SKA OVER A QBC E.g., consider a one-sender two-receiver QBC 15 Charlie Alice Bob Power Set of S (sans null and singleton elements) Ideal State of Interest: where, etc.

P ROTOCOL : O NE - SENDER TWO - RECEIVER CASE 16

We define a (n, E AB, E AC, E BC, E ABC, K AB, K AC, protocol as follows: Initial state  Separable: State after i th channel use: State after (i+1) th round of LOCC: State after n channel uses: such that P ROTOCOL 17 Ideal state

C APACITY R EGION Achievable Rate: A tuple is achievable is for all ε≥ 0 and sufficiently large n, there exists a protocol of the above type. Capacity Region: Closure of all achievable rates. 18

T OOL : M ULTIPARTITE S QUASHED E NTANGLEMENT 19

S QUASHED E NTANGLEMENT (B IPARTITE ) Definition: Christandl & Winter (2004) For a bipartite state Eve tries her best to “squash down” the correlations between Alice and Bob. Upper bounds on ED and SKA rates for point-to- point channels. Takeoka, Guha and Wilde (2014) 20

P ROPERTIES Monotone non-increasing under LOCC Normalized on maximally entangled states Asymptotically Continuous Additive on tensor-product states 21

Definition(s): Yang et al. (2009) For an m- partite state S QUASHED E NTANGLEMENT ( S ) (M ULTIPARTITE ) 22 Incomparable

Definition(s): Yang et al. (2009) For an m- partite state Eve tries her best to “squash down” the correlations between the m parties. Upper bounds on ED and SKA rates for Quantum Broadcast Channels. Seshadreesan, Takeoka and Wilde (2015) S QUASHED E NTANGLEMENT ( S ) (M ULTIPARTITE ) 23

P ROPERTIES AND SOME NOTATION Normalization on MES and Private States 24 LOCC monotone, Continuous and Additive on tensor- product states

B OUNDS FOR ED AND SKA OVER A Q UANTUM B ROADCAST C HANNEL 25

B OUNDS FOR A ONE - SENDER TWO - RECEIVER QBC 26

P ROOF S KETCH Considerand its different partitions: 1. Consider the ideal state Additivity of SqE. on tensor product states 2 Normalization of SqE. on MES and Private states

P ROOF S KETCH Well, actually, rate defined as “per channel use”. So, 2. Continuity of Squashed Entanglement If 3. Monotonicity under LOCC 28 then

4. A TGW-type subadditivity inequality Consider a pure state. Then, P ROOF S KETCH 29

P ROOF S KETCH Repeated application of the TGW-type subadditivity and monotonicity under LOCC gives Therefore, 30 where Single Letter bound! Time sharing Register

O PEN Q UESTIONS AND C ONCLUSIONS 31

O PEN Q UESTIONS Similar bounds for a Multiple Access Channel (MAC) Bounds for a QBC and a MAC in the presence of quantum repeaters Protocols for ED and SKA over QBC and MAC 32

C ONCLUSIONS Considered ED and SKA over a QBC Described a LOCC protocol for the above task Studied a multipartite squashed entanglement Used it to upper bound rates for ED and SKA over QBC The bounds are single-letter 33

34 Thank you for your attention!

P URE -L OSS B OSONIC B ROADCAST C HANNEL E.g., consider a three-way beamsplitter 35 Mean photon number Constraint

36 B OUNDS ON ED AND SKA FOR A P URE - L OSS B OSONIC B ROADCAST C HANNEL

37 B OUNDS ON ED AND SKA FOR A P URE - L OSS B OSONIC B ROADCAST C HANNEL

P ROOF S KETCH Consider that Due to the extremality of Gaussian states for conditional entropy, we have the optimal entropies where 38, etc. Correspond to thermal states of mean photon number x

P ROOF S KETCH Further, for monotonically increasing Also, Therefore, 39 By picking Because the function is convex And similarly, the other bounds…