Completed
Part 2 The polynomial method: Quantum query complexity | Yassine Hamoudi (U California Berkeley)
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Quantum Computation - The 2023 IAS-PCMI Graduate Summer School
Automatically move to the next video in the Classroom when playback concludes
- 1 Part 1 Overview of quantum learning theory | Srinivasan Arunachalam (IBM Quantum)
- 2 Part 2 Strengths and weakness for learning functions from quantum examples | Srinivasan Arunachalam
- 3 Part 3 Overview of results for learning quantum states | Srinivasan Arunachalam (IBM Quantum)
- 4 Part 4 Learning classes of quantum states | Srinivasan Arunachalam (IBM Quantum)
- 5 Part 1 Discrete and Quantum Fourier Transform | András Gilyén (Alfréd Rényi Institute, Hungary)
- 6 Part 2 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)
- 7 Part 3 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)
- 8 Part 4 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)
- 9 Part 5 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Institute)
- 10 Part 1 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)
- 11 Part 2 Distance Measures Between States | Omar Fawzi (École Normale Supérieure de Lyon)
- 12 Part 3 Data Processing For Quantum Relative Entropy | Omar Fawzi (École Normale Supérieure de Lyon)
- 13 Part 4 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)
- 14 Part 5 Algorithmic Aspects Of Optimal Channel Coding | Omar Fawzi (École Normale Supérieure de Lyon)
- 15 Part 1 Quantum and quantum-inspired linear algebra | Ewin Tang (University of Washington)
- 16 Part 2 Proving the QSVT | Ewin Tang (University of Washington)
- 17 Part 4 Introducing quantum-inspired linear algebra | Ewin Tang (University of Washington)
- 18 Part 5 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)
- 19 Part 1 Quantum query complexity basics+the hybrid method | Yassine Hamoudi (U California, Berkeley)
- 20 Part 3 The recording method–Quantum query complexity| Yassine Hamoudi (U of California, Berkeley)
- 21 Part 4 Quantum query complexity: the adversary method | Yassine Hamoudi (U of California, Berkeley)
- 22 Part 1 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
- 23 Part 2 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
- 24 Part 3 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
- 25 Part 4 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
- 26 Verifiable Quantum Supremacy: What I Hope Will Be Done | Scott Aaronson (University of Texas)
- 27 Quantum Error Correction | Barbara Terhal (Delft University of Technology)
- 28 Part 1 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
- 29 Part 2 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
- 30 Part 3 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
- 31 Part 4 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
- 32 Part 5 Stoquastic Hamiltonians | Sandy Irani (University of California, Irvine)
- 33 Part 1 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
- 34 Part 3 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
- 35 Part 4 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
- 36 Part 5 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
- 37 Part 1 Quantum Singleton bound and consequences | Jeongwan Haah (Microsoft Research)
- 38 Part 2 Codes and homology | Jeongwan Haah (Microsoft Research)
- 39 Part 3 Circuit complexity of code states | Jeongwan Haah (Microsoft Research)
- 40 Part 4 Transversal gates: Topological aspects of quantum codes | Jeongwan Haah (Microsoft Research)
- 41 Part 3 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)
- 42 Part 2 The polynomial method: Quantum query complexity | Yassine Hamoudi (U California Berkeley)
- 43 Part 5 Algorithmic dual to the adversary method: Quantum query complexity | Yassine Hamoudi
- 44 Part 2 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
