Completed
Worst-case hardness of computing noisy
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
The Power of Random Quantum Circuits
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Quantum advantage in the NISQ era
- 3 Quantum supremacy
- 4 Random Quantum Circuit Sampling (RCS)
- 5 Why are Random Circuits an attractive proposal?
- 6 Why is RCS hard classically?
- 7 Today's focus: hardness of computing output probabilities of noisy random circuits
- 8 Average case hardness for Permanent [Lipton '91]
- 9 (BFNV'18): Hardness for Random Quantum Circuits
- 10 Worst-to-Average Reduction - Attempt 1: Copy Lipton's proof
- 11 New approach to scramble gates of fixed circuit
- 12 Correlating via quantumness
- 13 Understanding the BFNV'19 construction
- 14 Is it hard to (nearly exactly) compute noisy random circuit probabilities? ongoing joint work
- 15 Noisy circuit output probability
- 16 Worst-case hardness of computing noisy
- 17 New easiness results
- 18 Numerical results for noisy 1D RCS [Noh, Jiang, F'20]
- 19 Plots from [Noh, Jiang, F'20] (1)
- 20 Conclusions
