The Power of Random Quantum Circuits - Bill Fefferman
Kavli Institute for Theoretical Physics via YouTube
Overview
Syllabus
Intro
What do we mean by "classically intractable"?
What do we mean by "classical simulation" algorithm?
Proof first step: from sampling to computing
Formal statement of q. supremacy conjecture
Roadmap for the rest of talk
Average case hardness for Permanent [Lipton '91]
[BFNV18]: Hardness for Random Quantum Circuits
First attempt at adapting Lipton's proof
Extensions to [BFNV'19]
Understanding hardness of noisy random quantum circuits BFLL'21
Similar hardness arguments work with noise!
But there's also a (trivial) classical algorithm!
The "noise barrier" to improving robustness
Future directions regarding RCS
Taught by
Kavli Institute for Theoretical Physics