Seminar • Quantum Computing • Sublinear Algorithms and Quantum Computing

Please note: This seminar will take place in DC 1304.

John Kallaugher, Researcher
Sandia National Laboratories

While quantum devices are expected to be much more powerful than their classical counterparts for some applications, the resources they use are also inherently more costly. Even under the most optimistic estimates, the cost of implementing a qubit is many orders of magnitude greater than for a classical bit. Modelling the behavior of quantum computers is also more difficult than their classical counterparts, with much larger families of possible errors to consider.

I will talk about addressing these challenges with ideas from the classical field of sublinear algorithms: algorithms designed to use very little of some resource relative to the size of the inputs they process.

Bio: John Kallaugher is a researcher at Sandia National Laboratories. His research interests include quantum algorithms, space-efficient computation, and characterization of quantum devices. He received his PhD in Computer Science from the University of Texas at Austin in 2021, where he was advised by Eric Price.