{
  "annotation_id": "ede61779-7611-48cb-912f-b57f4d76b0dd",
  "date_created": "2026-03-02T18:02:41.529000Z",
  "date_modified": "2026-03-02T18:02:41.529000Z",
  "file_hash": "36b035c64d5c0eac87ad4e410fcbd49749865db877f62c99da12b027b98bf623",
  "private": false,
  "record": {
    "abstract": "A Quantum Computer is a new type of computer which can efficiently solve\ncomplex problems such as prime factorization. A quantum computer threatens the\nsecurity of public key encryption systems because these systems rely on the\nfact that prime factorization is computationally difficult. Errors limit the\neffectiveness of quantum computers. Because of the exponential nature of\nquantum com puters, simulating the effect of errors on them requires a vast\namount of processing and memory resources. In this paper we describe a parallel\nsimulator which accesses the feasibility of quantum computers. We also derive\nand validate an analytical model of execution time for the simulator, which\nshows that parallel quantum computer simulation is very scalable.",
    "arxiv_id": "quant-ph/9804039",
    "authors": [
      "Kevin M. Obenland",
      "Alvin M. Despain"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Parallel Quantum Computer Simulator",
    "url": "https://arxiv.org/abs/quant-ph/9804039"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "faa02d8c-4f6d-4560-a989-07bc8d21dde2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}