The Power of Random Quantum Circuits - Bill Fefferman

The Power of Random Quantum Circuits - Bill Fefferman

Kavli Institute for Theoretical Physics via YouTube Direct link

Intro

1 of 15

1 of 15

Intro

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

The Power of Random Quantum Circuits - Bill Fefferman

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 What do we mean by "classically intractable"?
  3. 3 What do we mean by "classical simulation" algorithm?
  4. 4 Proof first step: from sampling to computing
  5. 5 Formal statement of q. supremacy conjecture
  6. 6 Roadmap for the rest of talk
  7. 7 Average case hardness for Permanent [Lipton '91]
  8. 8 [BFNV18]: Hardness for Random Quantum Circuits
  9. 9 First attempt at adapting Lipton's proof
  10. 10 Extensions to [BFNV'19]
  11. 11 Understanding hardness of noisy random quantum circuits BFLL'21
  12. 12 Similar hardness arguments work with noise!
  13. 13 But there's also a (trivial) classical algorithm!
  14. 14 The "noise barrier" to improving robustness
  15. 15 Future directions regarding RCS

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.