Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning
Anthony Gatti, Anoosha Fayyaz, Prashant Krishnamurthy, Kaushik P. Seshadreesan, and Amy Babay

TL;DR
Q-GUARD is a distributed entanglement routing algorithm that guarantees fidelity thresholds for quantum networks, significantly improving success rates and service radius over existing methods.
Contribution
The paper introduces Q-GUARD, a novel distributed protocol for fidelity-guaranteed entanglement routing, including an extension that optimizes purification efforts based on hardware quality.
Findings
Q-GUARD increases qualified success rate from under 20% to over 85% for 4-hop paths.
Q-GUARD nearly doubles the qualified service radius compared to baseline methods.
Q-GUARD-WS further improves throughput under hardware heterogeneity.
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 -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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
