BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/56
DTSTAMP:20230914T125908Z
SUMMARY:Universal Coding Theory in Quantum Systems
DESCRIPTION:Speaker: Masahito Hayashi\nGraduate School of Information Scien
 ces\nTohoku University\nAoba-ku\, Sendai 980-8579\nJapan\n\nAbstract: \nWe
  construct a universal code for stationary and memoryless classical-quantu
 m channel as a quantum version of the universal coding by Csisz\\\\'{a}r a
 nd K\\\\ {o}rner. Our code is constructed by the combination of irreducibl
 e representation\, the decoder introduced through quantum information spec
 trum\, and the packing lemma. Also\, we have proven that there exists a qu
 antum state approximating any multi-copy state universally when we measure
  the error by means of the normalized relative entropy. While the qubit ca
 se was proven by Krattenthaler and Slater\, the general case has been open
  for more than ten years. For a deeper analysis\, we have solved the mini-
 max problem concerning `approximation error' up to the second order. Furth
 ermore\, we have applied this result to quantum lossless data compression\
 , and have constructed a universal quantum lossless data compression.\n
URL:https://www.tcs.tifr.res.in/web/events/56
DTSTART;VALUE=DATE:20091224
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR