{
  "annotation_id": "51f7c632-592e-49aa-8fbb-ad657e9844cb",
  "date_created": "2026-03-02T18:02:37.384000Z",
  "date_modified": "2026-03-02T18:02:37.384000Z",
  "file_hash": "77c54becd28db6a0cc1250c0c11ffa18bf54041c5381f1eeacd661014095ed47",
  "private": false,
  "record": {
    "abstract": "We consider how to optimize memory use and computation time in operating a\nquantum computer. In particular, we estimate the number of memory qubits and\nthe number of operations required to perform factorization, using the algorithm\nsuggested by Shor. A $K$-bit number can be factored in time of order $K^3$\nusing a machine capable of storing $5K+1$ qubits. Evaluation of the modular\nexponential function (the bottleneck of Shor\u0027s algorithm) could be achieved\nwith about $72 K^3$ elementary quantum gates; implementation using a linear ion\ntrap would require about $396 K^3$ laser pulses. A proof-of-principle\ndemonstration of quantum factoring (factorization of 15) could be performed\nwith only 6 trapped ions and 38 laser pulses. Though the ion trap may never be\na useful computer, it will be a powerful device for exploring experimentally\nthe properties of entangled quantum states.",
    "arxiv_id": "quant-ph/9602016",
    "authors": [
      "David Beckman",
      "Amalavoyal N. Chari",
      "Srikrishna Devabhaktuni",
      "John Preskill"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.54.1034",
    "journal_ref": "Phys. Rev.A54:1034-1063,1996",
    "title": "Efficient Networks for Quantum Factoring",
    "url": "https://arxiv.org/abs/quant-ph/9602016"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "72d18c6a-9161-4fe5-9d56-0347fa53410b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}