{
  "annotation_id": "1631e5ed-128a-4ab0-8516-37f4fed5836c",
  "date_created": "2026-03-02T18:02:03.410000Z",
  "date_modified": "2026-03-02T18:02:03.410000Z",
  "file_hash": "c15a713b4ee03c31d0dbd374afb803bceb53c1944f2317c3803d88c11137ed2c",
  "private": false,
  "record": {
    "abstract": "Classical simulation is important because it sets a benchmark for quantum\ncomputer performance. Classical simulation is currently the only way to\nexercise larger numbers of qubits. To achieve larger simulations, sparse matrix\nprocessing is emphasized below while trading memory for processing. It\nperformed well within NCSA supercomputers, giving a state vector in convenient\ncontinuous portions ready for post processing.",
    "arxiv_id": "quant-ph/0308158",
    "authors": [
      "John Robert Burger"
    ],
    "categories": [
      "quant-ph",
      "cs.CE"
    ],
    "title": "New Approachs to Quantum Computer Simulaton in a Classical Supercomputer",
    "url": "https://arxiv.org/abs/quant-ph/0308158"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4e6613cb-eb9d-4d12-92d9-4a3f6c3a3b70",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}