Preprint
Oct 2026
Exact Quantum Query Complexity of the Five-Bit Symmetric Boolean Function $\Exact^5_{3,4}$
This paper proves that the exact quantum query complexity of f is 4, and uses the same certificate to derive a valid, though not claimed tight, lower bound on the worst-case error of every algorithm using at most three queries.
Guo-Liang Xu, Hao-Ran Zhang, Meng-Fan Wu et al.
· 0 citations