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:Chain rule for quantum relative entropies and thei
 r applications in quantum information theory - Kun
  Fang\, DAMTP
DTSTART;TZID=Europe/London:20191024T141500
DTEND;TZID=Europe/London:20191024T151500
UID:TALK131584AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/131584
DESCRIPTION:The chain rule for the classical relative entropy 
 ensures that the relative entropy between probabil
 ity distributions on multipartite systems can be d
 ecomposed into a sum of relative entropies of suit
 ably chosen conditional distributions on the indiv
 idual systems. In this talk\, we will discuss simi
 lar chain rules for two different quantum relative
  entropies\, that is\, the Umegaki relative entrop
 y and the Belavkin-Staszewski (BS) relative entrop
 y. These new chain rules admit important applicati
 ons in the context of asymptotic quantum channel d
 iscrimination and quantum channel capacities. More
  precisely\, the chain rule for the Umegaki relati
 ve entropy allows us to solve an open problem in q
 uantum channel discrimination that adaptive protoc
 ols cannot improve the error rate for asymmetric c
 hannel discrimination compared to non-adaptive str
 ategies. The chain rule for the BS relative entrop
 y helps to sharpen single-letter converse bounds o
 n quantum channel capacities in a significant way.
 \n\nThis talk is based on arXiv papers: 1909.05826
  and 1909.05758.
LOCATION:MR9\,  Centre for Mathematical Sciences\, Wilberfo
 rce Road\, Cambridge
CONTACT:Johannes Bausch
END:VEVENT
END:VCALENDAR