BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d1fb580feaa
DTSTART;TZID=America/Toronto:20240708T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240708T113000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-com
 putational-advantage-simulating-many-body-spin
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West QNC 1201 Wate
 rloo ON N2L 3G1 Canada
SUMMARY:Quantum computational advantage in simulating many-body spin dynami
 cs
CLASS:PUBLIC
DESCRIPTION:IQC COLLOQUIUM - DR. CHAE-YEUN PARK\, XANADU\n\nQNC building\, 
 200 University Ave. Room QNC 1201 Waterloo \n\nUnderstanding the dynamics
  of quantum many-body systems is one of the\nfundamental objectives of phy
 sics. The existence of an efficient\nquantum algorithm for simulating thes
 e dynamics with reasonable\nresource requirements suggests that this probl
 em might be among the\nfirst practically relevant tasks quantum computers 
 can tackle.\nAlthough an efficient classical algorithm for simulating such
  dynamics\nis not generally expected\, the classical hardness of many-body
 \ndynamics has been rigorously proven only for certain commuting\nHamilton
 ians. In this talk\, I will show that computing the output\ndistribution o
 f quantum many-body dynamics is classically difficult\,\nclassified as #P-
 hard\, also for a large class of non-commuting\nmany-body spin Hamiltonian
 s. Our proof leverages the robust polynomial\nestimation technique and the
  #P-hardness of computing the permanent of\na matrix. By combining this wi
 th the anticoncentration conjecture of\nthe output distribution\, I will a
 rgue that sampling from the output\ndistribution generated by the dynamics
  of a large class of spin\nHamiltonians is classically infeasible. Our fin
 dings can significantly\nreduce the number of qubits required to demonstra
 te quantum advantage\nusing analog quantum simulators.
DTSTAMP:20260405T060408Z
END:VEVENT
END:VCALENDAR