The Classically Enhanced Father Protocol

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

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.
Gillat Kol (IAS) joint work with Ran Raz (Weizmann + IAS) Interactive Channel Capacity.
Quantum Cryptography ( EECS 598 Presentation) by Amit Marathe.
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/
Enhancing Secrecy With Channel Knowledge
Michael A. Nielsen University of Queensland Quantum entropy Goals: 1.To define entropy, both classical and quantum. 2.To explain data compression, and.
Classical capacities of bidirectional channels Charles Bennett, IBM Aram Harrow, MIT/IBM, Debbie Leung, MSRI/IBM John Smolin,
UCB Claude Shannon – In Memoriam Jean Walrand U.C. Berkeley
Lihua Weng Dept. of EECS, Univ. of Michigan Error Exponent Regions for Multi-User Channels.
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.
Fundamental limits in Information Theory Chapter 10 :
DEFENSE!. Applications of Coherent Classical Communication and Schur duality to quantum information theory Aram Harrow MIT Physics June 28, 2005 Committee:
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.
Future Challenges in Long-Distance Quantum Communication Jian-Wei Pan Hefei National Laboratory for Physical Sciences at Microscale, USTC and Physikalisches.
General Entanglement-Assisted Quantum Error-Correcting Codes Todd A. Brun, Igor Devetak and Min-Hsiu Hsieh Communication Sciences Institute QEC07.
A Graph-based Framework for Transmission of Correlated Sources over Multiuser Channels Suhan Choi May 2006.
Space Time Block Codes Poornima Nookala.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
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.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
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.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Quantum Information, Communication and Computing Jan Kříž Department of physics, University of Hradec Králové Doppler Institute for mathematical physics.
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.
Channel Capacity
Function Computation over Heterogeneous Wireless Sensor Networks Xuanyu Cao, Xinbing Wang, Songwu Lu Department of Electronic Engineering Shanghai Jiao.
Secure Communication for Distributed Systems Paul Cuff Electrical Engineering Princeton University.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
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/
Cooperative Communication in Sensor Networks: Relay Channels with Correlated Sources Brian Smith and Sriram Vishwanath University of Texas at Austin October.
Communication System A communication system can be represented as in Figure. A message W, drawn from the index set {1, 2,..., M}, results in the signal.
Quantum signal processing Aram Harrow UW Computer Science & Engineering
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/
University of Massachusetts Amherst · Department of Computer Science Square Root Law for Communication with Low Probability of Detection on AWGN Channels.
Superposition encoding A distorted version of is is encoded into the inner codebook Receiver 2 decodes using received signal and its side information Decoding.
Nawaf M Albadia
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.
Optimal Trading of Classical Communication, Quantum Communication, and Entanglement Mark M. Wilde arXiv: ERATO-SORST Min-Hsiu Hsieh 4 th Workshop.
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.
CS294-9 :: Fall 2003 Joint Source/Channel Coding Ketan Mayer-Patel.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Quantum Cryptography Antonio Acín
Entanglement and Optimal Strings of Qubits for Memory Channels Laleh Memarzadeh Sharif University of Technology IICQI 7-10 Sept 2007 Kish Island.
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.
Coherent Communication of Classical Messages Aram Harrow (MIT) quant-ph/
Channel Coding Theorem (The most famous in IT) Channel Capacity; Problem: finding the maximum number of distinguishable signals for n uses of a communication.
Non-Locality Swapping and emergence of quantum correlations Nicolas Brunner Paul Skrzypczyk, Sandu Popescu University of Bristol.
The Concavity of the Auxiliary Function for Classical-Quantum Channels Speaker: Hao-Chung Cheng Co-work: Min-Hsiu Hsieh Date: 01/09/
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
Using Secret Key to Foil an Eavesdropper
Presentation transcript:

The Classically Enhanced Father Protocol Mark M. Wilde Centre for Quantum Technologies National University of Singapore 3 Science Drive 2 Singapore 117543 (based on joint work with Min-Hsiu Hsieh: arXiv:0811.4227) Seminar, USC (December 15, 2008)

Singapore Bird….

Outline Briefly review Quantum Shannon theory Entanglement-Assisted Quantum Channel Coding (Father Protocol) The Classically-Enhanced Father Protocol

Shannon Theory Claude Shannon established classical information theory Two fundamental theorems: Noiseless source coding Noisy channel coding Shannon theory gives optimal limits for transmission of bits (really just using the Law of Large Numbers) C. E. Shannon, Bell System Technical Journal, vol. 27, pp. 379-423 and 623-656, July and October, 1948.

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

Problem Description Given a large number of uses of a noisy quantum channel and some entanglement, How much quantum and classical information can we send? Hsieh and Wilde, arXiv:0811.4227, November 2008.

