← 研踪 PaperTrailarXiv: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
摘要
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.
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 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.
查看此版本解读 →查看此版本原文 ↗