Metraipolis › archive › dc_6dd8f4e6e480
Connectivity Bounds for GHZ Graphs — arXiv:2610.22190
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22190
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:34:26.171Z
- SHA-256 of the archived text
ba4c35e56d280a5dddd53bdeb557ecf00c40adac7aa3c888b5a6ca25a9f1cc31- Stable URL of this page
https://metraipolis.com/documento/dc_6dd8f4e6e480
How to cite
Connectivity Bounds for GHZ Graphs — arXiv:2610.22190 — arXiv (en), https://arxiv.org/abs/2610.22190 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6dd8f4e6e480 (Metraipolis archive dc_6dd8f4e6e480, sha256 ba4c35e56d280a5dddd53bdeb557ecf00c40adac7aa3c888b5a6ca25a9f1cc31)
BibTeX
@misc{dc6dd8f4e6e480,
title = {Connectivity Bounds for GHZ Graphs — arXiv:2610.22190},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22190},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6dd8f4e6e480; sha256 ba4c35e56d280a5dddd53bdeb557ecf00c40adac7aa3c888b5a6ca25a9f1cc31},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22190. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Greenberger-Horne-Zeilinger (GHZ) states are multipartite entangled quantum states that play a central role in quantum information theory, with applications in quantum communication, cryptography, and distributed quantum computing. A major experimental goal is to create high-dimensional GHZ states using multiple entangled parties. Krenn, Gu and Zeilinger discovered a surprising bridge between these quantum-optical experiments and graph theory: certain photonic experiments can be represented by edge-coloured, edge-weighted graphs, and the dimension of the produced GHZ state equals the number of feasible monochromatic inherited vertex colourings. This led Krenn and Gu to conjecture that every GHZ graph with more than four vertices has dimension at most $2$. A counterexample would give a new high-dimensional multipartite GHZ construction, while a proof would clarify fundamental resource limitations in quantum optics. It is known that the conjecture holds for graphs of vertex connectivity at most $2$ [MFCS 2024], and that simple GHZ graphs with $n>4$ vertices have dimension less than $n/\sqrt{2}$ [Quantum 2024]. However, no general upper bound depending only on vertex connectivity was known. We prove that every simple connected GHZ graph $G$ with at least four vertices has dimension at most $2^{\kappa(G)-1}+\binom{\kappa(G)}{2}$, where $\kappa(G)$ is the vertex connectivity of $G$. We also prove new bounds in terms of edge connectivity and maximum degree.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.22190 — 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-16T08:50:47.621Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).