Stochastic Multipath Routing for High-Throughput Entanglement Distribution in Quantum Repeater Networks

• URL: http://arxiv.org/abs/2603.25563v2
• Date: Sat, 28 Mar 2026 09:06:39 GMT
• Title: Stochastic Multipath Routing for High-Throughput Entanglement Distribution in Quantum Repeater Networks
• Abstract summary: 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.
• Score: 6.036769600366487
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum repeater networks distribute entanglement over lossy links while many users share a limited pool of entangled pairs. Most existing routing schemes either always use a single best path or rely on global optimizations that are hard to run in real time. Here we propose and analyze a simple alternative: a stochastic multipath rule in which each entanglement request is sent at random along one of several edge-disjoint repeater paths, with a single parameter that controls the bias between shorter and longer routes. Using a distance-dependent lossy network model with finite per-link capacities and probabilistic entanglement swapping, we develop an analytic description of the resulting end-to-end entanglement rate as a function of this bias and validate it with large-scale numerical simulations. We find that an intermediate bias consistently outperforms both deterministic extremes across distances, traffic patterns, attenuation, swapping noise, and congestion, bringing the rate close to simple capacity upper bounds and making link usage more even across networks. These results identify stochastic multipath routing as a lightweight classical control strategy for boosting performance and scalability in near-term quantum repeater networks.

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)
• Quantum Routing Beyond Pathfinding: Multipartite Entanglement Complementation [5.192590792600339]
  We propose a novel entanglement-driven routing framework for quantum networks.<n>We extend this framework to inter-domain quantum networks and design a time algorithm.<n>Performance analysis shows the proposed routing strategy achieves up to $60%$ hop reduction.
  arXiv  Detail & Related papers  (2026-04-15T13:07:14Z)
• Efficient and Interpretable Multi-Agent LLM Routing via Ant Colony Optimization [58.59491516762626]
  We propose AMRO-S, an efficient and interpretable routing framework for Multi-Agent Systems (MAS)<n>AMRO-S models MAS routing as a semantic-conditioned path selection problem, enhancing routing performance through three key mechanisms.<n>Extensive experiments on five public benchmarks and high-concurrency stress tests demonstrate that AMRO-S consistently improves the quality--cost trade-off over strong routing baselines.
  arXiv  Detail & Related papers  (2026-03-13T12:26:05Z)
• A Differentiable Digital Twin of Distributed Link Scheduling for Contention-Aware Networking [42.12511690811535]
  We develop an analytical network digital twin (NDT) that predicts link duty cycles from network context.<n>NDT accurately predicts link duty cycles and congestion patterns with up to a 5000x speedup over packet-level simulation.
  arXiv  Detail & Related papers  (2025-12-11T18:04:30Z)
• Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks [49.1574468325115]
  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.
  arXiv  Detail & Related papers  (2025-03-05T19:00:11Z)
• Smart Routing with Precise Link Estimation: DSEE-Based Anypath Routing for Reliable Wireless Networking [6.123324869194196]
  Shortest Anypath routing offers a solution by adapting routing decisions based on real-time link conditions. This paper introduces a novel approach that leverages the Deterministic Sequencing of Exploration and Exploitation (DSEE), a multi-armed bandit algorithm. By coupling DSEE with Anypath routing, this algorithm continuously learns and ensures accurate delivery probability estimation.
  arXiv  Detail & Related papers  (2024-05-16T18:16:56Z)
• 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)
• Interference-Limited Ultra-Reliable and Low-Latency Communications: Graph Neural Networks or Stochastic Geometry? [45.776476161876204]
  We build a cascaded Random Edge Graph Neural Network (REGNN) to represent the repetition scheme and train it. We analyze the violation probability using geometry in a symmetric scenario and apply a model-based Exhaustive Search (ES) method to find the optimal solution.
  arXiv  Detail & Related papers  (2022-07-11T05:49:41Z)
• 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)
• Entanglement Distribution in Multi-Platform Buffered-Router-Assisted Frequency-Multiplexed Automated Repeater Chains [0.0]
  We propose a quantum network architecture based on quantum processing devices based on NV$-$ colour centers. Long-distance entanglement distribution is enabled by spectrally-multiplexed quantum repeaters based on rare-earth ion-doped crystals and imperfect entangled photon-pair sources.
  arXiv  Detail & Related papers  (2021-06-08T20:25:43Z)
• Manifold Regularized Dynamic Network Pruning [102.24146031250034]
  This paper proposes a new paradigm that dynamically removes redundant filters by embedding the manifold information of all instances into the space of pruned networks. The effectiveness of the proposed method is verified on several benchmarks, which shows better performance in terms of both accuracy and computational cost.
  arXiv  Detail & Related papers  (2021-03-10T03:59:03Z)
• 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)

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.