BEGIN:VCALENDAR
PRODID:-//AddEvent Inc//AddEvent.com v1.7//EN
VERSION:2.0
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20261101T010000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:On the undecidability of quantum channel capacities\n\nArchishna Bhattacharyya (University of Ottawa)\n\nAbstract: \n\nAn important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is overwhelming evidence suggesting that quantum channel capacities may be uncomputable\, a formal proof of any such statement is elusive. We initiate the study of the hardness of computing quantum channel capacities. We show that\, for a general quantum channel\, it is QMA-hard to compute its quantum capacity\, and that the entanglement-assisted zero-error capacity under some restrictions is uncomputable\; indicative of the fact that quantum channel capacities may generally be undecidable.\n\nThis is based on arXiv 2601.22471 — joint work with Arthur Mehta and Yuming Zhao.\n\nLocation \n\nQNC 3206
X-ALT-DESC;FMTTYPE=text/html:On the undecidability of quantum channel capacities<br />Archishna Bhattacharyya (University of Ottawa)<br><br>Abstract: <br><br>An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is overwhelming evidence suggesting that quantum channel capacities may be uncomputable, a formal proof of any such statement is elusive. We initiate the study of the hardness of computing quantum channel capacities. We show that, for a general quantum channel, it is QMA-hard to compute its quantum capacity, and that the entanglement-assisted zero-error capacity under some restrictions is uncomputable; indicative of the fact that quantum channel capacities may generally be undecidable.<br><br>This is based on arXiv 2601.22471 — joint work with Arthur Mehta and Yuming Zhao.<br><br>Location <br />QNC 3206
UID:82810507d917425b86caabd82bca26e5addeventcom
SUMMARY:IQC Special Seminar featuring Archishna Bhattacharyya
DTSTART;TZID=America/New_York:20260619T140000
DTEND;TZID=America/New_York:20260619T150000
DTSTAMP:20260615T224733Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:QNC 3206
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
BEGIN:VALARM
TRIGGER:-PT30M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR