{
  "abstract": "Efficient end-to-end entanglement distribution in quantum information networks requires routing under limited resources and fidelity constraints. We study entanglement routing as a fidelity-constrained unsplittable multicommodity flow problem that maximizes the number of admitted requests. As a proof of concept, we integrate neutral-atom quantum optimization into a hybrid classical--quantum column-generation framework. A classical restricted master problem selects routes, while a pricing problem generates fidelity-feasible paths. We formulate this NP-hard constrained shortest-path pricing problem as a quadratic unconstrained binary optimization (QUBO) problem and address it with hardware-aware register embedding and instance-driven pulse shaping. To our knowledge, this is the first study of neutral-atom quantum optimization as a pricing oracle for fidelity-constrained entanglement routing. On small benchmark instances evaluated with neutral-atom processor emulators, the method, combined with warm-start and post-processing, achieves an optimality gap below 1% across all tested sizes; the selected simulated-annealing route-generation baseline exhibits gaps of up to 6%. These results indicate that the generated bitstrings can provide useful candidate routes for classical refinement within column generation. This proof of concept does not establish quantum utility or scalability; further evaluation on larger instances, against stronger classical baselines, and on quantum hardware is needed.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.37900",
  "author_total": 5,
  "authors": [
    {
      "name": "M. Yassine Naghmouchi"
    },
    {
      "name": "Quentin Ma"
    },
    {
      "name": "Agathe Blaise"
    },
    {
      "name": "René Veyland"
    },
    {
      "name": "Wesley Coelho"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/0975z9vgwgxk3.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.37900",
  "fulltext_url": null,
  "id": "0975z9vgwgxk3",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.37900",
  "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",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7214945324",
  "pdf_url": "https://arxiv.org/pdf/2609.37900",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-29",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/0975z9vgwgxk3.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:31Z",
      "native_id": "2609.37900",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.37900"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "A Neutral Atom-Based Hybrid Classical-Quantum Approach for the Entanglement Routing Problem",
  "title_text": "A Neutral Atom-Based Hybrid Classical-Quantum Approach for the Entanglement Routing Problem",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:31Z",
  "url": "https://research.draconitic.com/paper/0975z9vgwgxk3",
  "venue": "arXiv",
  "versions": []
}