Small-doubling subsets of F_2^n can now be covered by an explicit, efficiently learned subspace in polynomial time, with matching query lower bounds for classical and quantum algorithms.
Quantum Proofs for Classical Theorems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas. In this paper we survey these results and the quantum toolbox they use.
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Algorithmic Polynomial Freiman-Ruzsa Theorems
Small-doubling subsets of F_2^n can now be covered by an explicit, efficiently learned subspace in polynomial time, with matching query lower bounds for classical and quantum algorithms.