{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JIN2NWPOUHK47NPD4LCEGDTDMF","short_pith_number":"pith:JIN2NWPO","schema_version":"1.0","canonical_sha256":"4a1ba6d9eea1d5cfb5e3e2c4430e636172720575b0f6cb45ee5536de6c106674","source":{"kind":"arxiv","id":"1906.01045","version":3},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes","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":"2019-06-03T19:42:07Z","abstract_excerpt":"Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We prove that a universal gate set for quantum computing cannot be realised by supplementing locality-preserving logical operators with defect braiding, even in more than two dimensions. However, notwithstanding this no-go theorem, we demonstrate that higher dimensional defect-braiding schemes have the potential to play an important role in realising fault-tolerant"},"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":"1906.01045","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-06-03T19:42:07Z","cross_cats_sorted":[],"title_canon_sha256":"40fcb40b87d8344becdee4c11eefb75dcf3acba2a1153c286a4b376cfbd1ecf8","abstract_canon_sha256":"520f131146da33bed7a381fc33f1238b37ba9099fc7dde9797d3041c5c543908"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:51.697617Z","signature_b64":"xT/ecOcOcmxK+Fpg1ARKOgiwBSeA1gx5wiKDx1u+Q0fAaN6T7qegiDOC1WMU0CSIl/1kMoe89j2vPjmw6xquDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a1ba6d9eea1d5cfb5e3e2c4430e636172720575b0f6cb45ee5536de6c106674","last_reissued_at":"2026-07-05T01:25:51.697080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:51.697080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Quantum Gates with Defects in Topological Stabiliser Codes","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":"2019-06-03T19:42:07Z","abstract_excerpt":"Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We prove that a universal gate set for quantum computing cannot be realised by supplementing locality-preserving logical operators with defect braiding, even in more than two dimensions. However, notwithstanding this no-go theorem, we demonstrate that higher dimensional defect-braiding schemes have the potential to play an important role in realising fault-tolerant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01045","kind":"arxiv","version":3},"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/1906.01045/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":"1906.01045","created_at":"2026-07-05T01:25:51.697142+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01045v3","created_at":"2026-07-05T01:25:51.697142+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01045","created_at":"2026-07-05T01:25:51.697142+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIN2NWPOUHK4","created_at":"2026-07-05T01:25:51.697142+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIN2NWPOUHK47NPD","created_at":"2026-07-05T01:25:51.697142+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIN2NWPO","created_at":"2026-07-05T01:25:51.697142+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":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF","json":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF.json","graph_json":"https://pith.science/api/pith-number/JIN2NWPOUHK47NPD4LCEGDTDMF/graph.json","events_json":"https://pith.science/api/pith-number/JIN2NWPOUHK47NPD4LCEGDTDMF/events.json","paper":"https://pith.science/paper/JIN2NWPO"},"agent_actions":{"view_html":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF","download_json":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF.json","view_paper":"https://pith.science/paper/JIN2NWPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01045&json=true","fetch_graph":"https://pith.science/api/pith-number/JIN2NWPOUHK47NPD4LCEGDTDMF/graph.json","fetch_events":"https://pith.science/api/pith-number/JIN2NWPOUHK47NPD4LCEGDTDMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF/action/storage_attestation","attest_author":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF/action/author_attestation","sign_citation":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF/action/citation_signature","submit_replication":"https://pith.science/pith/JIN2NWPOUHK47NPD4LCEGDTDMF/action/replication_record"}},"created_at":"2026-07-05T01:25:51.697142+00:00","updated_at":"2026-07-05T01:25:51.697142+00:00"}