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:20260924T213308
DTSTART;TZID=America/Detroit:20260930T160000
DTEND;TZID=America/Detroit:20260930T170000
SUMMARY:Workshop / Seminar:Probability and Analysis Seminar: Tightness of and counterexamples to several quantum estimates
DESCRIPTION:Abstract: Recently the TCS query learning ala Nisan--Mansur--Linial got the boost from a harmonic analysis random algorithm. This problem has a non-commutative version where one needs to learn a very big matrix (so-called d-local hamiltonians) from  a few random queries.\nThe corresponding harmonic analysis results have a drawback that it is still not known how tight they are. We will discuss this and show tightness for some of them. Interestingly\, one such tightness result is closely related to Einstein--Podolsky--Rosen paradox from quantum mechanics. On a close issue: arguably the main problem in understanding the speed up  of quantum algorithms versus classical ones for a certain collection of problems (called Aaronson--Ambainis conjecture and still open) will be discussed too if time permits.
UID:152870-21914627@events.umich.edu
URL:https://events.umich.edu/event/152870
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4088
CONTACT:
END:VEVENT
END:VCALENDAR