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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a8b54e1bde74
DTSTART;TZID=America/Toronto:20260811T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260811T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/iqc-seminar-
 calvin-liu-recent-advances-random-quantum
SUMMARY:IQC Seminar - Calvin Liu - Recent advances in random quantum circui
 t\nsampling
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Calvin Liu\n\nAFFILIATION: \n University of Waterlo
 o\n\nLOCATION:\n MC 5029\n\nABSTRACT: \n\nIn 2019\, Google announced the 
 demonstration of quantum supremacy by\nperforming a computational task kno
 wn as random circuit sampling on\ntheir 53-qubit quantum computer Sycamore
 . In their paper\, they claimed\nthat it would take classical computers 10
 000 years to perform the same\ntask. Almost seven years has passed\, and w
 hat happened to this claim\nsince then? In this talk\, I will provide a hi
 gh-level update on the\nsubsequent developments in quantum hardware experi
 ments\, classical\nsimulation software\, asymptotic classical simulation a
 lgorithms\, and\nproving the hardness of classical simulation. This talk i
 s aimed at a\nnon-quantum computing audience\, and no prior background in 
 quantum\ncomputing is assumed.
DTSTAMP:20260823T201529Z
END:VEVENT
END:VCALENDAR