BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20201201T170000
RDATE:20210314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20211107T010000
RDATE:20220313T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20210314T030000
RDATE:20211107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20220313T030000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:a96436070ea972c41cc1e4fe09e81bc4
CATEGORIES:Experimental Mathematics Seminar
CREATED:20211129T094823
SUMMARY:Sycamore and other quantum supremacy experiments
LOCATION:Zoom
DESCRIPTION:Abstract: The notable claim of quantum supremacy presented by Google's team
  in 2019 consists of demonstrating the ability of a quantum circuit to gene
 rate, albeit with considerable noise, bitstrings from a distribution that i
 s considered hard to simulate on classical computers. Google's team estimat
 ed that the task performed by their quantum circuit would take 10,000 years
  on a classical supercomputer. In 2020 a team from the University of Scienc
 e and Technology of China (USTC) claimed that the sampling task computed by
  their quantum computer, which differs from Google's, would take 2.5 billio
 n years to perform on a classical supercomputer! In the lecture I will disc
 uss three aspects of these claims.\nA) The quality of the statistical tools
  and methods\nB) The strength of the claims from computational complexity\n
 C) The quality of the data\n
X-ALT-DESC;FMTTYPE=text/html:<p>Abstract: The notable claim of quantum supremacy presented by Google's t
 eam in 2019 consists of demonstrating the ability of a quantum circuit to g
 enerate, albeit with considerable noise, bitstrings from a distribution tha
 t is considered hard to simulate on classical computers. Google's team esti
 mated that the task performed by their quantum circuit would take 10,000 ye
 ars on a classical supercomputer. In 2020 a team from the University of Sci
 ence and Technology of China (USTC) claimed that the sampling task computed
  by their quantum computer, which differs from Google's, would take 2.5 bil
 lion years to perform on a classical supercomputer! In the lecture I will d
 iscuss three aspects of these claims.</p><p>A) The quality of the statistic
 al tools and methods</p><p>B) The strength of the claims from computational
  complexity</p><p>C) The quality of the data</p>
CONTACT:Gil Kalai, Hebrew University of Jerusalem
X-EXTRAINFO:Zoom Link: https://rutgers.zoom.us/j/94346444480\npassword: The 20th Catala
 n number, alias (40)!/(20!*21!), alias 6564120420
DTSTAMP:20260828T185710
DTSTART;TZID=America/New_York:20211202T170000
DTEND;TZID=America/New_York:20211202T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR