Preprint
Sep 2026
Small-Bias Quantum Approximate Counting via the Multiplicative Adversary Method
A multiplicative-adversary derivation that tracks the progress produced by individual oracle queries and proves that unique OR on bits with success probability $1/2+\zeta$ requires $\Omega(\sqrt{\zeta n})$ queries, and reduces unique OR to the two-weight counting problem.
Albert Lin, Han-Hsuan Lin
· 0 citations