Yinzhan Xu
Yinzhan Xu is a theoretical computer scientist whose work connects AI with mathematical research. At MIT, he worked on Coq-based linear algebra as an undergraduate, competed on its ICPC team in 2019, and earned a B.S. in computer science and math and a PhD under Virginia Vassilevska Williams. His 2024 paper with Ce Jin won the Danny Lewin Best Student Paper Award at STOC, and his 2025 work applied private expander decomposition to graph sparsification. In March 2026, he coauthored lower bounds for transformer computation; in June 2026, ChatGPT 5.5 Pro discovered the initial proof in his Furthest Pair paper, which he and his coauthors validated and edited. He is a postdoctoral researcher in computer science at UCSD, hosted by Barna Saha.
Timeline
-
2017–2018
Coq research at MIT
In 2017–2018, he is an MIT EECS Undergraduate Research and Innovation Scholar under Adam Chlipala, working on deductive synthesis of linear algebra formulas in the Coq proof assistant.
-
April 2019
ICPC World Finals second place
He competes on MIT's 2019 ICPC team in Porto, which places second globally at the World Finals.
-
2020–2023
Fast algorithms and lower bounds
From 2020 to 2023, he coauthors work on min-plus products, shortest paths and lower bounds for dynamic problems, with papers appearing at SODA, FOCS, STOC and ICALP.
-
2024
A STOC paper wins an award
At STOC in 2024, he and Ce Jin coauthor Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More, which earns the Danny Lewin Best Student Paper Award.
-
2025
Private graph sparsification
At ICML in 2025, he coauthors Breaking the n^1.5 Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition.
-
By 2026
MIT bachelor's and PhD
By 2026, he completes a PhD at MIT under Virginia Vassilevska Williams and earns a B.S. in computer science and math there.
-
2026
Transformer bounds and AI proof
In March 2026, he and Barna Saha, Christopher Ye and Hantao Yu submit On the Computational Hardness of Transformers, which establishes lower bounds for multi-head, multi-layer transformers. In June 2026, he, Barna Saha and Christopher Ye submit Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH; ChatGPT 5.5 Pro initially discovers the proof, which the authors validate and substantially edit.
-
As of October 2026
Postdoctoral research at UCSD
As of October 2026, he is a postdoc in UCSD's Computer Science department, hosted by Barna Saha. His research focuses on theoretical computer science, especially fine-grained complexity and algorithms.
Career
- NowUniversity of California, San DiegoPostdoctoral researcher
- 2017–2018Massachusetts Institute of TechnologyUndergraduate Research and Innovation Scholar
Education
Sources and credits
Photo: We have no published photo of Yinzhan Xu yet. Send us a free-licensed photo.
- Yinzhan Xu - MIT SuperUROP – Advanced Undergraduate Research Opportunities Program
- MIT team places second at ACM’s global programming competition | MIT CSAIL
- Yinzhan Xu
- [2603.11332] On the Computational Hardness of Transformers
- [2606.25887] Furthest Pair Requires Quadratic Time in Superconstant Dimension under SETH



