This paper forms three rate-allocation problems: rate sum, rate sum subject to minimum-rate constraints, and max-min fairness, and presents fully polynomial-time approximation schemes (FPTAS) for solving these optimization problems.
Abstract
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.
As practical quantum networks approach large-scale deployment, the need for efficient user-to-user frequency allocation is increasing, yet current approaches only provide partial solutions to the routing and spectrum allocation problem for an arbitrary quantum network. We address this challenge for repeater-less flex-g...
Zachary Goisman, M. L. Stevens, Maxwell Goisman et al.· 0 citations
This work constructs a link control protocol that dynamically adapts source pump power and polarization compensation to maximize entanglement distribution rate subject to a minimum fidelity constraint and shows that software-based physical layer control can provide a practical mechanism for improving near-term quantum...
C. Clayton, C. Nunn, Quinn Carmack et al.· 0 citations
In this study, for the first time, a novel routing and purification approach for quantum networks is presented, using the end-to-end (E2E) relative entropy of coherence (REC) together with E2E fidelity to determine the purification level and the feasibility of candidate paths.
Hilal Sultan Duranoglu Tunc, Joy Halder, Azita Hajizade et al.· Scientific Reports· 0 citations
It is proved that any optimal backbone configuration must correspond to a capacity-maximizing Voronoi tessellation of the network region, and this can be efficiently approximated by a centroidal Voronoi tessellation via Lloyd's algorithm, with backbone nodes connected according to a Delaunay triangulation.
A. Fletcher, Ignazio Pedone, S. Pirandola· 0 citations
This paper proposes a virtual-link purification strategy in which multiple EPR pairs are used at each stage to create virtual links between non-adjacent nodes and then purified in cascade using symmetric purification.
David Tavares, D. Abreu, Antônio J. G. Abelém· Anais do I Simpósio Brasilei...· 0 citations
We establish operational limits on the broadcasting of genuine multipartite entanglement (GME) in quantum networks. Using a distributed protocol in which each of N parties locally implements optimal 1 $\to$ 2 cloning via beam-splitter interactions, we derive exact expressions for the broadcast fidelity of Greenberger-H...
Pritam Roy, W. Munro, Shashank Gupta· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
