跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21189 · v1

Separations Between Randomized and Exact Quantum Query Complexity for Boolean Functions

首次提交 2026-11-16 22:44
版本更新 2026-11-16 22:44
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

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.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 22:44 · 最新观测版本

Separations Between Randomized and Exact Quantum Query Complexity for Boolean Functions

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.

查看此版本解读 →查看此版本原文 ↗