Where can quantum computers outperform classical computers?
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 share some findings in this area both in my own research and from the broader community. I will also consider how these findings inform our broader understanding of computational limits and physical processes.
Date and Time
Location
Hosts
Registration
-
Add Event to Calendar
Loading virtual attendance info...
- 1947 N 12th St
- College of ENG
- Philadelphia, Pennsylvania
- United States 19122
- Building: College of Engineering
- Room Number: 305
- Starts 26 March 2026 04:00 AM UTC
- Ends 22 April 2026 04:00 AM UTC
- No Admission Charge
Speakers
Bobak T. Kiani
Bobak T. Kiani is an Assistant Professor of Computer Science at Bowdoin College, currently residing in Portland, Maine. He earned his PhD from MIT in the Electrical Engineering and Computer Science department and previously served as a postdoctoral researcher at Harvard University in the Applied Mathematics department.
Originally from Philadelphia, Professor Kiani focuses his research on the following areas:
1. Quantum Algorithms: Investigating the capabilities and limitations of algorithms, particularly within quantum machine learning
2. Random Hamiltonians and Average Case Complexity: Studying random matrices in physics and mathematics as potential sources for quantum advantage
3. Theory of Machine Learning: Analyzing deep learning algorithms that incorporate symmetries and physics
He is open to meeting new people and can be reached for professional inquiries or discussion via email at b.kiani@bowdoin.edu
Address:United States