18 citations · 25 across the 7 of their papers we have counts for
7 papers · 1 filter
Quantum Approximate Counting with Bernoulli Oracles
Chengshen Gao, Yongzhen Xu, Lvzhou Li
Quantum counting is a fundamental quantum algorithm that estimates the fraction of marked elements using a membership oracle, achieving a quadratic speedup over classical sampling.…
Quantum Speedups for Testing Similar Means
Chengshen Gao, Yongzhen Xu, Shenggen Zheng +1
Property testing of distributions is a central topic in information theory, learning theory, and statistics. While quantum algorithms are known to offer significant speedups for pr…
Exponential quantum space advantage for Shannon entropy estimation in data streams
Weijun Feng, Yongzhen Xu, Lvzhou Li +2
Near-term quantum devices with limited qubits motivate the study of space-bounded quantum computation in the data stream model. We show that Shannon entropy estimation exhibits an…
Playing Mastermind on quantum computers
Lvzhou Li, Jingquan Luo, Yongzhen Xu
From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community…
Quantum algorithm for learning secret strings and its experimental demonstration
Yongzhen Xu, Shihao Zhang, Lvzhou Li
In this paper, we consider the secret-string-learning problem in the teacher-student setting: the teacher has a secret string , and the student wants to learn t…
Robust Quantum Walk Search Without Knowing the Number of Marked Vertices
Yongzhen Xu, Delong Zhang, Lvzhou Li
There has been a very large body of research on searching a marked vertex on a graph based on quantum walks, and Grover's algorithm can be regarded as a quantum walk-based search a…
A Note on "Quantum Algorithm for Linear Systems of Equations"
Yong-Zhen Xu, Yifan Huang, Zekun Ye +1
Recently, an efficient quantum algorithm for linear systems of equations introduced by Harrow, Hassidim, and Lloyd, has received great concern from the academic community. However,…