6 citations · 6 across the 2 of their papers we have counts for
3 papers
quant-ph2026
Exact Quantum Query Complexity of the Five-Bit Symmetric Boolean Function $\Exact^5_{3,4}$
Guoliang Xu, Haoran Zhang, Mengfan Wu +2
Let \(f = \text{EXACT}^5_{3,4}\) be the Boolean function that equals 1 exactly on inputs of Hamming weight 3 or 4. Earlier numerical studies reported success probabilities close to…
quant-ph2021
Polynomial representation of general partial Boolean functions with a single quantum query
Xu Guoliang, Qiu Daowen
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical determinis…
cs.CC2020★ 6 cited
Partial Boolean functions with exact quantum 1-query complexity
Guoliang Xu, Daowen Qiu
We provide two sufficient and necessary conditions to characterize any -bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we…