WorksPhysics and Astronomy
Separations Between Randomized and Exact Quantum Query Complexity for Boolean Functions
Abstract
We construct a family of total Boolean functions whose randomized and exact quantum query complexities satisfy . Chiruvella, Kayal, Mittal, Paraashar, and Saurabh (2026) also obtained a nearly quadratic separation for total functions in the query model by a different method. For every fixed , we construct a family of partial Boolean functions on bits satisfying and . This matches the asymptotic separation previously obtained with bounded error (STOC 2021; SICOMP 2023). Lifting yields a family of partial communication functions with and , where is the total number of input bits held by the two parties.