Abstract: In this talk we explore how circuit models of classical and quantum computation can be used to argue the superiority of some quantum algorithms. In particular, we’ll present Deutsch’s problem, which has an approachable quantum algorithm that wins over the best classical implementation.

This is the next installment of the talk series in the IRG3.1 subproject on quantum algorithms.
As with the other introductory talks in IRG3 this year, this presentation is intended to be introductory, but some familiarity with material from the earlier talks may be assumed or reviewed. Videos of earlier talks are available on the Quantum Approaches website at
https://quantumapproaches.unl.edu.
Participants from all of the IRGs are welcome.