{
  "abstract": "Quantum networks will rely on intermediate nodes to distribute entanglement, but the same nodes may learn which users are being connected. We introduce a minimal two-call routing primitive in which a user, Alice, establishes an entangled link with one of several clients while testing whether the provider, Bob, has disturbed a coherently encoded request. The construction adapts the hidden-order mechanism of quantum private queries: one call contains a direct request, the other a coherent superposition of the desired and null addresses, and Alice keeps their order secret. A private matching qubit held by the selected client restores the coherent test state after a favorable Bell-measurement outcome, so that Alice can test the returned query without any further operation by Bob. The claim is deliberately limited. The protocol shows that a routing request can carry a physical cheating test, and it detects an explicit destination-reading attack with nonzero probability. It does not yet provide a quantitative information-disturbance tradeoff, composable security, or certification of an unmeasured output against arbitrary attacks. We also characterize the exact perfect-pass limit, in which Bob's residual state, averaged over the private matching states, is independent of the destination.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.04359",
  "author_total": 3,
  "authors": [
    {
      "name": "S. F. E. Oliviero"
    },
    {
      "name": "S. Onofri"
    },
    {
      "name": "V. Giovannetti"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/d3kas9x7mye03.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.04359",
  "fulltext_url": null,
  "id": "d3kas9x7mye03",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.04359",
  "language": null,
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CR"
    ],
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Information and Cryptography"
    ]
  ],
  "openalex": "W7220666622",
  "pdf_url": "https://arxiv.org/pdf/2610.04359",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-03",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/d3kas9x7mye03.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2610.04359",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.04359"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "A Cheat-Sensitive Primitive for Destination-Private Quantum Routing",
  "title_text": "A Cheat-Sensitive Primitive for Destination-Private Quantum Routing",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:01Z",
  "url": "https://research.draconitic.com/paper/d3kas9x7mye03",
  "venue": "arXiv",
  "versions": []
}