BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260923T090325
DTSTART;TZID=America/Detroit:20261027T160000
DTEND;TZID=America/Detroit:20261027T170000
SUMMARY:Lecture / Discussion:Colloquium: How to achieve quantum advantage?
DESCRIPTION:The development of error-corrected quantum computers raises the prospect of quantum advantages in scientific computation. Which problems are likely to benefit\, and what will it take to realize these advantages? I will first discuss basic quantum algorithm concepts and some criteria for comparing quantum and classical computation. I will then focus on eigenvalue problems\, where improving the precision of an approximate solution offers one possible route to quantum advantage. Recent advances allow quantum eigensolvers to use few auxiliary qubits and short coherent evolutions\, with near-optimal dependence on the target precision. I will introduce these developments and a method for estimating multiple eigenvalues together with their multiplicities. Most of the presentation is intended to be accessible to a broad mathematical audience without prior background in quantum computation.
UID:148250-21903442@events.umich.edu
URL:https://events.umich.edu/event/148250
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Applied Mathematics,Mathematics
LOCATION:East Hall - 1360
CONTACT:
END:VEVENT
END:VCALENDAR