BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20210331T140000
DTEND;TZID=America/New_York:20210331T150000
DTSTAMP:20260407T002558
CREATED:20210309T184233Z
LAST-MODIFIED:20210309T184233Z
UID:4488-1617199200-1617202800@seasevents.nmsdev7.com
SUMMARY:CIS Seminar: "Communication Complexity\, Quantum Computing and Optimization: New Connections and Insights"
DESCRIPTION:How much information flows through a system? This fundamental question is at the heart of communication complexity. Techniques from this field have turned out to be immensely powerful and fairly universal tools to understand the power of different kinds of algorithms.\n\nIn this talk\, I will describe new methods that I have developed to analyze communication which offer fresh insights into quantum computing and optimization. Using these techniques\, I will answer a question of Aaronson and Ambainis regarding the maximal advantage that quantum algorithms can have over classical algorithms in the “blackbox” model\, and another conjecture due to Rothvoss about optimal linear programs for approximately solving the matching problem.\n\nLooking forward\, I also propose new directions to explore further connections among these areas with the intention of answering key questions regarding quantum speedups and more powerful optimization approaches\, such as semidefinite programming.
URL:https://seasevents.nmsdev7.com/event/cis-seminar-communication-complexity-quantum-computing-and-optimization-new-connections-and-insights/
LOCATION:Zoom – Email CIS for link\, cherylh@cis.upenn.edu
ORGANIZER;CN="Computer and Information Science":MAILTO:cherylh@cis.upenn.edu
END:VEVENT
END:VCALENDAR