{
  "annotation_id": "4571a96c-6750-49a5-9c09-c3e989918f0c",
  "date_created": "2026-03-02T18:01:56.181000Z",
  "date_modified": "2026-03-02T18:01:56.181000Z",
  "file_hash": "7f9777d4e02d57300cee12bb1a660f42ac21d0ee6994df197d8eb2c1af2c8f30",
  "private": false,
  "record": {
    "abstract": "We examine the \"Guessing Secrets\" problem arising in internet routing, in\nwhich the goal is to discover two or more objects from a known finite set. We\npropose a quantum algorithm using O(1) calls to an O(logN) oracle. This\nimproves upon the best known classical result, which uses O(logN) questions and\nrequires an additional O(logN^3) steps to produce the answer. In showing the\npossibilities of this algorithm, we extend the types of questions and function\noracles that the Deutsch-Jozsa algorithm can be used to solve.",
    "arxiv_id": "quant-ph/0301025",
    "authors": [
      "Michael Nathanson"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Guessing via Deutsch-Jozsa",
    "url": "https://arxiv.org/abs/quant-ph/0301025"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e33b7039-2c20-49a6-8977-bd7d809bc039",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}