Some sources of hardness in classical and Quantum algorithms

NOTE —> NEW STARTING TIME 1:15, NOT 11AM AS ORIGINALLY PLANNED <—-

Antonello Scardicchio

---

I will discuss the so-called entropic barriers effect which slows down the performance of classical algorithms running some hard constraint satisfaction problems. I will show how the effect of those barriers appear also when one tries a quantum adiabatic algorithm solution.

Based on: M.Bellitti, F.Ricci-Tersenghi, A. Scardicchio PRR 3, 043015 (2021) 

---

Please RSVP for the lunch on the link below.

---

ORGANIZER

Vadim Oganesyan (CSI/GC-CUNY)