Lisa Yang

I am a graduate student at MIT. I am very fortunate to be advised by Netta Engelhardt at the MIT Center for Theoretical Physics (CTP), and Yael Kalai at the MIT Computer Science and AI Laboratory (CSAIL) where I am a student in the Theory of Computation group.
My research interests are in applications of quantum information and complexity, to high energy physics (quantum physics and gravity). More broadly, I am interested in studying the physical world through mathematics, information, and computation.

Previously I was advised by Yael Kalai and Vinod Vaikuntanathan in theoretical cryptography, and completed my M.S. in Computer Science in 2021 at MIT.
I completed my B.S. in Mathematics in 2019 at MIT.

I am grateful to be supported in part by a NSF fellowship and Siebel scholarship.

Email: lisayang at mit dot edu


Publications:  INSPIRE-HEP  arXiv , see dblp for computer science publications.

1. "The Complexity of Learning (Pseudo)random Dynamics of Black Holes and Other Chaotic Systems"

    Lisa Yang, Netta Engelhardt. arXiv 2023.

Publications in Computer Science

2. "Succinct Classical Verification of Quantum Computation"

    James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang. CRYPTO 2022.

3. "Quantum Advantage from Any Non-Local Game"

    Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang. STOC 2023.

4. “Delegation with Updatable Unambiguous Proofs and PPAD-Hardness” (full version in my Masters thesis)

    Yael Tauman Kalai, Omer Paneth, Lisa Yang. International Cryptology Conference CRYPTO 2020.

  • Talk given at CRYPTO 2020.

  • Invited talk at the Charles River Crypto Day and Cornell Crypto Seminar.

5. “How to Delegate Computations Publicly”

    Yael Tauman Kalai, Omer Paneth, Lisa Yang. Symposium on Theory of Computing STOC 2019.

    Early (preceding) version: “On Publicly Verifiable Delegation From Standard Assumptions”  ePrint 2018.

6. “The Parallel Repetition of Non-Signaling Games: Counterexamples and Dichotomy“

    Justin Holmgren, Lisa Yang. Symposium on Theory of Computing STOC 2019. Quantum Information Processing QIP 2019.

  • Talk given at STOC 2019, QIP 2019, and MIT Algorithms and Complexity Seminar.

    Early (preceding) version: “(A Counterexample to) Parallel Repetition for Non-Signaling Multi-Player Games”  ECCC/ePrint 2017.

7. “The Diameter and Automorphism Group of Gelfand-Tsetlin Polytopes”

    Yibo Gao, Ben Krakoff, Lisa Yang. Discrete and Computational Geometry 62(1) 2019.

  • Presented at the UMN REU 2016 and JMM 2017.

8. “Toric Mutations in the dP2 Quiver and Subgraphs of the dP2 Brane Tiling”

    Yibo Gao, Zhaoqi Li, Thuy-Duong Vong, Lisa Yang. Electronic Journal of Combinatorics 26(2) 2019.

  • Presented at the UMN REU 2016 and JMM 2017.


9. “Random oracles, the Polynomial-Time Hierarchy, and Constant-depth Circuits: A survey”

    Andrew He, Lisa Yang. Project for MIT's Advanced Complexity Theory course  2016.



I was a teaching assistant (TA) for 6.875 Graduate Cryptography (Fall 2020), taught jointly between MIT and Berkeley.