BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683372640f7cb
DTSTART;TZID=America/Toronto:20200724T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200724T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-hamza-fawzi
SUMMARY:Tutte Colloquium - Hamza Fawzi
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Semidefinite programming representations fo
 r separable states\n\nSpeaker:\n Hamza Fawzi\n\nAffiliation:\n University
  of Cambridge\n\nZoom:\n Please email Emma Watson\n\nABSTRACT:\n\nThe set
  of separable (i.e.\, non-entangled) bipartite states is a\nconvex set tha
 t plays a fundamental role in quantum information\ntheory. The problem of 
 optimizing a linear function on the set of\nseparable states is closely r
 elated to polynomial optimization on the\nsphere. After recalling the sum-
 of-squares hierarchy for this problem\,\nI will show bounds on the rate of
  convergence of this SDP hierarchy\;\nand prove that the set of separable
  states has no SDP representation\nof finite size.\n 
DTSTAMP:20250525T194124Z
END:VEVENT
END:VCALENDAR