Fidelity Aware Multipath Routing for Multipartite State Distribution in Quantum Networks

• URL: http://arxiv.org/abs/2503.03831v1
• Date: Wed, 05 Mar 2025 19:00:11 GMT
• Title: Fidelity Aware Multipath Routing for Multipartite State Distribution in Quantum Networks
• Abstract summary: We consider the problem of distributing entangled multipartite states across a quantum network with improved distribution rate and fidelity.<n>We propose fidelity-aware multi-path routing protocols, assess their performance in terms of the rate and fidelity of the distributed Greenberger-Horne-Zeilinger (GHZ) states, and compare such performance against that of single-path routing.
• Score: 49.1574468325115
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of distributing entangled multipartite states across a quantum network with improved distribution rate and fidelity. For this, we propose fidelity-aware multi-path routing protocols, assess their performance in terms of the rate and fidelity of the distributed Greenberger-Horne-Zeilinger (GHZ) states, and compare such performance against that of single-path routing. Simulation results show that the proposed multi-path routing protocols select routes that require more Bell states compared to single-path routing, but also require fewer rounds of Bell state generation. We also optimised the trade-off between distribution rate and fidelity by selecting an appropriate cutoff to the quantum memory storage time. Using such a cutoff technique, the proposed multi-path protocols can achieve up to a 8.3 times higher distribution rate and up to a 28\% improvement in GHZ state fidelity compared to single-path routing. These results show that multi-path routing, both improves the distribution rates and enhances fidelity for multipartite state distribution.

Related papers

• Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths [20.986889484035093]
  A path in a quantum network is a chain of repeaters that distributes entanglement between two users.<n>We show how a path's performance depends jointly on its route and its per-link settings.<n>A single run returns the full rate fidelity frontier, from which the path maximizing any nondecreasing utility function can be selected.
  arXiv  Detail & Related papers  (2026-09-14T18:30:46Z)
• Efficient routing and spectrum allocation in arbitrary flex-grid entanglement networks [11.448612804302783]
  We present a three-stage pipeline for efficient user-to-user frequency allocation in a quantum network.<n>We numerically demonstrate this approach on a representative ring network and a Manhattan incumbent local exchange carrier topology.
  arXiv  Detail & Related papers  (2026-07-16T21:20:35Z)
• Stochastic Multipath Routing for High-Throughput Entanglement Distribution in Quantum Repeater Networks [6.036769600366487]
  Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs.<n>Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to run in real time.<n>Here we propose and analyze a simple alternative: a multipath rule in which each entanglement request is sent at random along one of several edge-disjoint paths.
  arXiv  Detail & Related papers  (2026-03-26T15:36:08Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• Comparando Estrat\'egias de Roteamento em Redes Qu\^anticas Oportun\'isticas [0.0]
  This paper presents a comparative analysis of three routing strategies in opportunistic quantum networks. routing strategies are compared based on the fidelity of the chosen routes, the number of entangled pairs created, and the number of route recalculations.
  arXiv  Detail & Related papers  (2023-11-03T01:52:26Z)
• Entanglement Routing Based on Fidelity Curves [0.0]
  We consider quantum networks where each link is characterized by a trade-off between the entanglement generation rate and fidelity. Two entanglement distribution models are considered: one where entangled qubits are distributed one at a time, and a flow model where a large number of entangled qubits are distributed simultaneously.
  arXiv  Detail & Related papers  (2023-03-22T18:59:36Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Fidelity-Guarantee Entanglement Routing in Quantum Networks [64.49733801962198]
  Entanglement routing establishes remote entanglement connection between two arbitrary nodes. We propose purification-enabled entanglement routing designs to provide fidelity guarantee for multiple Source-Destination (SD) pairs in quantum networks.
  arXiv  Detail & Related papers  (2021-11-15T14:07:22Z)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)
• Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach [0.0]
  We consider the problem of optimising the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum internet. We construct an efficient linear programming formulation that computes the maximum achievable entanglement distribution rate. We point out a practical entanglement generation protocol which can achieve those rates.
  arXiv  Detail & Related papers  (2020-05-28T21:30:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.