log in  |  register  |  feedback?  |  help  |  web accessibility
Algorithms, Circuits and Learning with Quantum Computers
Luke Schaeffer
IRB 4105 or https://umd.zoom.us/j/95853135696?pwd=VVEwMVpxeElXeEw0ckVlSWNOMVhXdz09
Wednesday, March 13, 2024, 11:00 am-12:00 pm
  • You are subscribed to this talk through .
  • You are watching this talk through .
  • You are subscribed to this talk. (unsubscribe, watch)
  • You are watching this talk. (unwatch, subscribe)
  • You are not subscribed to this talk. (watch, subscribe)
Abstract

We explore the provable advantages and limitations of quantum computers in three contexts. First, we consider how to design quantum algorithms by studying a result on the regular languages. Next, we discuss unconditional quantum advantage in the context of shallow circuits. We give separations with relation problems and interactive problems. Finally, we explore the problem of efficiently learning quantum states.

Bio
Luke Schaeffer is a QuICS Hartree Postdoctoral Fellow at University of Maryland, College Park. His interests include quantum algorithms and complexity, quantum state tomography, and theoretical computer science in general. He received a doctorate in computer science from MIT, and was a postdoc at IQC in Waterloo before joining QuICS.
 
This talk is organized by Samuel Malede Zewdu