{
  "annotation_id": "32456399-e228-4b06-8ca9-c3a40ceae086",
  "date_created": "2026-03-02T18:02:37.568000Z",
  "date_modified": "2026-03-02T18:02:37.568000Z",
  "file_hash": "892047f98d6efc302d0aeba603fbcf74a28872c0bcd35192f82f03fb0878ab29",
  "private": false,
  "record": {
    "abstract": "We investigate the time T a quantum computer requires to factorize a given\nnumber dependent on the number of bits L required to represent this number. We\nstress the fact that in most cases one has to take into account that the\nexecution time of a single quantum gate is related to the decoherence time of\nthe qubits that are involved in the computation. Although exhibited here only\nfor special systems, this inter-dependence of decoherence and computation time\nseems to be a restriction in many current models for quantum computers and\nleads to the result that the computation time T scales much stronger with L\nthan previously expected.",
    "arxiv_id": "quant-ph/9512001",
    "authors": [
      "M. B. Plenio",
      "P. L. Knight"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.53.2986",
    "journal_ref": "Phys. Rev. A 53, 2986 (1996)",
    "title": "Realistic lower bounds for the factorization time of large numbers on a   quantum computer",
    "url": "https://arxiv.org/abs/quant-ph/9512001"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "14924e74-08a9-4922-8775-ae36dd6a0f68",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}