BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20260816T193634Z
UID:https://www.mpq.mpg.de/events/36591/5132484
DTSTART:20240129T120000Z
CLASS:PUBLIC
CREATED:20240122T113729Z
DESCRIPTION:The field of quantum computation heavily relies on the belief t
 hat quantum computation violates the extended Church Turing thesis\, namel
 y\, that quantum many-body systems cannot be simulated by classical ones w
 ith only polynomial overhead. Importantly\, we must ask: what experimental
  evidence do we have for this bold assumption? A major effort towards prov
 iding such evidence had concentrated on random quantum circuit sampling (R
 CS) as in the famous supremacy experiment by Google from 2019. I will desc
 ribe a recent work with Gao\, Landau\, Liu and Vazirani in which we give a
  polynomial time classical algorithm for simulating such RCS experiments. 
 Our algorithm gives strong evidence that RCS cannot be the basis for near 
 term experimental evidence for scalable exponential quantum advantage.\nVo
 rtragende(r): Prof. Dr. Dorit Aharonov
LAST-MODIFIED:20240129T081340Z
LOCATION:Max Planck Institute of Quantum Optics\, Raum: Herbert Walther Lec
 ture Hall
ORGANIZER;CN=Munich Center for Quantum Science and Technology (MCQST):mailt
 o:
SUMMARY:Specialized Seminar: "The search for evidence of quantum advantage"
  (Prof. Dr. Dorit Aharonov)
URL;VALUE=URI:https://www.mpq.mpg.de/events/36591/5132484
END:VEVENT
END:VCALENDAR