Where can quantum computers outperform classical computers?

Zoom link for remote attendees

Meeting ID: 999 4631 3276 Passcode: 123123

Abstract: Quantum computers leverage the principles of quantum mechanics to process information in ways that are fundamentally different from their classical counterparts. We expect quantum computers to have an advantage over classical computers for problems in learning and optimization, but determining precisely where this quantum advantage lies has proven subtle and far from straightforward. In this talk, I will survey my research aimed at identifying some computational tasks where quantum algorithms can potentially surpass classical methods. I will also consider how these findings—both successes and shortcomings—can inform our broader understanding of computational limits and physical processes.

Bio: Bobak is a postdoctoral associate in the applied mathematics department at Harvard University. He completed his PhD at MIT in Electrical Engineering and Computer Science. His research is at the intersection of machine learning and quantum computation, especially in understanding what practical problems quantum computers can be used for and where quantum advantage may reside.