Metraipolis › archive › dc_c7b8db508cf3

Generating Dicke State Graphs — arXiv:2609.22564

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.22564
License (as archived)
CC0-1.0
Archived
2026-10-09T21:50:13.419Z
SHA-256 of the archived text
07c3c7ff1ba0616aeb059740d668deaff9111b200377c230587faef18f30db7a
Stable URL of this page
https://metraipolis.com/documento/dc_c7b8db508cf3

How to cite

Generating Dicke State Graphs — arXiv:2609.22564 — arXiv (en), https://arxiv.org/abs/2609.22564 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c7b8db508cf3 (Metraipolis archive dc_c7b8db508cf3, sha256 07c3c7ff1ba0616aeb059740d668deaff9111b200377c230587faef18f30db7a)
BibTeX
@misc{dcc7b8db508cf3,
  title = {Generating Dicke State Graphs — arXiv:2609.22564},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.22564},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c7b8db508cf3; sha256 07c3c7ff1ba0616aeb059740d668deaff9111b200377c230587faef18f30db7a},
  year = {2026}
}

Archived text

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

Graph theory is a powerful tool in quantum computing, with applications ranging from quantum circuit synthesis and optimization to entanglement mapping. Recent work has shown how one can use edge-colored graphs to model photonic experiments that generate GHZ and W states. However, the latter work also proved that verifying that a graph models a Dicke state experiment is coNP-complete. In this work, we provide families of graphs that generate $|D_{k}^a\rangle \otimes |0\rangle^{\otimes b }$, where $b = |a-2k|$ is the number of spectator modes. The graph setup consists of a doubled complete subgraph on $a$ vertices and a collection of auxiliary vertices. We prove that every coincidence carries exactly $k$ excitations, every weight-$k$ computational basis state on bitstrings of length $a$ is realized, and each of those bitstrings is realized exactly $(n/2)!$ times, where $n = a+b$. Since verifying the Dicke FORALL condition is coNP-complete in general, constructing explicit families that provably generate Dicke states is of interest.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Quantum Physics (quant-ph) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.22564 — 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-09T21:26:41.173Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).