{
  "annotation_id": "508b8fca-d027-4cb4-9248-c032aac01247",
  "date_created": "2026-03-02T18:01:52.099000Z",
  "date_modified": "2026-03-02T18:01:52.099000Z",
  "file_hash": "9c5cf5226e16f14d5c9f2ef0493e55a4d74e30be49617fbd1caf1b98f6815fb2",
  "private": false,
  "record": {
    "abstract": "Since simulating quantum computers requires exponentially more classical\nresources, efficient algorithms are extremely helpful. We analyze algorithms\nthat create single qubit and specific controlled qubit matrix representations\nof gates.\n  Additionally, we use the simulator to investigate errors based on different\nprobability distributions and to investigate the robustness of different\n2-qubit multiplier circuits in the presence of operational errors.",
    "arxiv_id": "quant-ph/0208113",
    "authors": [
      "Eric Hsu"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Computing Simulation Optimizations and Operational Errors on   Various 2-qubit Multiplier Circuits",
    "url": "https://arxiv.org/abs/quant-ph/0208113"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ac76ab41-6b52-4506-b71c-e4959c11822f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}