{
  "annotation_id": "1ffe5025-d9a1-45c3-a842-808090eb40be",
  "date_created": "2026-03-02T18:01:59.928000Z",
  "date_modified": "2026-03-02T18:01:59.928000Z",
  "file_hash": "01b46deeacc61c759aa7392a8fbdbf72a768a2af5ea0cc74ce6966a33a20c550",
  "private": false,
  "record": {
    "abstract": "We develop a classical model of computation (the S model) which captures some\nimportant features of quantum computation, and which allows to design fast\nalgorithms for solving specific problems. In particular, we show that Deutsch\u0027s\nproblem can be trated within the S model of computation in the same way as\nwithin quantum computation; also Grover\u0027s search problem of an unsorted\ndatabase finds a surprisingly fast solution. The correct understanding of these\nresults put into a new perspective the relationship between quantum and\nclassical computation.",
    "arxiv_id": "quant-ph/0304074",
    "authors": [
      "A. Bassi",
      "G. C. Ghirardi"
    ],
    "categories": [
      "quant-ph",
      "hep-th"
    ],
    "title": "Quantum vs classical computation: a proposal opening a new perspective",
    "url": "https://arxiv.org/abs/quant-ph/0304074"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "469cb385-48bc-4f77-ae8e-a69cea11b6ca",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}