https://xlin.io/tag/rate-allocation/Rate AllocationHugoBlox Kit (https://hugoblox.com)en-USTue, 11 Aug 2026 00:00:00 +0000https://xlin.io/media/icon_hu_ef29f1a521df3b19.pnghttps://xlin.io/tag/rate-allocation/https://xlin.io/publication/arxiv-26-quantum/Tue, 11 Aug 2026 00:00:00 +0000https://xlin.io/publication/arxiv-26-quantum/<h2 id="abstract">Abstract</h2> <p>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.</p> <p>Preprint, first submitted 2026-08-11.</p>