6 citations · 6 across the 2 of their papers we have counts for
1 paper · 1 filter
Guoliang Xu, Daowen Qiu
We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we…