Seminar • Quantum Computing • The Complexity of Near-Term Quantum Computers
Please note: This seminar will be given online.
Daniel Grier, Postdoctoral Researcher
Institute for Quantum Computing, University of Waterloo
Daniel Grier, Postdoctoral Researcher
Institute for Quantum Computing, University of Waterloo
Charupriya Sharma, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Peter van Beek
Teodor Alexandru Ionita, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Martin Karsten
Xinda Li, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Florian Kerschbaum
Tamal Adhikary, Master’s candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Khuzaima Daudjee, Semih Salihoglu
Vahid Asadi, PhD candidate
David R. Cheriton School of Computer Science
We present a new framework for designing worst-case to average-case reductions. For a large class of problems, it provides an explicit transformation of algorithms running in time T that are only correct on a small (subconstant) fraction of their inputs into algorithms running in time O(T \log T) that are correct on all inputs.
Soroosh Gholamizoj, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Bin Ma
Saiyue Lyu, Master’s candidate
David R. Cheriton School of Computer Science
Supervisors: Professors Mark Giesbrecht, Arne Storjohann
Alister Liao, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Peter van Beek
Lindsey Tulloch, Master’s candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Ian Goldberg