Quantum Computation - The 2023 IAS-PCMI Graduate Summer School
IAS | PCMI Park City Mathematics Institute via YouTube
Overview
Syllabus
Part 1 Overview of quantum learning theory | Srinivasan Arunachalam (IBM Quantum)
Part 2 Strengths and weakness for learning functions from quantum examples | Srinivasan Arunachalam
Part 3 Overview of results for learning quantum states | Srinivasan Arunachalam (IBM Quantum)
Part 4 Learning classes of quantum states | Srinivasan Arunachalam (IBM Quantum)
Part 1 Discrete and Quantum Fourier Transform | András Gilyén (Alfréd Rényi Institute, Hungary)
Part 2 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)
Part 3 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)
Part 4 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Inst)
Part 5 Quantum Fourier transform–beyond Shor’s algorithm | András Gilyén (Alfréd Rényi Institute)
Part 1 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)
Part 2 Distance Measures Between States | Omar Fawzi (École Normale Supérieure de Lyon)
Part 3 Data Processing For Quantum Relative Entropy | Omar Fawzi (École Normale Supérieure de Lyon)
Part 4 Quantum Information Theory | Omar Fawzi (École Normale Supérieure de Lyon)
Part 5 Algorithmic Aspects Of Optimal Channel Coding | Omar Fawzi (École Normale Supérieure de Lyon)
Part 1 Quantum and quantum-inspired linear algebra | Ewin Tang (University of Washington)
Part 2 Proving the QSVT | Ewin Tang (University of Washington)
Part 4 Introducing quantum-inspired linear algebra | Ewin Tang (University of Washington)
Part 5 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)
Part 1 Quantum query complexity basics+the hybrid method | Yassine Hamoudi (U California, Berkeley)
Part 3 The recording method–Quantum query complexity| Yassine Hamoudi (U of California, Berkeley)
Part 4 Quantum query complexity: the adversary method | Yassine Hamoudi (U of California, Berkeley)
Part 1 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
Part 2 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
Part 3 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
Part 4 Quantum LDPC codes | Nicolas Delfosse (Microsoft Research)
Verifiable Quantum Supremacy: What I Hope Will Be Done | Scott Aaronson (University of Texas)
Quantum Error Correction | Barbara Terhal (Delft University of Technology)
Part 1 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
Part 2 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
Part 3 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
Part 4 Quantum Hamiltonian complexity | Sandy Irani (University of California, Irvine)
Part 5 Stoquastic Hamiltonians | Sandy Irani (University of California, Irvine)
Part 1 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
Part 3 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
Part 4 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
Part 5 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
Part 1 Quantum Singleton bound and consequences | Jeongwan Haah (Microsoft Research)
Part 2 Codes and homology | Jeongwan Haah (Microsoft Research)
Part 3 Circuit complexity of code states | Jeongwan Haah (Microsoft Research)
Part 4 Transversal gates: Topological aspects of quantum codes | Jeongwan Haah (Microsoft Research)
Part 3 Quantum-inspired algorithms: sketching and beyond | Ewin Tang (University of Washington)
Part 2 The polynomial method: Quantum query complexity | Yassine Hamoudi (U California Berkeley)
Part 5 Algorithmic dual to the adversary method: Quantum query complexity | Yassine Hamoudi
Part 2 On the theory of near-term quantum advantage | Bill Fefferman (The University of Chicago)
Taught by
IAS | PCMI Park City Mathematics Institute