Optimal Trading of Classical Communication, Quantum Communication, and Entanglement Mark M. Wilde arXiv:0901.3038 ERATO-SORST Min-Hsiu Hsieh 4 th Workshop.

Slides:



Advertisements
Similar presentations
Entanglement Boosts Quantum Turbo Codes Mark M. Wilde School of Computer Science McGill University Seminar for the Quantum Computing Group at McGill Montreal,
Advertisements

Quantum Information Theory But, we are going to be even more ridiculous later and consider bits written on one atom instead of the present atoms.
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.
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,
1 Information complexity and exact communication bounds April 26, 2013 Mark Braverman Princeton University Based on joint work with Ankit Garg, Denis Pankratov,
Enhancing Secrecy With Channel Knowledge
Network Coding in Peer-to-Peer Networks Presented by Chu Chun Ngai
Information Theoretical Security and Secure Network Coding NCIS11 Ning Cai May 14, 2011 Xidian University.
Quantum information as high-dimensional geometry Patrick Hayden McGill University Perspectives in High Dimensions, Cleveland, August 2010.
Classical capacities of bidirectional channels Charles Bennett, IBM Aram Harrow, MIT/IBM, Debbie Leung, MSRI/IBM John Smolin,
Quantum communication from Alice to Bob Andreas Winter, Bristol quant-ph/ Aram Harrow, MIT Igor Devetak, USC.
PAUL CUFF ELECTRICAL ENGINEERING PRINCETON UNIVERSITY A Framework for Partial Secrecy.
Quantum Error Correction Michele Mosca. Quantum Error Correction: Bit Flip Errors l Suppose the environment will effect error (i.e. operation ) on our.
Superdense coding. How much classical information in n qubits? Observe that 2 n  1 complex numbers apparently needed to describe an arbitrary n -qubit.
DEFENSE!. Applications of Coherent Classical Communication and Schur duality to quantum information theory Aram Harrow MIT Physics June 28, 2005 Committee:
Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.
A Family of Quantum Protocols Igor Devetak, IBM Aram Harrow, MIT Andreas Winter, Bristol quant-ph/ IEEE Symposium on Information Theory June 28,
Toyohiro Tsurumaru (Mitsubishi Electric Corporation) Masahito Hayashi (Graduate School of Information Sciences, Tohoku University / CQT National University.
General Entanglement-Assisted Quantum Error-Correcting Codes Todd A. Brun, Igor Devetak and Min-Hsiu Hsieh Communication Sciences Institute QEC07.
Coherent Classical Communication Aram Harrow (MIT) quant-ph/
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 Convolutional Coding with Entanglement Assistance Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering,
Quantum Communication, Quantum Entanglement and All That Jazz Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering,
Channel Polarization and Polar Codes
Quantum Shannon Theory Patrick Hayden (McGill) 17 July 2005, Q-Logic Meets Q-Info.
Introduction to Quantum Shannon Theory Patrick Hayden (McGill University) 12 February 2007, BIRS Quantum Structures Workshop | 
PAUL CUFF ELECTRICAL ENGINEERING PRINCETON UNIVERSITY Secure Communication for Distributed Systems.
Coding Schemes for Multiple-Relay Channels 1 Ph.D. Defense Department of Electrical and Computer Engineering University of Waterloo Xiugang Wu December.
ENTROPIC CHARACTERISTICS OF QUANTUM CHANNELS AND THE ADDITIVITY PROBLEM A. S. Holevo Steklov Mathematical Institute, Moscow.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
The Operational Meaning of Min- and Max-Entropy
Runtime Authentication in Highly-Secured Network Systems Iftakhar Ahmad Department of Computer Science and Engineering.
Christian Schaffner CWI Amsterdam, Netherlands Quantum Cryptography beyond Key Distribution Workshop on Post-Quantum Security Models Paris, France Tuesday,
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 19 (2009)
What is being plotted?. Answer: Number of papers with “quantum entanglement” in title or abstract N. D. Mermin, Phys. Rev. Lett. (1990) Entanglement is.
Quantum Convolutional Coding for Distillation and Error Correction Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical.
The private capacities of a secret shared reference frame Patrick Hayden (McGill) with: PRA 75: (2005) ??? Stephen Bartlett Robert Spekkens arXiv:quant-ph/
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,
Counterexamples to the maximal p -norm multiplicativity conjecture Patrick Hayden (McGill University) || | | N(½)N(½) p C&QIC, Santa Fe 2008.
Andrew Liau, Shahram Yousefi, Senior Member, IEEE, and Il-Min Kim Senior Member, IEEE Binary Soliton-Like Rateless Coding for the Y-Network IEEE TRANSACTIONS.
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
CS555Topic 251 Cryptography CS 555 Topic 25: Quantum Crpytography.
Bell Measurements and Teleportation. Overview Entanglement Bell states and Bell measurements Limitations on Bell measurements using linear devices Teleportation.
Quantum Information Theory Patrick Hayden (McGill) 4 August 2005, Canadian Quantum Information Summer School.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
The Classically Enhanced Father Protocol
Michael A. Nielsen University of Queensland Quantum Mechanics II: Examples Goals: 1.To apply the principles introduced in the last lecture to some illustrative.
Nawaf M Albadia
Quantum Steering in the Gaussian World Ioannis Kogias, A. Lee, S. Ragy and G. Adesso University of Nottingham To appear on arXiv: [quant-ph]
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.
Quantum Convolutional Coding Techniques Mark M. Wilde Communication Sciences Institute, Ming Hsieh Department of Electrical Engineering, University of.
Detecting Incapacity Graeme Smith IBM Research Joint Work with John Smolin QECC 2011 December 6, 2011 TexPoint fonts used in EMF. Read the TexPoint manual.
Coherent Classical Communication Aram Harrow, MIT Quantum Computing Graduate Research Fellow Objective Objective ApproachStatus Determine.
Interactive Channel Capacity. [Shannon 48]: A Mathematical Theory of Communication An exact formula for the channel capacity of any noisy channel.
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.
Gillat Kol (IAS) joint work with Anat Ganor (Weizmann) Ran Raz (Weizmann + IAS) Exponential Separation of Information and Communication.
Quantum Cryptography Antonio Acín
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/
1 Transactional Nature of Quantum Information Subhash Kak Computer Science, Oklahoma State Univ © Subhash Kak, June 2009.
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
The Concavity of the Auxiliary Function for Classical-Quantum Channels Speaker: Hao-Chung Cheng Co-work: Min-Hsiu Hsieh Date: 01/09/
Unconstrained distillation capacities of
Using Secret Key to Foil an Eavesdropper
Introducing complex networks into quantum regime
Presentation transcript:

Optimal Trading of Classical Communication, Quantum Communication, and Entanglement Mark M. Wilde arXiv: ERATO-SORST Min-Hsiu Hsieh 4 th Workshop on the Theory of Quantum Computation, Communication and Cryptography, Wednesday, May 13, 2009 SAIC

Quantum Shannon theory Overview Prior research Unit Resource Capacity Region Dynamic Setting Static Setting Implications for Quantum Coding Theory

Quantum Shannon Theory Quantum information has three fundamentally different resources: 1.Quantum bit (qubit) 2.Classical bit (cbit) 3.Entangled bit (ebit) Quantum Shannon theory— consume or generate these different resources with the help of 1.Noisy quantum channel (dynamic setting) 2.Shared noisy quantum state (static setting) I. Devetak, A. Harrow, A. Winter, IEEE Trans. Information Theory vol. 54, no. 10, pp , Oct 2008

Dynamic Setting Prior Work Devetak, Harrow, Winter. IEEE Trans. Inf. Theory, (2008)

Static Setting Prior Work Devetak, Harrow, Winter. IEEE Trans. Inf. Theory, (2008)

R Q E The Unit Resource Capacity Region Unit resource capacity region consists of rate triples (R,Q,E) Superdense coding Teleportation Entanglement Distribution (2t, -t, -t) (-2t, t, -t) (0, -t, t) What if only noiseless resources?

Converse Proof for Unit Capacity Region Show that region given by R + Q + E <= 0 Q + E <= 0 ½ R + Q <= 0 is optimal for all octants Use as postulates: (1) Entanglement alone cannot generate classical communication or quantum communication or both. (2) Classical communication alone cannot generate entanglement or quantum communication or both.

Example of Proof Strategy Suppose this point corresponds to a protocol Then use all entanglement and more quantum comm. with super-dense coding: Consider a point (R,-|Q|,E) in the octant (+,-,+) R Q E New point corresponds to a protocol. (R,-|Q|,E) + (2E,-E,-E) = (R+2E,-|Q|-E,0) R + 2E <= |Q| + E Holevo bound applies

Static Setting Need a direct coding theorem and a matching converse proof General form of resource inequality: Positive rate Negative rate Resource on RHS (as shown) Resource generated Resource implicitly on LHS Resource consumed

“Grandmother” Protocol Devetak, Harrow, Winter. IEEE Trans. Inf. Theory, (2008)

Perform Instrument Compression with Quantum Side Information uses techniques from Winter’s Instrument Compression and Devetak-Winter Classical Compression with Quantum Side Information (Also see Renes and Boileau “Optimal state merging without decoupling”) Classically-Assisted Quantum State Redistribution (for Direct Static) Begin with statethat has purification Requires rate of classical communication (and some common randomness) Then perform Quantum State Redistribution conditional on classical information

Classically-Assisted Quantum State Redistribution (for Direct Static)

Direct Static Achievable Region Combine the Classically-Assisted State Redistribution Protocol with the Unit Resource Capacity Region to get the Direct Static Achievable Region Need to show that this strategy is Optimal Off we go, octant by octant…

Example of Converse Proof (Direct Static) Can use all entanglement and more quantum comm. with super-dense coding Consider a point (R,-|Q|,E) in the capacity region of the octant (+,-,+) R Q E Point goes into (+,-,0) quadrant Quadrant corresponds to Noisy Super-dense Coding Essentially resort to the optimality of noisy super-dense coding (NSD special case of CASR with unit protocols)

Dynamic Setting Need a direct coding theorem and a matching converse proof General form of resource inequality: Positive rate Negative rate Resource on RHS (as shown) Resource generated Resource implicitly on LHS Resource consumed

Classically-Enhanced Father Protocol Hsieh and Wilde, arXiv: , November 2008.

Direct Dynamic Achievable Region Combine the Classically-Enhanced Father Protocol with the Unit Resource Capacity Region to get the Direct Dynamic Achievable Region Need to show that this strategy is Optimal Again, octant by octant…, similarly Except!

Octant (-,+,-) Relevant for the theory of entanglement-assisted coding Why not teleportation? when quantum channel coding (or EA coding) and teleportation is best: Q > |R|/2 > E or Q > |R|/2 and E > |R|/2 or E < Q < |R|/2 Quantum Shannon theory now states: when teleportation alone is best: Q < |R|/2 < E or Q < E < |R|/2

Current Directions Investigated the abilities of a simultaneous noisy static and noisy dynamic resource (arXiv: ) Investigating the triple trade-off for public communication, private communication, and secret key (finished dynamic, wrapping up static, posting soon) THANK YOU!