Escape saddle points by a simple gradient-descent based algorithm. - Chenyi Zhang 003; Tongyang Li (NeurIPS, 2021)

Quantum algorithms for escaping from saddle points. - Chenyi Zhang 003; Jiaqi Leng; Tongyang Li (Quantum, 2021)

Quantum simulation of real-space dynamics. - Andrew M. Childs; Jiaqi Leng; Tongyang Li; Jin-Peng Liu; Chenyi Zhang 003 (Quantum, 2022)

Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions. - Chenyi Zhang 003; Tongyang Li (ICML, 2023)

Quantum speedups for stochastic optimization. - Aaron Sidford; Chenyi Zhang 003 (NeurIPS, 2023)

Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure. - Adam Bouland; Bill Fefferman; Soumik Ghosh; Tony Metger; Umesh V. Vazirani; Chenyi Zhang 003; Zixin Zhou (CCC, 2024)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss. - Hao Wang; Chenyi Zhang 003; Tongyang Li (ICLR, 2024)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization. - Yexin Zhang; Chenyi Zhang 003; Cong Fang 001; Liwei Wang 001; Tongyang Li (ICML, 2024)

Quantum Pseudoentanglement. - Scott Aaronson; Adam Bouland; Bill Fefferman; Soumik Ghosh; Umesh V. Vazirani; Chenyi Zhang 003; Zixin Zhou (ITCS, 2024)

Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits. - Jiachen Hu; Tongyang Li; Xinzhao Wang; Yecheng Xue; Chenyi Zhang 003; Han Zhong 001 (TQC, 2024)

Comparisons Are All You Need for Optimizing Smooth Functions. - Chenyi Zhang 003; Tongyang Li (CoRR, 2024)

On the hardness of learning ground state entanglement of geometrically local Hamiltonians. - Adam Bouland; Chenyi Zhang 003; Zixin Zhou (CoRR, 2024)

Robustness of Quantum Algorithms for Nonconvex Optimization. - Weiyuan Gong; Chenyi Zhang 003; Tongyang Li (ICLR, 2025)