{
  "annotation_id": "8d61d56b-6c4b-4c67-9cd1-a4a40e9997d3",
  "date_created": "2026-03-02T18:02:17.034000Z",
  "date_modified": "2026-03-02T18:02:17.034000Z",
  "file_hash": "84317d27d412e78cb411d817ab4172216ced61303c854a520561b946749e5340",
  "private": false,
  "record": {
    "abstract": "According to the Gottesman-Knill theorem, a class of quantum circuits, namely\nthe so-called stabilizer circuits, can be simulated efficiently on a classical\ncomputer. We introduce a new algorithm for this task, which is based on the\ngraph-state formalism. It shows significant improvement in comparison to an\nexisting algorithm, given by Gottesman and Aaronson, in terms of speed and of\nthe number of qubits the simulator can handle. We also present an\nimplementation.",
    "arxiv_id": "quant-ph/0504117",
    "authors": [
      "Simon Anders",
      "Hans J. Briegel"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.73.022334",
    "journal_ref": "Phys. Rev. A 73, 022334 (2006)",
    "title": "Fast simulation of stabilizer circuits using a graph state   representation",
    "url": "https://arxiv.org/abs/quant-ph/0504117"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7eee1f0a-7f17-4c8f-950e-2977a5893aa9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}