{
  "annotation_id": "07d31255-d6dc-43dc-abd8-8fab29702e57",
  "date_created": "2026-03-02T18:01:49.225000Z",
  "date_modified": "2026-03-02T18:01:49.225000Z",
  "file_hash": "cb699b1ef8a72fce3c53046fd89c6ba00b20137943fc9c1d06c458247e058d09",
  "private": false,
  "record": {
    "abstract": "With current technologies, it seems to be very difficult to implement quantum\ncomputers with many qubits. It is therefore of importance to simulate quantum\nalgorithms and circuits on the existing computers. However, for a large-size\nproblem, the simulation often requires more computational power than is\navailable from sequential processing. Therefore, the simulation methods using\nparallel processing are required.\n  We have developed a general-purpose simulator for quantum computing on the\nparallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We\nhave performed Shor\u0027s factorization and Grover\u0027s database search by using the\nsimulator, and we analyzed robustness of the corresponding quantum circuits in\nthe presence of decoherence and operational errors. The corresponding results,\nstatistics and analyses are presented.",
    "arxiv_id": "quant-ph/0201042",
    "authors": [
      "Jumpei Niwa",
      "Keiji Matsumoto",
      "Hiroshi Imai"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.66.062317",
    "title": "General-Purpose Parallel Simulator for Quantum Computing",
    "url": "https://arxiv.org/abs/quant-ph/0201042"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "00263012-a10d-4ba6-b86a-065f87524b1e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}