{
  "annotation_id": "f8f608bb-f103-48e6-9bf8-e8bb1f0754d1",
  "date_created": "2026-03-02T18:02:38.070000Z",
  "date_modified": "2026-03-02T18:02:38.070000Z",
  "file_hash": "fba44878858f6875f1dbdef839de8a3988f104bc1b45295452cedb6c443eb65a",
  "private": false,
  "record": {
    "abstract": "Recent theoretical results confirm that quantum theory provides the\npossibility of new ways of performing efficient calculations. The most striking\nexample is the factoring problem. It has recently been shown that computers\nthat exploit quantum features could factor large composite integers. This task\nis believed to be out of reach of classical computers as soon as the number of\ndigits in the number to factor exceeds a certain limit. The additional power of\nquantum computers comes from the possibility of employing a superposition of\nstates, of following many distinct computation paths and of producing a final\noutput that depends on the interference of all of them. This ``quantum\nparallelism\u0027\u0027 outstrips by far any parallelism that can be thought of in\nclassical computation and is responsible for the ``exponential\u0027\u0027 speed-up of\ncomputation.\n  This is a non-technical (or at least not too technical) introduction to the\nfield of quantum computation. It does not cover very recent topics, such as\nerror-correction.",
    "arxiv_id": "quant-ph/9612014",
    "authors": [
      "Adriano Barenco"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1080/00107519608217543",
    "journal_ref": "Contemp.Phys.37:375-389,1996",
    "title": "Quantum Physics and Computers",
    "url": "https://arxiv.org/abs/quant-ph/9612014"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "adae1069-b307-406c-9eb5-91dca7be6db5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}