BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:1f85cd86-7b86-4066-b026-3a331adb248e
X-WR-CALNAME:[gt-iq] Yassine Hamoudi
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20241027T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20220327T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20230326T020000
RDATE:20240331T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:1f85cd86-7b86-4066-b026-3a331adb248e
DTSTAMP:20260510T232300Z
CLASS:PUBLIC
DESCRIPTION:A sublinear-time quantum algorithm for approximating partition 
 functions\n\nGibbs partition functions are ubiquitous in statistical physi
 cs and in combinatorial counting problems. They capture fundamental statis
 tics\, such as the free energy of a thermodynamic system or the number of 
 independent sets of a graph. The problem of efficiently estimating partiti
 on functions is the object of intense research\, both from a classical and
  a quantum algorithmic perspective. We present the first quantum algorithm
  whose running time is sublinear with respect to the logarithm of the size
  of the state space. Our result combines techniques from simulated anneali
 ng\, Szegedy's quantum walks and quantum mean estimators. As an applicatio
 n\, we obtain new polynomial improvements over the best-known algorithms f
 or computing the partition function of the Ising model\, counting the numb
 er of k-colorings\, matchings or independent sets of a graph\, and estimat
 ing the volume of a convex body. \n\n\nhttps://combalgo.labri.fr/pmwiki.ph
 p/Groupe/Info-Quantique
DTSTART;TZID=Europe/Paris:20221206T150000
DTEND;TZID=Europe/Paris:20221206T160000
LOCATION:LaBRI
SEQUENCE:0
SUMMARY:[gt-iq] Yassine Hamoudi
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
