Quantum query complexity of symmetric Boolean functions
A quantum query algorithm accesses an unknown bit string through an oracle. This problem asks how many queries it needs to compute a Boolean function whose value depends only on the number of 1s.
Why it matters and what counts as progress
Why it matters: The paper answers the lower-bound question and identifies the order of the additive overhead for symmetric Boolean functions.
What counts as progress: Upper and lower bounds should specify whether the output is one Boolean value or the exact Hamming weight and state the permitted error.
How the problem developed
- 13 May 2014 · Development [1]
Shelby Kimmel, as reported by Scott Aaronson Asked whether any n-bit Boolean function could need more than quantum queries at bounded error.
Yuan Deng and colleagues Gave a symmetric Boolean family requiring an additive query overhead and a matching-order upper bound for Hamming weight.
AI contribution
Beyond the Threshold: Quantum Query Complexity for Computing Hamming Weight and Symmetric Functions
An explicit family of symmetric n-bit Boolean functions needs quantum queries at sufficiently small fixed error. The same paper gives a quantum algorithm that recovers exact Hamming weight with queries at bounded error.
Sources
Publication history
Daily emails by default, only when there’s an update.