Interactive Shallow Clifford Circuits- Quantum Advantage Against NC and Beyond
Association for Computing Machinery (ACM) via YouTube
Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
AI, Data Science & Cloud Certificates from Google, IBM & Meta
Overview
Syllabus
Intro
Title Breakdown
Previous Work
Hidden Linear Function Problem
How hard is HLF? (Upper Bound)
Complexity Class Map
Main Result
Fix 1: Interactive problem
Fix 1: Interactive Task
Fix 2: Reduction only for classical solutions
Interactivity and classical devices
Revised Theorem 2
Sketch of reduction
Pauli Errors
Adversarial Tomography
Revised Theorem 3
Weaker results on smaller grids
Taught by
Association for Computing Machinery (ACM)