Metraipolis › archive › dc_fb24f7fb7edf

Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths — arXiv:2609.16198

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.16198
License (as archived)
CC0-1.0
Archived
2026-10-15T22:05:16.124Z
SHA-256 of the archived text
22e2c51bd6107abe13923863f447595d1a057cb1aa5417a956253a3ccadc5794
Stable URL of this page
https://metraipolis.com/documento/dc_fb24f7fb7edf

How to cite

Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths — arXiv:2609.16198 — arXiv (en), https://arxiv.org/abs/2609.16198 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb24f7fb7edf (Metraipolis archive dc_fb24f7fb7edf, sha256 22e2c51bd6107abe13923863f447595d1a057cb1aa5417a956253a3ccadc5794)
BibTeX
@misc{dcfb24f7fb7edf,
  title = {Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths — arXiv:2609.16198},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.16198},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb24f7fb7edf; sha256 22e2c51bd6107abe13923863f447595d1a057cb1aa5417a956253a3ccadc5794},
  year = {2026}
}

Archived text

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

A path in a quantum network is a chain of repeaters that distributes entanglement between two users. Selecting a path requires balancing the rate and quality (e.g., fidelity) of the delivered entanglement, but these quantities, unlike standard routing metrics, compose non-additively. The problem is compounded by link-level configuration choices (e.g., distillation rounds or emitter brightness tuning), each trading rate against fidelity, so that a path's performance depends jointly on its route and its per-link settings. We cast this joint path selection and configuration problem as a shortest path computation on a layered graph whose layers track discretized end-to-end fidelity. A single run returns the full rate fidelity Pareto frontier, from which the path maximizing any nondecreasing utility function of rate and fidelity can be selected. We prove that for certain utility functions (including the secret key rate of BB84), the method is a fully polynomial time approximation scheme, returning a near-optimal path within a specified tolerance. We further characterize exactly when cheaper scalarization-based routing suffices: it is optimal for utility functions with convex fidelity profiles, but can be arbitrarily suboptimal otherwise (e.g., for step-like, sigmoidal utilities), whereas the layered method remains reliable in all cases.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-16 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2609.16198 — 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-15T21:52:12.779Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).