Completed
Facts and Conjectures
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
On the Need for Large Quantum Depth
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Google claims 'quantum supremacy for computer
- 3 Near-term QC Must Have Small Circuit Depth
- 4 Log(n)-depth QC + Classical C = Poly(n)-depth
- 5 Facts and Conjectures
- 6 What Is An Oracles Problem?
- 7 Quantum Circuit Model with Oracle
- 8 Design The Oracle Problem
- 9 Simon's Problem is Actually Easy for constant-depth QC + classical C
- 10 The d-Shuffling Simon's Problem (d-SSP)
- 11 Discussion and Open Problems
