Metraipolis › archive › dc_2499534f30ff

Superlogarithmic Gap Result for LCLs on Trees in Quantum-LOCAL — arXiv:2608.16854

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.16854
License (as archived)
CC0-1.0
Archived
2026-10-18T19:02:13.776Z
SHA-256 of the archived text
d98116f86faeaeaad906329771544d98c70ad8349297d29f4367a8942e7f797c
Stable URL of this page
https://metraipolis.com/documento/dc_2499534f30ff

How to cite

Superlogarithmic Gap Result for LCLs on Trees in Quantum-LOCAL — arXiv:2608.16854 — arXiv (en), https://arxiv.org/abs/2608.16854 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2499534f30ff (Metraipolis archive dc_2499534f30ff, sha256 d98116f86faeaeaad906329771544d98c70ad8349297d29f4367a8942e7f797c)
BibTeX
@misc{dc2499534f30ff,
  title = {Superlogarithmic Gap Result for LCLs on Trees in Quantum-LOCAL — arXiv:2608.16854},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.16854},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2499534f30ff; sha256 d98116f86faeaeaad906329771544d98c70ad8349297d29f4367a8942e7f797c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16854. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We show that, on trees, any locally checkable labeling problem (LCL) $\Pi$ that can be solved by an $n^{o(1)}$-dependent distribution can also be solved by an $O(\log n)$-round deterministic LOCAL algorithm. The result is obtained through a rake-and-compress-style decomposition of the input tree, and local simulations of the bounded dependent distribution on the components of the decomposition. As a corollary to our result, any LCL problem on trees can either be solved by an $O(\log n)$ deterministic LOCAL algorithm, or requires $n^{\Omega(1)}$ rounds to solve by a quantum-LOCAL algorithm.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DC).
Categorie arXiv: Computational Complexity (cs.CC) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2608.16854 — 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-18T18:07:16.093Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).