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

5 papers

quant-ph2026

DC-MBQC: A Distributed Compilation Framework for Measurement-Based Quantum Computing

Yecheng Xue, Rui Yang, Zhiding Liang +1

Distributed quantum computing (DQC) is a promising technique for scaling up quantum systems. While significant progress has been made in DQC for quantum circuit models, there exist…

quant-ph2025★ 1 cited

Efficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs

Yexin Zhang, Shuo Zhou, Xinzhao Wang +5

Gaussian Boson Sampling (GBS) is a promising candidate for demonstrating quantum computational advantage and can be applied to solving graph-related problems. In this work, we prop…

quant-ph2024

Quantum Non-Identical Mean Estimation: Efficient Algorithms and Fundamental Limits

Jiachen Hu, Tongyang Li, Xinzhao Wang +3

We systematically investigate quantum algorithms and lower bounds for mean estimation given query access to non-identically distributed samples. On the one hand, we give quantum me…

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…