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:20140309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20131103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6830dc8116ea0
DTSTART;TZID=America/Toronto:20141020T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20141020T153000
URL:/institute-for-quantum-computing/events/sean-hallgr
 en-quantum-algorithm-computing-unit-group
SUMMARY:Sean Hallgren: A quantum algorithm for computing the unit group of 
 an\narbitrary degree number field
CLASS:PUBLIC
DESCRIPTION:Summary \n\nSEAN HALLGREN\, PENNSYLVANIA STATE UNIVERSITY\n\nCo
 mputing the group of units in a field of algebraic numbers is one of\nthe 
 central tasks of computational algebraic number theory. It is\nbelieved to
  be hard classically\, which is of interest for\ncryptography. In the quan
 tum setting\, efficient algorithms were\npreviously known for fields of co
 nstant degree. We give a quantum\nalgorithm that is polynomial in the degr
 ee of the field and the\nlogarithm of its discriminant. This is achieved b
 y combining three new\nresults.\n 
DTSTAMP:20250523T203721Z
END:VEVENT
END:VCALENDAR