activity
20232026
most citedProvably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

quant-ph2023

Near-Optimal Quantum Coreset Construction Algorithms for Clustering

Yecheng Xue, Xiaoyu Chen, Tongyang Li +1

-Clustering in (e.g., -median and -means) is a fundamental machine learning problem. While near-linear time approximation algorithms were known in the class…

quant-ph2023★ 1 cited

Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret

Han Zhong, Jiachen Hu, Yecheng Xue +2

While quantum reinforcement learning (RL) has attracted a surge of attention recently, its theoretical understanding is limited. In particular, it remains elusive how to design pro…