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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68708831d8468
DTSTART;TZID=America/Toronto:20250718T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250718T163000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-ashwin-nayak-1
SUMMARY:Tutte colloquium-Ashwin Nayak
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE:Learning quantum states\n\nSPEAKER:\n Ashwin 
 Nayak\n\nAFFILIATION:\n University of À¶Ý®ÊÓƵ\n\nLOCATION:\n MC 5501\n\nA
 BSTRACT: Suppose we are given a sequence of quantum registers\ninitialize
 d to the same quantum state rho\, and would like to learn\nthe state rho.
  That is\, we would like to design an algorithm that\nproduces a classica
 l description of an approximation to the state.\nHow many copies of rho d
 owe need to be able to produce a suitable\napproximation? This talk will 
 be a gentle introduction to the problem\nand related results.\n\n \n 
DTSTAMP:20250711T034241Z
END:VEVENT
END:VCALENDAR