{
  "annotation_id": "206cbd3e-15df-4b86-91fa-2c1767a37227",
  "date_created": "2026-03-02T18:02:48.002000Z",
  "date_modified": "2026-03-02T18:02:48.002000Z",
  "file_hash": "bf44ee44db0d2d357db28a3c312363d33c2b301ccc4d9e77f5584682d423b3fc",
  "private": false,
  "record": {
    "abstract": "Simulation of quantum systems that provide intrinsically fault-tolerant\nquantum computation is shown to preserve fault tolerance. Errors committed in\nthe course of simulation are eliminated by the natural error-correcting\nfeatures of the systems simulated. Two examples are explored, toric codes and\nnon-abelian anyons. The latter is shown to provide universal robust quantum\ncomputation via simulation.",
    "arxiv_id": "quant-ph/9912040",
    "authors": [
      "Seth Lloyd",
      "Benjamin Rahn",
      "Charlene Ahn"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Robust quantum computation by simulation",
    "url": "https://arxiv.org/abs/quant-ph/9912040"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "abf64b58-ec74-44cc-ba7a-44ea2b838e42",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}