Teaching & Lecture notes

Courses (Weizmann)

2023-2024, First semester: Quantum proofs
2022-2023, Second semester: Quantum error correction.

Courses (Caltech)

Winter 2022: CMS139, Design & Analysis of Algorithms.
Fall 2021: CS152, Introduction to cryptography
Fall 2020: Cours FSMP, Interactive Proofs with Quantum Devices.
Winter 2020: CMS139, Design & Analysis of Algorithms.
Fall 2019: CS/Ph 120, Quantum cryptography.
Winter 2019: CS/CMS 139, Design & Analysis of Algorithms.
Fall 2018: CS152, Introduction to cryptography
Spring 2018: CS38, Introduction to algorithms
Winter 2018: CS/CMS 139, Advanced Algorithms
Winter 2017: CS/CMS 139, Advanced Algorithms.
Fall 2016: CS120, Quantum Cryptography. Also offered as an EdX course!
Spring 2016: CS 101, Introduction to modern cryptography
Winter 2016: CS/CMS 139, Advanced Algorithms
Spring 2015: CS/CMS 139, Advanced Algorithms
Fall 2014: CS286, Seminar in Computer Science. Topic: around the Quantum PCP conjecture

Expository notes

An overview of our work MIP*=RE written for the proceedings of ICM 2022.
An expository account on our work MIP=RE, in French, which appeared in the French magazine La Recherche: see here (paywall) and also this draft version.
A presentation aimed at a general mathematical audience of Mahadev’s result on Classical Verification of Quantum Computations, written for the Bulletin of the AMS: pdf.
An expository article on my work with Umesh Vazirani on device-independent quantum key distribution, aimed at a general audience of computer scientists and published in the Communications of the ACM.
A simplified analysis (written in the format of a blog post) of my paper with Anand Natarajan presenting a robust test for n EPR pairs.
A short proof of security for a protocol for device-independent quantum key distribution in parallel introduced by Jain, Miller and Shi.
A simple proof of Renner’s exponential de Finetti.
An expository note, aimed at a general TCS audience, giving an analysis of the Blum-Luby-Rubinfeld linearity test as a game with entangled provers.

Lecture notes

Cours FSMP Interactive Proofs with Quantum Devices

These are lecture notes for a 10-week course given in Paris in Fall 2020. The notes are on the topic of “black-box testing” of quantum devics and provide a unified treatment of the single-device setting (Mahadev protocol for delegated computation) and the two-device setting (complexity of quantum multiprover interactive proofs, a.k.a. nonlocal games).