BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Instituto de Física Teórica - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ift.uam-csic.es
X-WR-CALDESC:Events for Instituto de Física Teórica
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Madrid
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20241027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Madrid:20251119T113000
DTEND;TZID=Europe/Madrid:20251119T130000
DTSTAMP:20260417T150028
CREATED:20251029T141050Z
LAST-MODIFIED:20251218T085419Z
UID:23520-1763551800-1763557200@www.ift.uam-csic.es
SUMMARY:Seminar: Average-case quantum complexity from glassiness
DESCRIPTION:Speaker: Alexander Zlokapa (MIT) \nVenue & Time: Red Room / 11:30 \nAbstract: In the classical setting\, glassiness characterizes many natural problems (e.g.\, random k-SAT) and underlies average-case hardness by obstructing a family of “stable” classical algorithms (e.g.\, constant-time Langevin dynamics). In this work\, we develop analogous quantum results. Our techniques\, based on quantum optimal transport\, differ significantly from classical probabilistic approaches due to the sign problem in the absence of a known eigenbasis. We show that quantum glassiness obstructs stable quantum algorithms\, including constant-time Lindbladian dynamics (even when starting from the maximally mixed state). Using the replica trick\, we also find that random 3-local Pauli Hamiltonians are quantumly hard and give evidence that random k-local Hamiltonians are quantumly easy for sufficiently large constant k. This differs from the analogous classical (Ising\, glassy phase for all k) and fermionic (SYK\, never glassy for any k) k-local ensembles. (Talk based on arXiv:2510.08497.)
URL:https://www.ift.uam-csic.es/event/seminar-average-case-quantum-complexity-from-glassiness/
LOCATION:IFT Seminar Room/Red Room\, Instituto de Física Teórica (IFT) -C. Nicolás Cabrera\, 13-15\, Fuencarral-El Pardo\, Madrid\, 28049\,\, Spain
CATEGORIES:Scientific activities,Seminars
END:VEVENT
END:VCALENDAR