{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LZAZFFGDU2QS2YTPV7A7UL2OEJ","short_pith_number":"pith:LZAZFFGD","schema_version":"1.0","canonical_sha256":"5e419294c3a6a12d626fafc1fa2f4e227c3935b934a5f8d94abe2333da39a55b","source":{"kind":"arxiv","id":"1811.11789","version":4},"attestation_state":"computed","paper":{"title":"Braiding defects in topological stabiliser codes of any dimension cannot be universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Paul Webster, Stephen D. Bartlett","submitted_at":"2018-11-28T19:18:10Z","abstract_excerpt":"Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for universal fault-tolerant quantum computing in any spatial dimension. In particular, we show that, for the natural encoding of quantum information in defects in topological stabiliser codes, the set of logical operators implementable by braiding defects is contained in the Clifford group. Indeed, we show that this remains true even when supplemented with locality-p"},"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":"1811.11789","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-28T19:18:10Z","cross_cats_sorted":[],"title_canon_sha256":"091912d9c4e359b82ee340289324bf6d32eca94c99c8e0aa42a15221c8ae050a","abstract_canon_sha256":"400fe06dfacf951bb861b3c88040c81b6209bb8821ca6f888deb67756226254e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:51.145889Z","signature_b64":"5XNclvUjUL+tyZ0T2Kg/j4UE7f4tpuqdgq5HMWD+xpN2Dt4xRLv5B9K1fuf2hDiE/07SrG79diJg6b+c9tCxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e419294c3a6a12d626fafc1fa2f4e227c3935b934a5f8d94abe2333da39a55b","last_reissued_at":"2026-07-05T01:25:51.145487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:51.145487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Braiding defects in topological stabiliser codes of any dimension cannot be universal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Paul Webster, Stephen D. Bartlett","submitted_at":"2018-11-28T19:18:10Z","abstract_excerpt":"Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. We present a no-go theorem that places very strong limitations on the potential of such schemes for universal fault-tolerant quantum computing in any spatial dimension. In particular, we show that, for the natural encoding of quantum information in defects in topological stabiliser codes, the set of logical operators implementable by braiding defects is contained in the Clifford group. Indeed, we show that this remains true even when supplemented with locality-p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11789","kind":"arxiv","version":4},"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/1811.11789/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":"1811.11789","created_at":"2026-07-05T01:25:51.145545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11789v4","created_at":"2026-07-05T01:25:51.145545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11789","created_at":"2026-07-05T01:25:51.145545+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZAZFFGDU2QS","created_at":"2026-07-05T01:25:51.145545+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZAZFFGDU2QS2YTP","created_at":"2026-07-05T01:25:51.145545+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZAZFFGD","created_at":"2026-07-05T01:25:51.145545+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.07353","citing_title":"A Hierarchy of Anyon Models Realised by Twists in Stacked Surface Codes","ref_index":2018,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ","json":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ.json","graph_json":"https://pith.science/api/pith-number/LZAZFFGDU2QS2YTPV7A7UL2OEJ/graph.json","events_json":"https://pith.science/api/pith-number/LZAZFFGDU2QS2YTPV7A7UL2OEJ/events.json","paper":"https://pith.science/paper/LZAZFFGD"},"agent_actions":{"view_html":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ","download_json":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ.json","view_paper":"https://pith.science/paper/LZAZFFGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11789&json=true","fetch_graph":"https://pith.science/api/pith-number/LZAZFFGDU2QS2YTPV7A7UL2OEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LZAZFFGDU2QS2YTPV7A7UL2OEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ/action/storage_attestation","attest_author":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ/action/author_attestation","sign_citation":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ/action/citation_signature","submit_replication":"https://pith.science/pith/LZAZFFGDU2QS2YTPV7A7UL2OEJ/action/replication_record"}},"created_at":"2026-07-05T01:25:51.145545+00:00","updated_at":"2026-07-05T01:25:51.145545+00:00"}