BEGIN:VCALENDAR
PRODID;X-RICAL-TZSOURCE=TZINFO:-//com.denhaven2/NONSGML ri_cal gem//EN
CALSCALE:GREGORIAN
VERSION:2.0
BEGIN:VTIMEZONE
TZID;X-RICAL-TZSOURCE=TZINFO:US/Eastern
BEGIN:DAYLIGHT
DTSTART:20170312T020000
RDATE:20170312T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTEND;TZID=US/Eastern;VALUE=DATE-TIME:20170428T131500
DTSTART;TZID=US/Eastern;VALUE=DATE-TIME:20170428T121500
DESCRIPTION:We consider the classical complexity of approximately simulat
ing time evolution under spatially local quadratic bosonic Hamiltonians
for time t. We obtain upper bounds on the scaling of t with the number o
f bosons\, n\, for which simulation is classically efficient. We also ob
tain a lower bound on the scaling of t with n for which this problem red
uces to a general instance of the boson sampling problem and is hence ha
rd\, assuming the conjectures of Aaronson and Arkhipov [Proc. 43rd Annu.
ACM Symp. Theory Comput. STOC '11]. We view these results in the light
of classifying phases of physical systems based on parameters in the Ham
iltonian and conjecture a link to dynamical phase transitions. In doing
so\, we combine ideas from mathematical physics and computational comple
xity to gain insight into the behavior of condensed matter systems.\nPre
print: arXiv:1703.05332
URL:https://talks.cs.umd.edu/talks/1774
SUMMARY:Abhinav Deshpande - Complexity of sampling as an order parameter
LOCATION:2136 PSC
END:VEVENT
END:VCALENDAR