{
  "annotation_id": "f2b5cd65-46a4-449a-942a-c449ad6d3a90",
  "date_created": "2026-03-02T18:02:38.020000Z",
  "date_modified": "2026-03-02T18:02:38.020000Z",
  "file_hash": "08635ce33ca3662ef597d79839d79fdc04d55c0ef56c8be9a835c1b491513808",
  "private": false,
  "record": {
    "abstract": "We describe an array of quantum gates implementing Shor\u0027s algorithm for prime\nfactorization in a quantum computer. The array includes a circuit for modular\nexponentiation with several subcomponents (such as controlled multipliers,\nadders, etc) which are described in terms of elementary Toffoli gates. We\npresent a simple analysis of the impact of losses and decoherence on the\nperformance of this quantum factoring circuit. For that purpose, we simulate a\nquantum computer which is running the program to factor N = 15 while\ninteracting with a dissipative environment. As a consequence of this\ninteraction randomly selected qubits may spontaneously decay. Using the results\nof our numerical simulations we analyze the efficiency of some simple error\ncorrection techniques.",
    "arxiv_id": "quant-ph/9601021",
    "authors": [
      "Cesar Miquel",
      "Juan Pablo Paz",
      "Roberto Perazzo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.54.2605",
    "title": "Factoring in a Dissipative Quantum Computer",
    "url": "https://arxiv.org/abs/quant-ph/9601021"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "44a6ec8b-52e6-41f5-9d1e-a32724ca0e5a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}