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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69de5650733ab
DTSTART;TZID=America/Toronto:20240311T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240311T153000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-err
 or-correcting-codes-are-far-classical
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 0101 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Quantum error-correcting codes are far from classical: a quantitati
 ve\nexamination
CLASS:PUBLIC
DESCRIPTION:SPECIAL COLLOQUIUM - ZHI LI\, PERIMETER INSTITUTE\n\nUniversity
  of Waterloo 200 University Ave. W Waterloo QNC 0101\n\nQuantum error-corr
 ecting codes play a pivotal role in enabling\nfault-tolerant quantum compu
 tation. These codes protect quantum\ninformation through intricately desig
 ned redundancies that encode the\ninformation in a global manner. Unlike c
 lassical objects\, in a quantum\nerror-correcting code\, the knowledge of 
 individual subregions\, even\nwhen combined\, reveals nothing about the ov
 erall state.\n\nIn this talk\, we explore the quantification of how far qu
 antum\nerror-correcting code are from classical states. We examine this\nq
 uestion from three different perspectives: circuit complexity (the\nmimima
 l number of circuit depth needed to prepare a quantum state)\,\nexpansion 
 number (the minimal number of terms needed to expand the\nwavefunction)\, 
 and a quantity we termed product overlap\, which\ncharacterizes the maxima
 l overlap between a given state and any\nproduct state. We will demonstrat
 e why any quantum error-correcting\ncode states must exhibit exponentially
  small product overlap\, and how\nit implies lower bounds for the circuit 
 complexity and the expansion\nnumber.
DTSTAMP:20260414T145928Z
END:VEVENT
END:VCALENDAR