Beyond the n/2n/2 Threshold: Quantum Query Complexity for Computing Hamming Weight and Symmetric Functions

Yuan Deng, Zihan Hao, Honghao Lin, Qipeng Liu, Vahab Mirrokni, Jianan Shao, David P. Woodruff

An explicit family of symmetric n-bit Boolean functions needs n/2+Ω(n(1/3))n/2 + \Omega (n^{(1/3)}) quantum queries at sufficiently small fixed error. The same paper gives a quantum algorithm that recovers exact Hamming weight with n/2+O(n(1/3))n/2 + O(n^{(1/3)}) queries at bounded error.

What was already known

Van Dam’s oracle interrogation algorithm could recover the whole string at bounded error using n/2+O(n)n/2 + O(\sqrt{n}) queries. It was open whether a Boolean output could require more than n/2n/2 at fixed error.

AI involvement AI-led

OpenAI’s GPT-6 Astra Ultra found the upper bound. Google’s Stellar Colosseum found a matching lower bound and then supplied a simpler hard function at the authors’ request. The authors posed the problem and rewrote the lower-bound analysis after working through it.

Importance Notable

The paper answers the lower-bound question and identifies the order of the additive overhead for symmetric Boolean functions.

Technical verification Partial

The authors report working through the lower-bound argument in detail. They link a Lean check for the earlier construction. Comparable checking evidence for the full pair of published bounds is undocumented.

Independent checking

Worked through the lower-bound argument in detail before rewriting the analysis.

Checker
Paper authors
Scope
The manuscript’s simplified symmetric-family lower-bound argument.
Basis
Reported by the linked checker

Formal checking

Checked the first Colosseum lower-bound construction. The linked account distinguishes the later simpler construction.

Checker
Lean 4 kernel
Scope
Colosseum’s first n/2+Ω(n(1/3))n/2 + \Omega (n^{(1/3)}) lower-bound construction.
Basis
Reported by the linked checker

Human understanding Partial

The authors describe how they simplified and rewrote the lower-bound analysis. The methodology does not give a comparable account of their reconstruction of the model’s upper-bound algorithm.

Other useful sources

Correction and publication history