BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:IC Colloquium: Complexity and Learnability in Complex Quantum Syst
 ems
DTSTART:20240219T101500
DTEND:20240219T111500
DTSTAMP:20260507T213250Z
UID:f87f1a5c99691a1082e0208fc984b1898f9a348e7233259331e07c89
CATEGORIES:Conferences - Seminars
DESCRIPTION:By: Jonas Haferkamp - Harvard University\nIC/SB Faculty candid
 ate\n\nAbstract\nThe increasing control over programmable quantum systems 
 promises emergent technologies and even the onset of early fault-tolerance
 . We investigate the prospects of a quantum advantage for programmable dev
 ices in predicting and learning the properties of other quantum systems. W
 e present multiple frontiers and some recent progress toward demonstrating
  or disproving such a quantum advantage. Surprisingly\, the question of le
 arnability by classical and quantum devices is intimately related to quant
 um circuit complexity. We will discuss how the concept of quantum pseudora
 ndomness is key to both the learnability of quantum systems and the growth
  of quantum circuit complexity within them.\n\nBio\nJonas Haferkamp is a P
 ostdoctoral Fellow at the John A. Paulson School of Engineering and Applie
 d Sciences at Harvard University and currently a long-term visitor at the 
 Simons Institute for the Theory of Computing at UC Berkeley. He completed 
 his PhD under the supervision of Jens Eisert at the Free University of Ber
 lin\, focusing on random matrices and circuit complexity in quantum physic
 s. Before that\, he obtained a master’s degree from the University of Ha
 mburg with a thesis on deformations of tensor categories supervised by Chr
 istoph Schweigert. He is broadly interested in the intersection of compute
 r science and quantum physics.
LOCATION:BC 420 https://plan.epfl.ch/?room==BC%20420 https://epfl.zoom.us/
 j/67017232853
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR