Exponential Quantum Advantage in Testing Fourier Dimensionality
quant-ph, cs.CC, cs.DS
Submitted: 2026-09-22
Updated: 2026-09-28
Comments: 20 pages; minor revisions to intro, fix in proof of Lemma 3.4
License: http://creativecommons.org/licenses/by/4.0/
The gist: A boolean function f has Fourier dimension k if its nonzero Fourier coefficients span a subspace of dimension k.
Terminology
Abstract
A boolean function f has Fourier dimension k if its nonzero Fourier coefficients span a subspace of dimension k. We consider the property testing task of determining whether a function has Fourier dimension at most k, or is ε-far from being so. We show that there is a O(k/sqrtε) -query quantum property tester for this problem, which we show to be almost optimal. Combined with Gopalan et al.'s classical lower bound of Ω(2 k/2), this demonstrates an exponential quantum advantage for this task. We complement this result with a (2 k/2/ε) classical tester, giving a quadratic improvement over the previous best tester, and essentially settling the classical query complexity.
Sources
- Improved quantum test for linearity of a Boolean function
- On the communication complexity of XOR functions
- A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
- Tolerant Quantum Junta Testing
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians