BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv5.12.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20180927T103000
DTEND;TZID=America/New_York:20180927T114500
DTSTAMP:20220112T093938
CREATED:20210629T210714Z
LAST-MODIFIED:20210629T210714Z
UID:1962140-1538044200-1538048700@www.cs.jhu.edu
SUMMARY:Krasnopoler Lecture: Scott Aaronson\, David J. Bruton Centennial Professor Department of Computer Science University of Texas at Austin – “Quantum Supremacy and Its Applications”
DESCRIPTION:LocationHackerman Hall B-17AbstractIn the near future\, there will likely be special-purpose quantum computers with 50-70 high-quality qubits and controllable nearest-neighbor couplings.In this talk\, I’ll discuss general theoretical foundations for how to use such devices to demonstrate quantum supremacy: that is\, a clear quantum speedup for some task\, motivated by the goal of overturning the Extended Church-Turing Thesis\, which says that all physical systems can be efficiently simulated by classical computers\, as confidently as possible. This part of the talk is based on joint work with Lijie Chen.Then\, in a second part of the talk\, I’ll discuss brand new work on how these experiments could be used to generate cryptographically certified random bits.VideoWatch seminar video.
URL:https://www.cs.jhu.edu/event/krasnopoler-lecture-scott-aaronson-david-j-bruton-centennial-professor-department-of-computer-science-university-of-texas-at-austin-quantum-supremacy-and-its-applications/
END:VEVENT
END:VCALENDAR