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