{
  "annotation_id": "65240af7-23df-48bb-bc05-e7817ad19e9f",
  "date_created": "2026-03-02T18:02:45.184000Z",
  "date_modified": "2026-03-02T18:02:45.184000Z",
  "file_hash": "3f4def4ca1db137efb4016b26e198f7500370c49e69730e2625cbeb60add9d72",
  "private": false,
  "record": {
    "abstract": "A typical oracle problem is finding which software program is installed on a\ncomputer, by running the computer and testing its input-output behaviour. The\nprogram is randomly chosen from a set of programs known to the problem solver.\nAs well known, some oracle problems are solved more efficiently by using\nquantum algorithms; this naturally implies changing the computer to quantum,\nwhile the choice of the software program remains sharp. In order to highlight\nthe non-mechanistic origin of this higher efficiency, also the uncertainty\nabout which program is installed must be represented in a quantum way.",
    "arxiv_id": "quant-ph/9902027",
    "authors": [
      "Giuseppe Castagnoli"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Non-Mechanism in Quantum Oracle Computing",
    "url": "https://arxiv.org/abs/quant-ph/9902027"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8fcda546-6dd8-4a5e-8984-4a3ba197620c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}