Metraipolis › archive › dc_6ab44a2cfa19

Multi-Pair Fidelity-Aware Rate Allocation in a Quantum Network: Approximation Schemes — arXiv:2608.11501

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11501
License (as archived)
CC0-1.0
Archived
2026-10-19T05:42:53.922Z
SHA-256 of the archived text
ee8f72bc244f9194cc5b4bb4576c9988e0032fec87bc4b20b7521ddd23e1b3e6
Stable URL of this page
https://metraipolis.com/documento/dc_6ab44a2cfa19

How to cite

Multi-Pair Fidelity-Aware Rate Allocation in a Quantum Network: Approximation Schemes — arXiv:2608.11501 — arXiv (en), https://arxiv.org/abs/2608.11501 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6ab44a2cfa19 (Metraipolis archive dc_6ab44a2cfa19, sha256 ee8f72bc244f9194cc5b4bb4576c9988e0032fec87bc4b20b7521ddd23e1b3e6)
BibTeX
@misc{dc6ab44a2cfa19,
  title = {Multi-Pair Fidelity-Aware Rate Allocation in a Quantum Network: Approximation Schemes — arXiv:2608.11501},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11501},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6ab44a2cfa19; sha256 ee8f72bc244f9194cc5b4bb4576c9988e0032fec87bc4b20b7521ddd23e1b3e6},
  year = {2026}
}

Archived text

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

Entanglement distribution in quantum networks must jointly account for limited link capacities, probabilistic entanglement swapping, and heterogeneous link fidelities. In this paper, we study multi-pair fidelity-aware rate allocation in quantum networks. We formulate three rate-allocation problems: rate sum, rate sum subject to minimum-rate constraints, and max-min fairness. Prior work has studied a special case of the rate sum problem, where all links have identical fidelity. This special case admits a polynomial-time algorithm. We prove that all three problems are NP-hard. We then study optimization versions of these problems which maximize the minimum end-to-end fidelity subject to throughput or fairness requirements. We present fully polynomial-time approximation schemes (FPTAS) for solving these optimization problems. Experiments on randomly generated networks demonstrate the computational effectiveness of the proposed schemes.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-13 in cs.NI).
Categorie arXiv: Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2608.11501 — 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-19T05:31:33.345Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).