IC Colloquium: Complexity and Learnability in Complex Quantum Systems
By: Jonas Haferkamp - Harvard University
IC/SB Faculty candidate
Abstract
The 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 devices in predicting and learning the properties of other quantum systems. We present multiple frontiers and some recent progress toward demonstrating or disproving such a quantum advantage. Surprisingly, the question of learnability by classical and quantum devices is intimately related to quantum circuit complexity. We will discuss how the concept of quantum pseudorandomness is key to both the learnability of quantum systems and the growth of quantum circuit complexity within them.
Bio
Jonas Haferkamp is a Postdoctoral Fellow at the John A. Paulson School of Engineering and Applied 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 Berlin, focusing on random matrices and circuit complexity in quantum physics. Before that, he obtained a master’s degree from the University of Hamburg with a thesis on deformations of tensor categories supervised by Christoph Schweigert. He is broadly interested in the intersection of computer science and quantum physics.
IC/SB Faculty candidate
Abstract
The 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 devices in predicting and learning the properties of other quantum systems. We present multiple frontiers and some recent progress toward demonstrating or disproving such a quantum advantage. Surprisingly, the question of learnability by classical and quantum devices is intimately related to quantum circuit complexity. We will discuss how the concept of quantum pseudorandomness is key to both the learnability of quantum systems and the growth of quantum circuit complexity within them.
Bio
Jonas Haferkamp is a Postdoctoral Fellow at the John A. Paulson School of Engineering and Applied 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 Berlin, focusing on random matrices and circuit complexity in quantum physics. Before that, he obtained a master’s degree from the University of Hamburg with a thesis on deformations of tensor categories supervised by Christoph Schweigert. He is broadly interested in the intersection of computer science and quantum physics.
Practical information
- General public
- Free
Contact
- Host: Ola Svensson