{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2605.00246",
  "author_total": 5,
  "authors": [
    {
      "name": "Anthony Gatti"
    },
    {
      "name": "Anoosha Fayyaz"
    },
    {
      "name": "Prashant Krishnamurthy"
    },
    {
      "name": "Kaushik P. Seshadreesan"
    },
    {
      "name": "Amy Babay"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/7qc255sjvsrnt.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2605.00246",
  "fulltext_url": null,
  "id": "7qc255sjvsrnt",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2605.00246",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.NI"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7160090952",
  "pdf_url": "https://arxiv.org/pdf/2605.00246",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-25",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/7qc255sjvsrnt.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:35Z",
      "native_id": "2605.00246",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2605.00246"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning",
  "title_text": "Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:35Z",
  "url": "https://research.draconitic.com/paper/7qc255sjvsrnt",
  "venue": "arXiv",
  "versions": []
}