{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XHXUVCXL22ETTU54XXTV7DSD53","short_pith_number":"pith:XHXUVCXL","schema_version":"1.0","canonical_sha256":"b9ef4a8aebd68939d3bcbde75f8e43eef0e97463ed76b881defc369f3dd883f4","source":{"kind":"arxiv","id":"1206.1609","version":1},"attestation_state":"computed","paper":{"title":"Classification of topologically protected gates for local stabilizer codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Robert Koenig, Sergey Bravyi","submitted_at":"2012-06-07T20:38:35Z","abstract_excerpt":"Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be implemented by a constant-depth quantum circuit. Such gates have a certain degree of protection since propagation of errors in a constant-depth circuit is limited by a constant size light cone. For the 2D geometry we show that constant-depth circuits can only implement a finite group of encoded gates known as the Clifford group. This implies that topological "},"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":"1206.1609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-06-07T20:38:35Z","cross_cats_sorted":[],"title_canon_sha256":"3a24ef9aea94333a51cdb47d3ada59236c2274845d414c827467e5db01c1117f","abstract_canon_sha256":"7341edfb2fc0675c00d472d5869bb77cd1ba4faad2bebb81b30e07b3917df355"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:33.649858Z","signature_b64":"clq2QoOK0q/YBzLWaJrC6hCf6gTnzU0sUfGMzkYeQlFI7Mldj3atbKdEheuGnUIqwqDCvXpdqtuj6uMzEBgYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ef4a8aebd68939d3bcbde75f8e43eef0e97463ed76b881defc369f3dd883f4","last_reissued_at":"2026-05-18T03:11:33.649036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:33.649036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classification of topologically protected gates for local stabilizer codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Robert Koenig, Sergey Bravyi","submitted_at":"2012-06-07T20:38:35Z","abstract_excerpt":"Given a quantum error correcting code, an important task is to find encoded operations that can be implemented efficiently and fault-tolerantly. In this Letter we focus on topological stabilizer codes and encoded unitary gates that can be implemented by a constant-depth quantum circuit. Such gates have a certain degree of protection since propagation of errors in a constant-depth circuit is limited by a constant size light cone. For the 2D geometry we show that constant-depth circuits can only implement a finite group of encoded gates known as the Clifford group. This implies that topological "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1609","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":""},"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":"1206.1609","created_at":"2026-05-18T03:11:33.649175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1609v1","created_at":"2026-05-18T03:11:33.649175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1609","created_at":"2026-05-18T03:11:33.649175+00:00"},{"alias_kind":"pith_short_12","alias_value":"XHXUVCXL22ET","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XHXUVCXL22ETTU54","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XHXUVCXL","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.14499","citing_title":"Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2604.05126","citing_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53","json":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53.json","graph_json":"https://pith.science/api/pith-number/XHXUVCXL22ETTU54XXTV7DSD53/graph.json","events_json":"https://pith.science/api/pith-number/XHXUVCXL22ETTU54XXTV7DSD53/events.json","paper":"https://pith.science/paper/XHXUVCXL"},"agent_actions":{"view_html":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53","download_json":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53.json","view_paper":"https://pith.science/paper/XHXUVCXL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1609&json=true","fetch_graph":"https://pith.science/api/pith-number/XHXUVCXL22ETTU54XXTV7DSD53/graph.json","fetch_events":"https://pith.science/api/pith-number/XHXUVCXL22ETTU54XXTV7DSD53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53/action/storage_attestation","attest_author":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53/action/author_attestation","sign_citation":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53/action/citation_signature","submit_replication":"https://pith.science/pith/XHXUVCXL22ETTU54XXTV7DSD53/action/replication_record"}},"created_at":"2026-05-18T03:11:33.649175+00:00","updated_at":"2026-05-18T03:11:33.649175+00:00"}