Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning

• URL: http://arxiv.org/abs/2605.00246v1
• Date: Thu, 30 Apr 2026 21:27:41 GMT
• Title: Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning
• Abstract summary: We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model.<n>We also introduce Q-GUARD-WS, an extension that exploits per-link hardware quality estimates to allocate purification effort non-uniformly across Euclid hops.
• Score: 1.1200323437006519
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many quantum-network applications require end-to-end Bell pairs whose fidelity exceeds a request-specific threshold, but existing entanglement routing algorithms either optimize only throughput without regard for fidelity or enforce fidelity guarantees using centralized controllers with global link-state knowledge. We present Q-GUARD, an online entanglement routing algorithm that enforces per-request fidelity thresholds within a distributed protocol model in which nodes exchange link-state information only with their $k$-hop neighbors. After link outcomes are realized in each slot, Q-GUARD builds per-link purification cost tables from realized Bell pairs, allocates per-hop fidelity targets using a Werner-state equal-split rule, and selects between candidate path segments using a segment-local expected-goodput (EXG) metric that jointly accounts for swap success, purification overhead, and resource availability. We also introduce Q-GUARD-WS, an extension that exploits per-link hardware quality estimates to allocate purification effort non-uniformly across hops. On synthetic 100-node topologies with heterogeneous link fidelity and stochastic BBPSSW purification, Q-GUARD raises the qualified success rate from under 20\% to over 85\% on 4-hop paths and nearly doubles the qualified service radius in Euclidean distance relative to throughput-only and naive-purification baselines, while Q-GUARD-WS provides additional throughput gains under high hardware heterogeneity.

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)
• Quantum Interference as a Proposal Mechanism for Combinatorial Optimization [0.0]
  Quantum Proposal Interference Search (QIPS) uses seed-conditioned quantum circuits to generate localized interference patterns.<n>QIPS is used to update an elite frontier of low-energy solutions.<n>Performance is assessed using top-$K$ coverage, hit rate, multiplicity, Hilbert-space coverage and dyadic-rank metrics.
  arXiv  Detail & Related papers  (2026-07-29T22:54:13Z)
• 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)
• Distributed Variational Quantum Optimisation by Entanglement-Selective Transport [0.0]
  We introduce QESTO, a distributed variational ansatz for graph-based discrete optimisation.<n>It encodes local constraint information in Bell pairs that is leveraged to produce amplitude transfer towards globally valid solution states.<n>Results suggest that persistent entanglement can support useful variational communication while reducing per-layer non-local gate overhead.
  arXiv  Detail & Related papers  (2026-06-03T07:33:30Z)
• Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing [0.0]
  In the Noisy Intermediate-Scale Quantum (NISQ) era, limited error rates directly constrain circuit fidelity.<n>We propose a framework the Digital Annealer (DA) via two strategies: (1) Hybrid, which uses DA-driven global initial mapping combined with high qu-speed routing by Qiskit, and (2) Full DA, which solves subproblems within an iterative workflow.<n>Our results indicate that for high-precision where gate noise is the primary bottleneck, DA-assisted global initial placement provides a practical "time-for-" tradeoff for enhancing the utility of near-term quantum hardware.
  arXiv  Detail & Related papers  (2026-05-12T04:19:51Z)
• RADAR-Q: Resource-Aware Distributed Asynchronous Routing for Entanglement Distribution in Multi-Tenant Quantum Networks [11.815937275904467]
  Quantum networks must support concurrent entanglement requests, yet existing routing protocols fail when users compete for shared repeater resources.<n>This paper presents RADAR-Q, a resource-aware decentralized routing protocol embedding real-time resource contention into path selection.
  arXiv  Detail & Related papers  (2026-03-29T08:10:41Z)
• QoS-Aware Hierarchical Reinforcement Learning for Joint Link Selection and Trajectory Optimization in SAGIN-Supported UAV Mobility Management [52.15690855486153]
  A space-air-ground integrated network (SAGIN) has emerged as an essential architecture for enabling ubiquitous UAV connectivity.<n>This paper formulates UAV mobility management in SAGIN as a constrained multiobjective joint optimization problem.
  arXiv  Detail & Related papers  (2025-12-17T06:22:46Z)
• Provably Optimal Quantum Circuits with Mixed-Integer Programming [0.0]
  We present a depth-aware optimization framework for quantum circuit compilation.<n>For exact synthesis of a target unitary, we formulate a mixed-integer linear program (MILP) that linearly global-phase equivalence.<n>To scale beyond exact MILP, we propose a novel rolling-Circuit optimization (RHO) that rolls primarily in time, caps the active-qubits, and enforces per-qubit closure.
  arXiv  Detail & Related papers  (2025-10-01T08:25:43Z)
• 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)
• Network-assisted collective operations for efficient distributed quantum computing [0.0]
  We propose a scheme for the distribution of collective quantum operations among remote quantum processing units.<n>We show that a general diagonal gate can be distributed among any number of nodes and provide the ebit cost bounds.<n>We provide an exact implementation of a distributed Grover's search algorithm using this protocol to partition the circuit.
  arXiv  Detail & Related papers  (2025-02-26T13:13:13Z)
• Improving and benchmarking NISQ qubit routers [0.0]
  We benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities.<n>We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads.
  arXiv  Detail & Related papers  (2025-02-06T09:31:51Z)
• 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)
• Optimal Fidelity-Aware Entanglement Distribution in Linear Quantum Networks [5.136852624384612]
  We study the problem of maximizing a utility function that captures the total fidelity of end-to-end entanglements in a two-link linear quantum network. We propose two algorithms, the Purify-then-Swap (PtS) and Swap-then-Purify (StP) ones, where the decisions about purification and swapping are taken with different order.
  arXiv  Detail & Related papers  (2024-07-12T11:09:30Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• 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)

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.