Metraipolis › archive › dc_afe29e312d89

Quantum Advantage for Distributed Symmetry Breaking — arXiv:2609.26788

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26788
License (as archived)
CC0-1.0
Archived
2026-10-08T14:37:30.500Z
SHA-256 of the archived text
4d0c8dd507db0fcf8a368f574041bd4233be3ce4a91e90075b0774bda31bd111
Stable URL of this page
https://metraipolis.com/documento/dc_afe29e312d89

How to cite

Quantum Advantage for Distributed Symmetry Breaking — arXiv:2609.26788 — arXiv (en), https://arxiv.org/abs/2609.26788 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_afe29e312d89 (Metraipolis archive dc_afe29e312d89, sha256 4d0c8dd507db0fcf8a368f574041bd4233be3ce4a91e90075b0774bda31bd111)
BibTeX
@misc{dcafe29e312d89,
  title = {Quantum Advantage for Distributed Symmetry Breaking — arXiv:2609.26788},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26788},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_afe29e312d89; sha256 4d0c8dd507db0fcf8a368f574041bd4233be3ce4a91e90075b0774bda31bd111},
  year = {2026}
}

Archived text

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

We present a distributed quantum algorithm that $3$-colors cycles in $O(1)$ rounds, with high probability. It follows that all locally checkable labeling problems (LCLs) that have round complexity $O(\log^* n)$ in the classical LOCAL model can be solved in $O(1)$ rounds in the quantum-LOCAL model, with high probability; this includes problems such as maximal independent set and maximal matching in bounded-degree graphs. This presents the first natural examples of graph problems with an asymptotic distributed quantum advantage for the LOCAL model; all prior examples that separate LOCAL and quantum-LOCAL are artificial problems constructed merely for the sake of demonstrating quantum advantage.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-23 in cs.DC).
Categorie arXiv: Quantum Physics (quant-ph) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2609.26788 — 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-08T13:47:35.227Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).