22 citations · 61 across the 11 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
quant-ph2026
Nearly Optimal Quantum Sample Complexity of Learning Fourier-Sparse Boolean Functions
Zekun Ye
We study the number of uniform quantum examples needed to exactly learn a Boolean function with at most nonzero Fourier coefficients. We give a learner with near-optimal $\wide…
quant-ph2026
Quantum Submodular Maximization
Yonggang Jiang, Xiaoming Sun, Penghui Yao +3
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constr…
quant-ph2026
Quantum Advantage of Permutation-Invariant Functions in Communication Complexity
Yunqi Huang, Zekun Ye
We study how symmetry affects quantum advantage in two-party communication complexity. For any partial function on length- strings over a fixed alphabet of size , invaria…