BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:5e3fbee1-13bf-447b-961d-1eaeb13b41fd
X-WR-CALNAME:[ICQ] Adrian Tanasa (LaBRI) Optimizing the quartic Sachdev-Ye-
 Kitaev model
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20260329T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:5e3fbee1-13bf-447b-961d-1eaeb13b41fd
DTSTAMP:20260413T181739Z
CLASS:PUBLIC
DESCRIPTION:In this talk I will present the main result of the paper 'Optim
 izing Strongly Interacting Fermionic Hamiltonians' Matthew B. Hastings\, R
 yan O'Donnell\, arXiv:2110.1070\, STOC 2022\, whose abstract is:\n'The fun
 damental problem in much of physics and quantum chemistry is to optimize a
  low-degree polynomial in certain anticommuting variables. Being a quantum
  mechanical problem\, in many cases we do not know an efficient classical 
 witness to the optimum\, or even to an approximation of the optimum. One p
 rominent exception is when the optimum is described by a so-called 'Gaussi
 an state'\, also called a free fermion state. In this work we are interest
 ed in the complexity of this optimization problem when no good Gaussian st
 ate exists. Our primary testbed is the Sachdev--Ye--Kitaev (SYK) model of 
 random degree- q polynomials\, a model of great current interest in conden
 sed matter physics and string theory\, and one which has remarkable proper
 ties from a computational complexity standpoint. Among other results\, we 
 give an efficient classical certification algorithm for upper-bounding the
  largest eigenvalue in the q = 4 SYK model\, and an efficient quantum cert
 ification algorithm for lower-bounding this largest eigenvalue\; both algo
 rithms achieve constant-factor approximations with high probability.\n\n\n
 https://combalgo.labri.fr/pmwiki.php/Groupe/Info-Quantique
DTSTART;TZID=Europe/Paris:20240709T150000
DTEND;TZID=Europe/Paris:20240709T160000
LOCATION:Room 178
SEQUENCE:0
SUMMARY:[ICQ] Adrian Tanasa (LaBRI) Optimizing the quartic Sachdev-Ye-Kitae
 v model
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
