AI 中文总结
本文为Simon二面体陪集问题量子算法的三个引理提供严格陈述与完整证明，修正原引理的假设缺陷，指出其算法正确性未被完全确立。
AI 中文摘要
在一篇近期预印本中，Simon提出了一个针对二面体陪集问题的多项式时间量子算法，其分析依赖于四个引理。其中三个引理仅带有证明概要，本文为这三个引理分别给出了可直接理解的陈述，并提供完整证明。引理1源于子集和计数的精确二阶矩计算，它以概率趋近于1成立，而非最初声称的常数。引理3的振幅界源于测量结果立方体上的精确Parseval恒等式，且在任意阈值处均成立，无需任何良态性假设，因此该谓词完全从论证中移除。对于引理4，我们精确计算了球箱协方差，发现第二个协方差包含一个固定球计数未包含的项。区分组不含故障样本的假设也可被丢弃。两个分支振幅共享一个带符号的前置因子，因此计数估计控制它们的差值，而非引理所陈述的比值。我们证明了加性形式，并表明收尾论证仅需该形式即可完成。所有这些工作后仅存一个假设：要求划分为两边的划分与测量字符串独立固定，而算法给出的该划分选择规则无法满足这一点。因此，证明这四个引理本身并不足以确立该算法的正确性。
英文摘要
In a recent preprint, Simon proposed a polynomial-time quantum algorithm for the Dihedral Coset Problem and rested the analysis on four lemmas. Three of them carry only proof sketches, and this paper gives each of those three a statement that admits a single reading together with a complete proof. Lemma 1 follows from an exact second-moment computation for the subset-sum counts, and it holds with probability tending to one in place of the constant originally claimed. The amplitude bound of Lemma 3 follows from an exact Parseval identity on the cube of measurement outcomes and holds at every threshold with no well-behavedness hypothesis, so that predicate leaves the argument entirely. For Lemma 4, we compute both balls-in-bins covariances exactly and find that the second carries a term a fixed ball count leaves out. The assumption that the distinguished group contains no faulty samples can also be dropped. The two branch amplitudes share a signed prefactor, so the counting estimates control their difference and not the ratio the lemma states. We prove the additive form and show that the closing argument consumes nothing more than that. A single hypothesis survives all of this. It asks that the partition into the two sides be fixed independently of the measured string, and the rule the algorithm gives for choosing that partition does not supply it. Establishing these four lemmas therefore does not by itself establish the correctness of the algorithm.
Comments19 pages, 1 figure
