跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17804 · v1

Tight Quantum Query Bounds for Collision Finding over Arbitrary Bounded Types

首次提交 2026-11-13 14:35
版本更新 2026-11-13 14:35
雷达观测 2026-11-16 10:40
arXiv ↗PDF ↗

摘要

We determine the bounded-error quantum query complexity of finding one rr-collision in an NN-input function of prescribed type, which specifies all equality-class sizes. For every fixed maximum class size and collision order, we give a tight bound as the maximum of scales determined by the numbers of classes of size at least 2,…,r2,\ldots,r. The lower bound holds for a uniformly random function of that type, and a matching algorithm succeeds on every such function. No intermediate class size is required to occur, and every feasible output alphabet is allowed. The characterization connects the abundant-collision regime associated with set equality to the sparse-target regime of kk-distinctness. In particular, finding the unique (k+1)(k+1)-collision in type (kn,k+1)(k^n,k+1) has complexity Θk(N3/4−1/[4(2k+1−1)])Θ_k(N^{3/4-1/[4(2^{k+1}-1)]}), where N=kn+k+1N=kn+k+1, resolving an open problem of Belovs. For the lower bound, we introduce a filtered compressed permutation oracle that projects onto a harmonic database subspace after each complete function query. Its O(T/N)O(T/N) comparison error over TT queries overcomes the square-root limitation of the unfiltered process. Hidden capacity extensions and moment estimates retain the populations at each intermediate collision order. Matching upper bounds use sampled collision lists and colored adaptive learning graphs, with a coherent decision-to-search conversion that avoids logarithmic overhead. We also give an alternative nested quantum-walk algorithm for three-collision search, matching the bound up to polylogarithmic factors.

AI 论文解读

基于摘要 · 非全文审阅

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

版本差异

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

观测到的版本

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

v1 · 2026-11-13 14:35 · 最新观测版本

Tight Quantum Query Bounds for Collision Finding over Arbitrary Bounded Types

We determine the bounded-error quantum query complexity of finding one rr-collision in an NN-input function of prescribed type, which specifies all equality-class sizes. For every fixed maximum class size and collision order, we give a tight bound as the maximum of scales determined by the numbers of classes of size at least 2,…,r2,\ldots,r. The lower bound holds for a uniformly random function of that type, and a matching algorithm succeeds on every such function. No intermediate class size is required to occur, and every feasible output alphabet is allowed. The characterization connects the abundant-collision regime associated with set equality to the sparse-target regime of kk-distinctness. In particular, finding the unique (k+1)(k+1)-collision in type (kn,k+1)(k^n,k+1) has complexity Θk(N3/4−1/[4(2k+1−1)])Θ_k(N^{3/4-1/[4(2^{k+1}-1)]}), where N=kn+k+1N=kn+k+1, resolving an open problem of Belovs. For the lower bound, we introduce a filtered compressed permutation oracle that projects onto a harmonic database subspace after each complete function query. Its O(T/N)O(T/N) comparison error over TT queries overcomes the square-root limitation of the unfiltered process. Hidden capacity extensions and moment estimates retain the populations at each intermediate collision order. Matching upper bounds use sampled collision lists and colored adaptive learning graphs, with a coherent decision-to-search conversion that avoids logarithmic overhead. We also give an alternative nested quantum-walk algorithm for three-collision search, matching the bound up to polylogarithmic factors.

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