Robustness of Quantum Algorithms for Nonconvex Optimization

Weiyuan Gong, Chenyi Zhang, Tongyang Li
2/12/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Implicit Regularization of Decentralized Gradient Descent for Sparse Regression

99% match2026

Compositional Substitutivity of Visual Reasoning for Visual Question Answering

98% match1 repo62026

Risk Bounds of Accelerated SGD for Overparameterized Linear Regression

98% match2026

Optimal Learning of Kernel Logistic Regression for Complex Classification Scenarios

98% match2026

An Error Analysis of Flow Matching for Deep Generative Modeling

98% match2026

Deep Random Features for Scalable Interpolation of Spatiotemporal Data

97% match1 repo132026

Cite this paper

@article{gong2026robustness,
  title  = {Robustness of Quantum Algorithms for Nonconvex Optimization},
  author = {Weiyuan Gong and Chenyi Zhang and Tongyang Li},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:02b7c63b51fb1dd5b094818ba0269f80ac18427a},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/02b7c63b51fb1dd5b094818ba0269f80ac18427a.svg)](https://codeofpaper.com/paper/02b7c63b51fb1dd5b094818ba0269f80ac18427a)

Discussion