{
  "annotation_id": "a4bc0231-313a-4a57-b9ec-ea96a780fbe4",
  "date_created": "2026-03-02T18:02:16.729000Z",
  "date_modified": "2026-03-02T18:02:16.729000Z",
  "file_hash": "5f02956e02a1c842960ff3fd3765d7695686e80555587cc5e69812b537e989b8",
  "private": false,
  "record": {
    "abstract": "This thesis deals with a series of quantum computer implementation issues\nfrom the Kane 31P in 28Si architecture to Shor\u0027s integer factoring algorithm\nand beyond. The discussion begins with simulations of the adiabatic Kane CNOT\nand readout gates, followed by linear nearest neighbor implementations of\n5-qubit quantum error correction with and without fast measurement. A linear\nnearest neighbor circuit implementing Shor\u0027s algorithm is presented, then\nmodified to remove the need for exponentially small rotation gates. Finally, a\nmethod of constructing optimal approximations of arbitrary single-qubit\nfault-tolerant gates is described and applied to the specific case of the\nremaining rotation gates required by Shor\u0027s algorithm.",
    "arxiv_id": "quant-ph/0506126",
    "authors": [
      "Austin G. Fowler"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Towards Large-Scale Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0506126"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d4af21fb-c5aa-4f4e-bb4d-bfd25dd7389d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}