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:20110313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20101107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682b86452e737
DTSTART;TZID=America/Toronto:20111031T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20111031T133000
URL:/institute-for-quantum-computing/events/fernando-br
 andao-random-quantum-circuits-are-approximate
SUMMARY:Fernando Brandao: Random quantum circuits are approximate\npolynomi
 al-designs
CLASS:PUBLIC
DESCRIPTION:Summary \n\nABSTRACT\n\nAn approximate unitary t-design is a di
 stribution of unitaries that\nmimic properties of the Haar measure for pol
 ynomials (in the entries\nof the unitaries) of degree up to t. It has been
  a conjecture in the\ntheory of quantum pseudo-randomness that polynomial 
 sized random\nquantum circuits form an approximate unitary poly(n)-design.
 \nUnfortunately\, up to now\, the best result known is that polynomial\nra
 ndom quantum circuits are unitary 3-designs.\n 
DTSTAMP:20250519T192805Z
END:VEVENT
END:VCALENDAR