Talks

Quantum State Preparation with Optimal T-Count with David Gosset, Robin Kothari.
Theory seminar at University of Washington, Oct 2024
Workshop ‘‘Analysis in TCS: testing, learning, and complexity’’ at Hausdorff Research Institute for Mathematics, Nov 2024
Workshop ‘‘Quantum Innovators’’ at Institute for Quantum Computing (IQC), University of Waterloo, Nov 2024
Theory seminar at University of California, San Diego, Nov 2024

The Power of Adaptivity in Quantum Query Algorithms
with Uma Girish, Makrand Sinha, Avishay Tal.
Quantum Information Processing (QIP), Jan 2024
The IQC-QuICS Math and Computer Science Seminar, Jan 2024
Symposium on Theory of Computing (STOC), Jun 2024

Fourier Growth of Communication Protocols for XOR Functions
with Uma Girish, Makrand Sinha, Avishay Tal.
Institute of Computing Technology, Chinese Academy of Sciences, Jul 2023

On Differentially Private Counting on Trees
with Badih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi.
Center on Frontiers of Computing Studies, Peking University, Jul 2023

Improved Bounds for Sampling Solutions of Random CNF Formulas
with Kun He, Kuan Yang.
Symposium on Discrete Algorithms (SODA), Jan 2023

Perfect Sampling for (Atomic) Lovász Local Lemma
with Kun He, Xiaoming Sun.
Institute for Theoretical Computer Science, Shanghai University of Finance and Economics, Jun 2021
Theory Group at Nanjing University, Jul 2021
John Hopcroft Center, Shanghai Jiao Tong University, Jul 2021

Fourier Growth of Parity Decision Trees
with Uma Girish, Avishay Tal.
Center on Frontiers of Computing Studies, Peking University, Jun 2021
Computational Complexity Conference (CCC), Jul 2021

An Improved Sketching Algorithm for Edit Distance
with Ce Jin, Jelani Nelson.
John Hopcroft Center, Shanghai Jiao Tong University, Jan 2021
Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2021

Improved bounds for the sunflower lemma
with Ryan Alweiss, Shachar Lovett, Jiapeng Zhang.
Institute of Computing Technology, Chinese Academy of Sciences, Mar 2020
Center on Frontiers of Computing Studies, Peking University, Jul 2020
International Joint Conference on Theoretical Computer Science (IJTCS), Aug 2020

Decision list compression by mild random restrictions
with Shachar Lovett, Jiapeng Zhang.
Institute of Computing Technology, Chinese Academy of Sciences, Oct 2019
Symposium on Theory of Computing (STOC), Jun 2020

Randomness vs structure — DNF compression and sunflower lemma
with Ryan Alweiss, Shachar Lovett, Jiapeng Zhang.
Institute for Theoretical Computer Science, Shanghai University of Finance and Economics, Feb 2020