{
  "id": "quant-ph/9512001",
  "version": "v1",
  "published": "1995-12-02T16:50:35.000Z",
  "updated": "1995-12-02T16:50:35.000Z",
  "title": "Realistic lower bounds for the factorization time of large numbers on a quantum computer",
  "authors": [
    "M. B. Plenio",
    "P. L. Knight"
  ],
  "comment": "10 pages + 3 latex-figures",
  "journal": "Phys. Rev. A 53, 2986 (1996)",
  "doi": "10.1103/PhysRevA.53.2986",
  "categories": [
    "quant-ph"
  ],
  "abstract": "We investigate the time T a quantum computer requires to factorize a given number dependent on the number of bits L required to represent this number. We stress the fact that in most cases one has to take into account that the execution time of a single quantum gate is related to the decoherence time of the qubits that are involved in the computation. Although exhibited here only for special systems, this inter-dependence of decoherence and computation time seems to be a restriction in many current models for quantum computers and leads to the result that the computation time T scales much stronger with L than previously expected.",
  "revisions": [
    {
      "version": "v1",
      "updated": "1995-12-02T16:50:35.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum computer",
      "realistic lower bounds",
      "factorization time",
      "large numbers",
      "computation time"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. A"
    },
    "note": {
      "typesetting": "LaTeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "inspire": 403014
    }
  }
}