4 papers
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
Yuexin Su, Chenyi Zhang, Peiyuan Huang +2
Computing approximate Karush--Kuhn--Tucker (KKT) points for constrained nonconvex programs is a fundamental problem in mathematical programming. Interior-point trust-region (IPTR)…
Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation
Han Luo, Ziyi Yang, Ziruo Wang +2
Solving the Elliptic Curve Discrete Logarithm Problem (ECDLP) is critical for evaluating the quantum security of widely deployed elliptic-curve cryptosystems. Consequently, minimiz…
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
Yuexin Su, Ziyi Yang, Peiyuan Huang +2
Bandits with knapsacks (BwK) constitute a fundamental model that combines aspects of stochastic integer programming with online learning. Classical algorithms for BwK with a time h…
Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
Tongyang Li, Yuexin Su, Ziyi Yang +1
Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the Quantum Approximate Optimization Algorithm (QAOA) for…