Skip to content

Author

Yong-Zhen Xu

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Quantum Approximate Counting with Bernoulli Oracles

An upper bound of $\tilde{O}\!\big(\frac{\rho}}{\Delta\epsilon}+\frac{1}{\Delta\sqrt{\epsilon}}\big)$ queries is proved for quantum counting with bounded-error oracles, achieving a quadratic speedup over the classical sample complexity.

Chen Gao, Yong-Zhen Xu, Lvzhou Li · 0 citations
Preprint Aug 2026

Quantum Speedups for Testing Similar Means

This work designs quantum algorithms with complexities $\tilde{O}(1/\epsilon)$ and $\tilde{O}(\sqrt{m}/\epsilon)$ in the query and sampling models, respectively, achieving quadratic speedups over the classical counterparts.

Chen Gao, Yong-Zhen Xu, Shenggen Zheng et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.