Metraipolis › archive › dc_cb0b802987f5
Marton's conjecture in polynomial time — arXiv:2609.20771
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20771
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:47:36.024Z
- SHA-256 of the archived text
7170521785e0f8ba6a197abaac6af77d74f8610622c384b45b4a2eb8c2d30f30- Stable URL of this page
https://metraipolis.com/documento/dc_cb0b802987f5
How to cite
Marton's conjecture in polynomial time — arXiv:2609.20771 — arXiv (en), https://arxiv.org/abs/2609.20771 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cb0b802987f5 (Metraipolis archive dc_cb0b802987f5, sha256 7170521785e0f8ba6a197abaac6af77d74f8610622c384b45b4a2eb8c2d30f30)
BibTeX
@misc{dccb0b802987f5,
title = {Marton's conjecture in polynomial time — arXiv:2609.20771},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20771},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cb0b802987f5; sha256 7170521785e0f8ba6a197abaac6af77d74f8610622c384b45b4a2eb8c2d30f30},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20771. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Gowers, Green, Manners, and Tao (Annals '25) recently resolved Marton's polynomial Freiman-Ruzsa conjecture. We give an algorithmic counterpart to their result: given uniform sampling and membership-oracle access to a set $A \subseteq \mathbb{F}_2^n$ with doubling constant at most $K$, our algorithm outputs a subspace of size at most $|A|$ whose $K^{O(1)}$ translates cover $A$. The algorithm runs in $\textsf{poly}(n,K)$ time. As applications, we obtain polynomial-time algorithms for a variety of learning problems, including quadratic Goldreich-Levin, improper agnostic tomography of stabilizer states, and tomography of quantum states with bounded stabilizer extent.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Computational Complexity (cs.CC) ; Combinatorics (math.CO); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.20771 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:15:33.178Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).