{"total":13,"rows":[{"id":"2212.09328","title":"Quantum policy gradient algorithms","created":"2022-12-19","cited_by_count":15,"area":null},{"id":"2302.10796","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","created":"2023-02-21","cited_by_count":9,"area":null},{"id":"2308.09701","title":"Do you know what q-means?","created":"2023-08-18","cited_by_count":6,"area":null},{"id":"2207.08643","title":"A Sublinear-Time Quantum Algorithm for Approximating Partition Functions","created":"2022-07-18","cited_by_count":5,"area":null},{"id":"2406.03006","title":"Quantum Algorithms and Lower Bounds for Finite-Sum Optimization","created":"2024-06-05","cited_by_count":4,"area":null},{"id":"2310.11684","title":"Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes","created":"2023-10-18","cited_by_count":3,"area":null},{"id":"2504.03626","title":"Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles","created":"2025-04-04","cited_by_count":2,"area":null},{"id":"2504.20982","title":"Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling","created":"2025-04-29","cited_by_count":2,"area":null},{"id":"2507.04438","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","created":"2025-07-06","cited_by_count":2,"area":null},{"id":"2602.00874","title":"Sublinear Time Quantum Algorithm for Attention Approximation","created":"2026-01-31","cited_by_count":1,"area":null},{"id":"2411.01391","title":"Differentiable Quantum Computing for Large-scale Linear Control","created":"2024-11-03","cited_by_count":0,"area":null},{"id":"2502.05094","title":"Quantum speedup of non-linear Monte Carlo problems","created":"2025-02-07","cited_by_count":0,"area":null},{"id":"2503.17308","title":"On Quantum Perceptron Learning via Quantum Search","created":"2025-03-21","cited_by_count":0,"area":null}],"next_cursor":null}