Metraipolis › archive › dc_258d3179df63
Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM — arXiv:2609.40293
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.40293
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:17:21.870Z
- SHA-256 of the archived text
f79fddf7d8f287bded3f60e94aeece129aaff4046ed95a56ce5a603594481d04- Stable URL of this page
https://metraipolis.com/documento/dc_258d3179df63
How to cite
Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM — arXiv:2609.40293 — arXiv (en), https://arxiv.org/abs/2609.40293 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_258d3179df63 (Metraipolis archive dc_258d3179df63, sha256 f79fddf7d8f287bded3f60e94aeece129aaff4046ed95a56ce5a603594481d04)
BibTeX
@misc{dc258d3179df63,
title = {Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM — arXiv:2609.40293},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.40293},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_258d3179df63; sha256 f79fddf7d8f287bded3f60e94aeece129aaff4046ed95a56ce5a603594481d04},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40293. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In classical fine-grained complexity, the 3SUM Conjecture is used to prove a variety of conditional lower bounds on data structure and graph problems via an initial reduction to the SetDisjointness problem. However, there is an $\tilde{O}(n)$-time quantum algorithm for 3SUM and a direct application of Grover's algorithm to SetDisjointness queries beats the state-of-the-art classical conditional bound by Kopelowitz, Pettie, and Porat (SODA 2016); this shows that these classical bounds do not apply in the quantum setting. Thus establishing analogous conditional lower bounds in the quantum setting requires applying the quantum 3SUM Conjecture to a \emph{quantum} fine-grained reduction from 3SUM to SetDisjointness. We give the first sub-linear time quantum reductions from 3SUM to online SetDisjointness. Via our reduction, the quantum 3SUM conjecture implies a $p + 2q \geqslant 1$ tradeoff bound for quantum SetDisjointness algorithms with $O(N^p)$ preprocessing time and $O(N^q)$ query time. We also give an analogous reduction from 3XOR. These results are derived from a general framework for fine-grained reductions to SetDisjointness which applies to any Abelian 3-Orthogonal Array (3OA) problem with suitable almost-linear hash functions.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.DS).
Categorie arXiv: Computational Complexity (cs.CC) ; Data Structures and Algorithms (cs.DS); Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.40293 — 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-07T14:50:37.687Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).