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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682c2db2d31dd
DTSTART;TZID=America/Toronto:20181218T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181218T110000
URL:/institute-for-quantum-computing/events/fault-toler
 ant-resource-estimation-quantum-random-access
SUMMARY:Fault-tolerant resource estimation of quantum random-access memorie
 s
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPHD SEMINAR: OLIVIA DI MATTEO\n\nQuantum random-acc
 ess memories (qRAM) are required by numerous quantum\nalgorithms. In many 
 cases\, qRAM queries are the limiting factor in the\nimplementation of the
 se algorithms. In the limit of a large number of\nqueries\, there will be 
 a massive resource overhead\, as in this regime\nit is not possible to byp
 ass the need for active error correction. In\nthis talk\, I will present o
 ur work towards quantifying this overhead.\nWe will explore a variety of d
 ifferent qRAM circuits designed to query\nclassical bits in superposition.
 \n 
DTSTAMP:20250520T072226Z
END:VEVENT
END:VCALENDAR