A Classical Analog to Entanglement Reversibility

Add to your list(s) Download to your calendar using vCal

• University of Technology Sydney
• Friday 01 May 2015, 12:00-13:00
• MR14, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact Sergii Strelchuk.

In this letter we introduce the problem of secrecy reversibility. This asks when two honest parties can distill secret bits from some tripartite distribution pXYZ and transform secret bits back into pXYZ at equal rates using local operation and public communication (LOPC). This is the classical analog to the well-studied problem of reversibly concentrating and diluting entanglement in a quantum state. We identify the structure of distributions possessing reversible secrecy when one of the honest parties holds a binary distribution, and it is possible that all reversible distributions have this form. These distributions are more general than what is obtained by simply constructing a classical analog to the family of quantum states known to have reversible entanglement. An indispensable tool used in our analysis is a conditional form of the Gacs-Korner Common Information.

This talk is part of the CQIF Seminar series.

This talk is included in these lists:

• All CMS events
• CMS Events
• CQIF Seminar
• DAMTP info aggregator
• Hanchen DaDaDash
• Interested Talks
• MR14, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• bld31

Note that ex-directory lists are not shown.