BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CQIF Seminar
SUMMARY:Finite blocklength converse bounds for quantum cha
nnels - Will Matthews (University of Cambridge)
DTSTART;TZID=Europe/London:20121011T141500
DTEND;TZID=Europe/London:20121011T151500
UID:TALK40584AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/40584
DESCRIPTION:I'll talk about joint work with Stephanie Wehner i
n which we derive upper bounds on the rate of tran
smission of classical information over quantum cha
nnels by block codes with a given blocklength and
error probability\, for both entanglement-assisted
and unassisted codes\, in terms of a unifying fra
mework of quantum hypothesis testing with restrict
ed measurements. Our bounds do not depend on any s
pecial property of the channel (such as memoryless
ness) 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 o
f desirable properties. In particular our bound on
entanglement-assisted codes is a semidefinite pro
gram and for memoryless channels its large n limit
is the well known formula for entanglement-assist
ed capacity due to Bennett\, Shor\, Smolin and Tha
pliyal.
LOCATION:MR4\, Centre for Mathematical Sciences
CONTACT:Paul Skrzypczyk
END:VEVENT
END:VCALENDAR