{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:7MXGXKVPWCN7ELULXDDHNL5NKJ","short_pith_number":"pith:7MXGXKVP","schema_version":"1.0","canonical_sha256":"fb2e6baaafb09bf22e8bb8c676afad52566638ee385a0860d6bc66cf262e4b8b","source":{"kind":"arxiv","id":"quant-ph/0511178","version":1},"attestation_state":"computed","paper":{"title":"Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sergey Bravyi","submitted_at":"2005-11-17T21:04:29Z","abstract_excerpt":"We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation describing statistics of these anyons is not computationally universal, one cannot directly apply the standard TQC technique. We propose to use very noisy non-topological operations such as direct short-range interaction between anyons to simulate a universal set of gates. Assuming that all TQC operations are implemented perfectly, we prove that the threshold error"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/0511178","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-11-17T21:04:29Z","cross_cats_sorted":[],"title_canon_sha256":"84c9293d8cbb2759aca1a517c4dc5810afe8f398073a10872d7903faed31adbe","abstract_canon_sha256":"332daec19e726cc1d32d907317f2ee137be94ed0e2e853fbd933e8491fd15e07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T16:58:12.880895Z","signature_b64":"MuY/qafcgpRVQd/bRLm1ztPpPvWPdUEvWLOLNY3hBA4g6o6QUUbVPmod/27fTw5mKRJ5FULUiaOqpHfcaw7zCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb2e6baaafb09bf22e8bb8c676afad52566638ee385a0860d6bc66cf262e4b8b","last_reissued_at":"2026-07-04T16:58:12.880560Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T16:58:12.880560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sergey Bravyi","submitted_at":"2005-11-17T21:04:29Z","abstract_excerpt":"We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation describing statistics of these anyons is not computationally universal, one cannot directly apply the standard TQC technique. We propose to use very noisy non-topological operations such as direct short-range interaction between anyons to simulate a universal set of gates. Assuming that all TQC operations are implemented perfectly, we prove that the threshold error"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0511178","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0511178/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0511178","created_at":"2026-07-04T16:58:12.880615+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0511178v1","created_at":"2026-07-04T16:58:12.880615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0511178","created_at":"2026-07-04T16:58:12.880615+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MXGXKVPWCN7","created_at":"2026-07-04T16:58:12.880615+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MXGXKVPWCN7ELUL","created_at":"2026-07-04T16:58:12.880615+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MXGXKVP","created_at":"2026-07-04T16:58:12.880615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":224,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ","json":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ.json","graph_json":"https://pith.science/api/pith-number/7MXGXKVPWCN7ELULXDDHNL5NKJ/graph.json","events_json":"https://pith.science/api/pith-number/7MXGXKVPWCN7ELULXDDHNL5NKJ/events.json","paper":"https://pith.science/paper/7MXGXKVP"},"agent_actions":{"view_html":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ","download_json":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ.json","view_paper":"https://pith.science/paper/7MXGXKVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0511178&json=true","fetch_graph":"https://pith.science/api/pith-number/7MXGXKVPWCN7ELULXDDHNL5NKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7MXGXKVPWCN7ELULXDDHNL5NKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ/action/storage_attestation","attest_author":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ/action/author_attestation","sign_citation":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ/action/citation_signature","submit_replication":"https://pith.science/pith/7MXGXKVPWCN7ELULXDDHNL5NKJ/action/replication_record"}},"created_at":"2026-07-04T16:58:12.880615+00:00","updated_at":"2026-07-04T16:58:12.880615+00:00"}