Entanglement-Assisted Quantum Channel Coding Coding Strategy Use the channel many times so that law of large numbers comes into play Relate the construction to secret-key-assisted private classical coding over a quantum channel (extension of Devetak’s ideas) Show how to construct a secret-key-assisted private classical code and how to perform each of the steps coherently Devetak, Harrow, Winter, IEEE Trans. Information Theory vol. 54, no. 10, pp. 4587-4618, Oct 2008 Hsieh, Luo, Brun, Physical Review A, 78, 042306 (2008). Hsieh and Wilde, arXiv:0811.4227, November 2008.

Father Protocol Devetak, Harrow, Winter, IEEE Trans. Information Theory vol. 54, no. 10, pp. 4587-4618, Oct 2008 Devetak, Harrow, Winter, Phys. Rev. Lett., 93, 230504 (2004).

Can achieve the following resource inequality: Father Protocol Can achieve the following resource inequality: where Devetak, Harrow, Winter, IEEE Trans. Information Theory vol. 54, no. 10, pp. 4587-4618, Oct 2008 Devetak, Harrow, Winter, Phys. Rev. Lett., 93, 230504 (2004).

Father Capacity Region Single-Letter Region: Capacity region of the channel: Devetak, Harrow, Winter, IEEE Trans. Information Theory vol. 54, no. 10, pp. 4587-4618, Oct 2008 Devetak, Harrow, Winter, Phys. Rev. Lett., 93, 230504 (2004).

Father Code Definitions Unencoded State: where Encoded State: Hsieh and Wilde, arXiv:0811.4227, November 2008.

Father Code Definitions (Ctd.) Father Code density operator: Channel input density operator: Hsieh and Wilde, arXiv:0811.4227, November 2008.

code density operator: channel input density operator: Random Father Codes Random father code is an ensemble of father codes: Expected code density operator: Expected channel input density operator: Can make expected input close to a tensor power state! HSW coding theorem accepts tensor power input states! Hsieh and Wilde, arXiv:0811.4227, November 2008.

“Piggybacking” Classical Information Given an ensemble: Given a typical input sequence: Can rewrite typical input sequence as follows: Choose |X| father codes each with Quantum communication rate: Entanglement Consumption rate: Devetak and Shor, Communications in Mathematical Physics, 256, 287-303 (2005) Hsieh and Wilde, arXiv:0811.4227, November 2008.

“Piggybacking” Classical Information (ctd.) “Pasted” random father code has total rates: Total Quantum Communication rate: Total Entanglement Consumption rate: Can piggyback classical information with rate By the HSW coding theorem Devetak and Shor, Communications in Mathematical Physics, 256, 287-303 (2005) Hsieh and Wilde, arXiv:0811.4227, November 2008.

Proof Strategy for Coding Theorem Random Coding Show that expectation of average classical error probability and quantum error over all random classically-enhanced father codes is small Pick one that has small error. Derandomization Expurgation Remove the father codes from the classically-enhanced father code that have the worst classical error probability. Ensures that resulting code has low maximal classical error probability. Hey, that’s my idea!!!! Hsieh and Wilde, arXiv:0811.4227, November 2008.

Proof Strategy for Converse Theorem Proof that bounds quantum communication rate and entanglement consumption rate follows standard techniques Resort to optimality of Shor’s entanglement-assisted classical capacity theorem to prove the bound on classical communication rate Hsieh and Wilde, arXiv:0811.4227, November 2008. Shor, quant-ph/0402129 (2004).

Hsieh and Wilde, arXiv:0811.4227, November 2008. Theorem Statement Single-Letter Capacity Region: Hsieh and Wilde, arXiv:0811.4227, November 2008.

Child Protocols Classically-Enhanced Father Resource Inequality: Combine with entanglement distribution to get the classically-enhanced quantum coding resource inequality: Combine with dense coding to get Shor’s entanglement-assisted classical coding resource inequality: Devetak and Shor, Communications in Mathematical Physics, 256, 287-303 (2005) Hsieh and Wilde, arXiv:0811.4227, November 2008.

The Issue of Time-Sharing Can time-sharing beat the classically-enhanced father protocol? Three time-sharing strategies: Share quantum code with EA classical code Share EA quantum code with classical code Share EA quantum code with EA classical code Time-sharing is NOT optimal when entanglement = 0 Time-sharing IS optimal with infinite entanglement Hsieh and Wilde, arXiv:0811.4227, November 2008.

Structure of Optimal Codes Optimal code does NOT need to encode classical info into ebits Kremsky, Hsieh, and Brun, PRA, 78, 012341 (2008). Hsieh and Wilde, arXiv:0811.4227, November 2008.

The Full Triple Trade-off Q E Unit resource capacity region consists of rate triples (R,Q,E) Entanglement Distribution (0, -t, t) Superdense coding Teleportation (2t, -t, -t) (-2t, t, -t) Combine Classically-Enhanced Father protocol with unit resource inequalities to get Full Triple Trade-off

Conclusion Several open questions remaining: Classically-Enhanced Father Protocol is a step in getting the Full Triple Trade-off Gives insight into Error Correction schemes Several open questions remaining: More resources to include: common randomness, private classical communication, secret key Six-dimensional trade-off regions for multiple-access and broadcast channels