{
  "annotation_id": "68c98f69-9eea-49e4-b333-f8dc188081f2",
  "date_created": "2026-03-02T18:02:37.247000Z",
  "date_modified": "2026-03-02T18:02:37.247000Z",
  "file_hash": "7e172ad644db0631a0c880836ed5a5f4562fb875688f91a04b92962792d71965",
  "private": false,
  "record": {
    "abstract": "Quantum parallelism is the main feature of quantum computation. In 1985 D.\nDeutsch showed that a single quantum computation may be sufficient to state\nwhether a two-valued function of a two-valued variable is constant or not.\nThough the generalized problem with unconstrained domain and range size admits\nno deterministic quantum solution, a fully probabilistic quantum algorithm is\npresented in which quantum parallelism is harnessed to achieve a quicker\nexploration of the domain with respect to the classical ``sampling\u0027\u0027 strategy.",
    "arxiv_id": "quant-ph/9702020",
    "authors": [
      "Giovanni Costantini",
      "Fabrizio Smeraldi"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Generalization of Deutsch\u0027s Example",
    "url": "https://arxiv.org/abs/quant-ph/9702020"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5aa353c4-e1e2-4961-9256-9d9df5004a0b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}