Metraipolis › archive › dc_ada12308f12f
Robust Entanglement Witnessing via Dense Network Coding with Graph States — arXiv:2609.32024
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32024
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T00:44:59.853Z
- SHA-256 of the archived text
602534f1f68cd7bd2a6c3fed153989a098e5b619f56e173dc7e8db9bf3d5f6ad- Stable URL of this page
https://metraipolis.com/documento/dc_ada12308f12f
How to cite
Robust Entanglement Witnessing via Dense Network Coding with Graph States — arXiv:2609.32024 — arXiv (en), https://arxiv.org/abs/2609.32024 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ada12308f12f (Metraipolis archive dc_ada12308f12f, sha256 602534f1f68cd7bd2a6c3fed153989a098e5b619f56e173dc7e8db9bf3d5f6ad)
BibTeX
@misc{dcada12308f12f,
title = {Robust Entanglement Witnessing via Dense Network Coding with Graph States — arXiv:2609.32024},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32024},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ada12308f12f; sha256 602534f1f68cd7bd2a6c3fed153989a098e5b619f56e173dc7e8db9bf3d5f6ad},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32024. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Practical tests for witnessing entanglement in the presence of noise are needed to verify and apply entanglement-based applications in real-world communication networks. Quantum dense network coding is a communication protocol that uses an entangled state preparation together with quantum communication to halve the amount of communication needed to evaluate certain bijective functions in networks having multiple senders and one receiver. In this work, we consider a dense network coding protocol that uses graph state entanglement to implement a family of affine transformations, we derive a bound on the success probability that can be achieved by classical networks, and we show that the noise robustness exponentially amplifies with the number of senders. We apply our results in a semi-device-independent protocol for robustly estimating the effective visibility of graph states and measurement bases. Overall, our approaches are robust to noise, can support the usage of uncharacterized state preparations or measurements, and can be applied to any graph state. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-29 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.32024 — 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-08T00:19:23.335Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).