22 citations · 61 across the 11 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
On the Fine-Grained Query Complexity of Symmetric Functions
Supartha Podder, Penghui Yao, Zekun Ye
This paper explores a fine-grained version of the Watrous conjecture, including the randomized and quantum algorithms with success probabilities arbitrarily close to . Our con…
quant-ph2023★ 1 cited
On the exact quantum query complexity of and
Penghui Yao, Zekun Ye
The query model has generated considerable interest in both classical and quantum computing communities. Typically, quantum advantages are demonstrated by showcasing a quantum algo…