Finite blocklength converse bounds for quantum channels

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

• Will Matthews (University of Cambridge)
• Thursday 11 October 2012, 14:15-15:15
• MR4, Centre for Mathematical Sciences.

If you have a question about this talk, please contact Paul Skrzypczyk.

I’ll talk about joint work with Stephanie Wehner in which we derive upper bounds on the rate of transmission of classical information over quantum channels by block codes with a given blocklength and error probability, for both entanglement-assisted and unassisted codes, in terms of a unifying framework of quantum hypothesis testing with restricted measurements. Our bounds do not depend on any special property of the channel (such as memorylessness) and generalise both a classical converse of Polyanskiy, Poor, and Verdu as well as a quantum converse of Renner and Wang, and have a number of desirable properties. In particular our bound on entanglement-assisted codes is a semidefinite program and for memoryless channels its large n limit is the well known formula for entanglement-assisted capacity due to Bennett, Shor, Smolin and Thapliyal.

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
• MR4, Centre for Mathematical Sciences
• bld31

Note that ex-directory lists are not shown.