A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

Simons Institute via YouTube Direct link

Introduction

1 of 23

1 of 23

Introduction

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling

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

  1. 1 Introduction
  2. 2 Background
  3. 3 Outline
  4. 4 Motivation
  5. 5 Experimental Model
  6. 6 Results
  7. 7 Theorem
  8. 8 Running Time
  9. 9 Scaling of M
  10. 10 Theta Log in Depth
  11. 11 Ideal RCs
  12. 12 High Noise
  13. 13 XClass
  14. 14 Summary
  15. 15 Recent Progress
  16. 16 Practical Challenges
  17. 17 Power Arguments
  18. 18 Polypass Integral
  19. 19 Efficient Enumeration
  20. 20 Discussion
  21. 21 Conclusions
  22. 22 Questions
  23. 23 Panel

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.