default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChenyi Zhang 0003
Person information
- affiliation: Stanford University, Computer Science Department, Stanford, CA, USA
Other persons with the same name
- Chenyi Zhang — disambiguation page
- Chenyi Zhang 0001
![[0000-0002-3054-5883]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-3054-5883")
— University of Canterbury, Christchurch, New Zealand (and 5 more) - Chenyi Zhang 0002 — Huawei Technologies, Shenzhen, China (and 2 more)
- Chenyi Zhang 0004 — Beijing Jiaotong University, Institute of Information Science, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c9]Weiyuan Gong, Chenyi Zhang, Tongyang Li:
Robustness of Quantum Algorithms for Nonconvex Optimization. ICLR 2025- 2024
- [c8]Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure. CCC 2024: 21:1-21:23 - [c7]Hao Wang, Chenyi Zhang, Tongyang Li:
Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss. ICLR 2024 - [c6]Yexin Zhang, Chenyi Zhang, Cong Fang, Liwei Wang, Tongyang Li:
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization. ICML 2024 - [c5]Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Quantum Pseudoentanglement. ITCS 2024: 2:1-2:21 - [c4]Jiachen Hu, Tongyang Li, Xinzhao Wang, Yecheng Xue, Chenyi Zhang, Han Zhong:
Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits. TQC 2024: 9:1-9:21 - [i11]Hao Wang, Chenyi Zhang, Tongyang Li:
Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss. CoRR abs/2402.12745 (2024) - [i10]Chenyi Zhang, Tongyang Li:
Comparisons Are All You Need for Optimizing Smooth Functions. CoRR abs/2405.11454 (2024) - [i9]Yexin Zhang, Chenyi Zhang, Cong Fang, Liwei Wang, Tongyang Li:
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization. CoRR abs/2406.03006 (2024) - [i8]Adam Bouland, Chenyi Zhang, Zixin Zhou:
On the hardness of learning ground state entanglement of geometrically local Hamiltonians. CoRR abs/2411.04353 (2024) - 2023
- [c3]Chenyi Zhang, Tongyang Li:
Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions. ICML 2023: 41268-41299 - [c2]Aaron Sidford, Chenyi Zhang:
Quantum speedups for stochastic optimization. NeurIPS 2023 - [i7]Aaron Sidford, Chenyi Zhang:
Quantum speedups for stochastic optimization. CoRR abs/2308.01582 (2023) - [i6]Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure. CoRR abs/2311.12017 (2023) - 2022
- [j2]Andrew M. Childs, Jiaqi Leng, Tongyang Li, Jin-Peng Liu, Chenyi Zhang:
Quantum simulation of real-space dynamics. Quantum 6: 860 (2022) - [i5]Andrew M. Childs, Jiaqi Leng, Tongyang Li, Jin-Peng Liu, Chenyi Zhang:
Quantum simulation of real-space dynamics. CoRR abs/2203.17006 (2022) - [i4]Weiyuan Gong, Chenyi Zhang, Tongyang Li:
Robustness of Quantum Algorithms for Nonconvex Optimization. CoRR abs/2212.02548 (2022) - [i3]Chenyi Zhang, Tongyang Li:
Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions. CoRR abs/2212.03906 (2022) - 2021
- [j1]Chenyi Zhang, Jiaqi Leng, Tongyang Li:
Quantum algorithms for escaping from saddle points. Quantum 5: 529 (2021) - [c1]Chenyi Zhang, Tongyang Li:
Escape saddle points by a simple gradient-descent based algorithm. NeurIPS 2021: 8545-8556 - [i2]Chenyi Zhang, Tongyang Li:
Escape saddle points by a simple gradient-descent based algorithm. CoRR abs/2111.14069 (2021) - 2020
- [i1]Chenyi Zhang, Jiaqi Leng, Tongyang Li:
Quantum Algorithms for Escaping from Saddle Points. CoRR abs/2007.10253 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-30 00:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
