{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ADENUHMNUJGUB36VNJULDQ6S3L","short_pith_number":"pith:ADENUHMN","schema_version":"1.0","canonical_sha256":"00c8da1d8da24d40efd56a68b1c3d2dafdb5ca1c60f3042b26e246a317c2bc39","source":{"kind":"arxiv","id":"2410.07327","version":3},"attestation_state":"computed","paper":{"title":"Code switching revisited: Low-overhead magic state preparation using color codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac H. Kim, Lucas Daguerre","submitted_at":"2024-10-09T18:00:02Z","abstract_excerpt":"We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal gate between the 2D and the 3D code and (ii) a judicious use of flag-based postselection. We numerically demonstrate that these modifications lead to a significant improvement in the fidelity of the magic state. For instance, subjected to a uniform circuit-level noise of $10^{-3}$ (excluding idling noise), our code switching protocol yields a magic state encod"},"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":"2410.07327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-09T18:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"59e166aa3992532d244128087372a4cb6fe0f0562bd9c80ba63a7987e3d78495","abstract_canon_sha256":"7dcb501cd4741ad3f731033a7a1a50dd269b61ae8bf183a952cf2f223018ffeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:12.399505Z","signature_b64":"9f4t7KZFat0FpNpTrDu5MZwdmFjbN+4LGfXrNO/XgDeol/BI8v8rQ+eMI/L+nPi4DWXvwF9wUt1CBOi4G7Q3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00c8da1d8da24d40efd56a68b1c3d2dafdb5ca1c60f3042b26e246a317c2bc39","last_reissued_at":"2026-07-05T10:53:12.398977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:12.398977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code switching revisited: Low-overhead magic state preparation using color codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac H. Kim, Lucas Daguerre","submitted_at":"2024-10-09T18:00:02Z","abstract_excerpt":"We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal gate between the 2D and the 3D code and (ii) a judicious use of flag-based postselection. We numerically demonstrate that these modifications lead to a significant improvement in the fidelity of the magic state. For instance, subjected to a uniform circuit-level noise of $10^{-3}$ (excluding idling noise), our code switching protocol yields a magic state encod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07327","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/2410.07327/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":"2410.07327","created_at":"2026-07-05T10:53:12.399036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07327v3","created_at":"2026-07-05T10:53:12.399036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07327","created_at":"2026-07-05T10:53:12.399036+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADENUHMNUJGU","created_at":"2026-07-05T10:53:12.399036+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADENUHMNUJGUB36V","created_at":"2026-07-05T10:53:12.399036+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADENUHMN","created_at":"2026-07-05T10:53:12.399036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16209","citing_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","ref_index":74,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L","json":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L.json","graph_json":"https://pith.science/api/pith-number/ADENUHMNUJGUB36VNJULDQ6S3L/graph.json","events_json":"https://pith.science/api/pith-number/ADENUHMNUJGUB36VNJULDQ6S3L/events.json","paper":"https://pith.science/paper/ADENUHMN"},"agent_actions":{"view_html":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L","download_json":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L.json","view_paper":"https://pith.science/paper/ADENUHMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07327&json=true","fetch_graph":"https://pith.science/api/pith-number/ADENUHMNUJGUB36VNJULDQ6S3L/graph.json","fetch_events":"https://pith.science/api/pith-number/ADENUHMNUJGUB36VNJULDQ6S3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L/action/storage_attestation","attest_author":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L/action/author_attestation","sign_citation":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L/action/citation_signature","submit_replication":"https://pith.science/pith/ADENUHMNUJGUB36VNJULDQ6S3L/action/replication_record"}},"created_at":"2026-07-05T10:53:12.399036+00:00","updated_at":"2026-07-05T10:53:12.399036+00:00"}