Exponential Quantum Advantage in Testing Fourier Dimensionality

arXiv:2609.25816 · quant-ph, cs.CC, cs.DS · Submitted 2026-09-22 · Read on arXiv

quant-ph, cs.CC, cs.DS

Submitted: 2026-09-22

Updated: 2026-09-28

Terminology

• Query Complexity — 9× in this paper · explained in 2 episodes
• Sparsity — 2× in this paper · explained in 4 episodes
• Symposium on Discrete Algorithms — 2× in this paper
• Adjacency Matrix — 1× in this paper · explained in 1 episode
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes

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
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity