{
  "annotation_id": "604240c8-4d9f-4a85-9637-6d2327136a81",
  "date_created": "2026-03-02T18:02:23.899000Z",
  "date_modified": "2026-03-02T18:02:23.899000Z",
  "file_hash": "4dcfb3b2e13936748fa715088ee11d9ac2b90f42bbcd4786fe3951a2fe32c4c3",
  "private": false,
  "record": {
    "abstract": "We consider topological quantum computation (TQC) with a particular class of\nanyons that are believed to exist in the Fractional Quantum Hall Effect state\nat Landau level filling fraction nu=5/2. Since the braid group representation\ndescribing statistics of these anyons is not computationally universal, one\ncannot directly apply the standard TQC technique. We propose to use very noisy\nnon-topological operations such as direct short-range interaction between\nanyons to simulate a universal set of gates. Assuming that all TQC operations\nare implemented perfectly, we prove that the threshold error rate for\nnon-topological operations is above 14%. The total number of non-topological\ncomputational elements that one needs to simulate a quantum circuit with $L$\ngates scales as $L(\\log L)^3$.",
    "arxiv_id": "quant-ph/0511178",
    "authors": [
      "Sergey Bravyi"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.73.042313",
    "journal_ref": "Phys. Rev. A 73, 042313 (2006)",
    "title": "Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall   State",
    "url": "https://arxiv.org/abs/quant-ph/0511178"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5a41d537-67d3-45f4-bd08-09454a9c5988",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}