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:Computational Entanglement Theory\n\nQuantum entanglement is an important resource that contributes to the potential of quantum computers over classical computers. It turns out to be an interesting idea to quantify entanglement in states\, and there are different approaches to this. We can\, for example\, consider the number of Bell states that are required to approximately produce a given state or the number of Bell states that can be produced from the state - these correspond to the 'entanglement cost’ and ‘distillable entanglement' respectively. Throughout this\, we bear in mind a picture where Alice (A) and Bob (B) own a shared state\, and are only able to perform LOCC operations on their respective systems. In practice\, however\, computational complexity must be taken into account. I will explain some recent developments towards taking computational complexity into account for these operational measures\, as well as introducing pseudo-entanglement\, and hopefully some quantum cryptography.
X-ALT-DESC;FMTTYPE=text/html:Computational Entanglement Theory<br><br>Quantum entanglement is an important resource that contributes to the potential of quantum computers over classical computers. It turns out to be an interesting idea to quantify entanglement in states, and there are different approaches to this. We can, for example, consider the number of Bell states that are required to approximately produce a given state or the number of Bell states that can be produced from the state - these correspond to the 'entanglement cost’ and ‘distillable entanglement' respectively. Throughout this, we bear in mind a picture where Alice (A) and Bob (B) own a shared state, and are only able to perform LOCC operations on their respective systems. In practice, however, computational complexity must be taken into account. I will explain some recent developments towards taking computational complexity into account for these operational measures, as well as introducing pseudo-entanglement, and hopefully some quantum cryptography.
UID:1776576193addeventcom
SUMMARY:IQC Student Seminar Featuring Shreyas Natarajan
DTSTART;TZID=America/New_York:20231025T120000
DTEND;TZID=America/New_York:20231025T130000
DTSTAMP:20260419T052313Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:QNC 1201
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
BEGIN:VALARM
TRIGGER:-PT30M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR