betaFeedback

WorksPhysics and Astronomy

Separations Between Randomized and Exact Quantum Query Complexity for Boolean Functions

Abstract

We construct a family of total Boolean functions FtotF_{\mathrm{tot}} whose randomized and exact quantum query complexities satisfy R(Ftot)≥QE(Ftot)2−o(1)R(F_{\mathrm{tot}}) \ge Q_E(F_{\mathrm{tot}})^{2-o(1)}. 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 ε∈(0,1)\varepsilon \in (0,1), we construct a family of partial Boolean functions FparF_{\mathrm{par}} on nn bits satisfying QE(Fpar)=Oε(1)Q_E(F_{\mathrm{par}})=O_\varepsilon(1) and R(Fpar)=Ωε(n1−ε)R(F_{\mathrm{par}})=Ω_\varepsilon(n^{1-\varepsilon}). This matches the asymptotic separation previously obtained with bounded error (STOC 2021; SICOMP 2023). Lifting yields a family of partial communication functions GparG_{\mathrm{par}} with QEcc(Gpar)=Oε(log⁡n)Q_E^{\mathrm{cc}}(G_{\mathrm{par}})=O_\varepsilon(\log n) and Rpub,cc(Gpar)=Ωε(n1−ε)R^{\mathrm{pub,cc}}(G_{\mathrm{par}})=Ω_\varepsilon(n^{1-\varepsilon}), where nn is the total number of input bits held by the two parties.

Paper details

vlnc:W_we3jd9y5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

ChatGPT

View statement
Looking for related papers…