{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BTWJN7A4F3UZ6QEVIP3E2T3ZJJ","short_pith_number":"pith:BTWJN7A4","schema_version":"1.0","canonical_sha256":"0cec96fc1c2ee99f409543f64d4f794a51ed29d03f19cae8339263239e7dff3c","source":{"kind":"arxiv","id":"2101.02211","version":1},"attestation_state":"computed","paper":{"title":"The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Krysta M. Svore, Michael E. Beverland","submitted_at":"2021-01-06T19:00:01Z","abstract_excerpt":"Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-dimensional (2D) topological codes such as the surface and color codes which have high thresholds but lack a natural implementation of a non-Clifford gate. In this work, we directly compare two leading FT implementations of the T gate in 2D color codes under circuit noise across a wide range of parameters in regimes of practical interest. We report that implementing the T gate via code switching to a 3D color code do"},"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":"2101.02211","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-01-06T19:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"7c6ab036f59cb97cb0f6eb793d190518b9d9f901e5eaf8743a59419768148ac3","abstract_canon_sha256":"de70c716d7418af9006be2b2a5b9bea8b7faa586f7ab29ce0bd6d68077dbd0e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:13.461560Z","signature_b64":"1zc3TkNdNbOYMarZ5TzqZt6dRKRfaYuqPSyLLp81Fhosl/xQXayVRKMKZBLRROwCUPwD2L8Nyq1Z/cuN9unpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cec96fc1c2ee99f409543f64d4f794a51ed29d03f19cae8339263239e7dff3c","last_reissued_at":"2026-07-05T02:51:13.461079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:13.461079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Krysta M. Svore, Michael E. Beverland","submitted_at":"2021-01-06T19:00:01Z","abstract_excerpt":"Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-dimensional (2D) topological codes such as the surface and color codes which have high thresholds but lack a natural implementation of a non-Clifford gate. In this work, we directly compare two leading FT implementations of the T gate in 2D color codes under circuit noise across a wide range of parameters in regimes of practical interest. We report that implementing the T gate via code switching to a 3D color code do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.02211","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/2101.02211/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":"2101.02211","created_at":"2026-07-05T02:51:13.461137+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.02211v1","created_at":"2026-07-05T02:51:13.461137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.02211","created_at":"2026-07-05T02:51:13.461137+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTWJN7A4F3UZ","created_at":"2026-07-05T02:51:13.461137+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTWJN7A4F3UZ6QEV","created_at":"2026-07-05T02:51:13.461137+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTWJN7A4","created_at":"2026-07-05T02:51:13.461137+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01887","citing_title":"The Pangaea Architecture: Fault-Tolerant Heterogeneous Topological Codes via a Quantum Bus","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ","json":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ.json","graph_json":"https://pith.science/api/pith-number/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/graph.json","events_json":"https://pith.science/api/pith-number/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/events.json","paper":"https://pith.science/paper/BTWJN7A4"},"agent_actions":{"view_html":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ","download_json":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ.json","view_paper":"https://pith.science/paper/BTWJN7A4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.02211&json=true","fetch_graph":"https://pith.science/api/pith-number/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/action/storage_attestation","attest_author":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/action/author_attestation","sign_citation":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/action/citation_signature","submit_replication":"https://pith.science/pith/BTWJN7A4F3UZ6QEVIP3E2T3ZJJ/action/replication_record"}},"created_at":"2026-07-05T02:51:13.461137+00:00","updated_at":"2026-07-05T02:51:13.461137+00:00"}