{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AH37GLWRPV6RL5IDQ5FXBJ522P","short_pith_number":"pith:AH37GLWR","schema_version":"1.0","canonical_sha256":"01f7f32ed17d7d15f503874b70a7bad3d9542c0e5ec3ac3fab753814fb845224","source":{"kind":"arxiv","id":"2409.13465","version":2},"attestation_state":"computed","paper":{"title":"Efficient fault-tolerant code switching via one-way transversal CNOT gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Janine Hilder, Sascha Heu{\\ss}en","submitted_at":"2024-09-20T12:54:47Z","abstract_excerpt":"Code switching is an established technique that facilitates a universal set of FT quantum gate operations by combining two QEC codes with complementary sets of gates, which each by themselves are easy to implement fault-tolerantly. In this work, we present a code switching scheme that respects the constraints of FT circuit design by only making use of transversal gates. These gates are intrinsically FT without additional qubit overhead. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors, for instance based on trappe"},"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":"2409.13465","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-20T12:54:47Z","cross_cats_sorted":[],"title_canon_sha256":"845660112dbcbcd484f7db47541ab6e2a14c61d3eccc991546dc97b89d71696c","abstract_canon_sha256":"9278cc9e6b4dfd8468452960841dc319404453431decf9a1fea47e5171e59fcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:36.286679Z","signature_b64":"UK7LF4JQE2a817rOJjWWimb5VxxBIhyXg+gk0OYJY73J5b9t1Pt6UO20bkXYvtnD/YqTPfiSHTjtTmpn5bXqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f7f32ed17d7d15f503874b70a7bad3d9542c0e5ec3ac3fab753814fb845224","last_reissued_at":"2026-07-05T12:07:36.286176Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:36.286176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient fault-tolerant code switching via one-way transversal CNOT gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Janine Hilder, Sascha Heu{\\ss}en","submitted_at":"2024-09-20T12:54:47Z","abstract_excerpt":"Code switching is an established technique that facilitates a universal set of FT quantum gate operations by combining two QEC codes with complementary sets of gates, which each by themselves are easy to implement fault-tolerantly. In this work, we present a code switching scheme that respects the constraints of FT circuit design by only making use of transversal gates. These gates are intrinsically FT without additional qubit overhead. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors, for instance based on trappe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13465","kind":"arxiv","version":2},"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/2409.13465/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":"2409.13465","created_at":"2026-07-05T12:07:36.286229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13465v2","created_at":"2026-07-05T12:07:36.286229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13465","created_at":"2026-07-05T12:07:36.286229+00:00"},{"alias_kind":"pith_short_12","alias_value":"AH37GLWRPV6R","created_at":"2026-07-05T12:07:36.286229+00:00"},{"alias_kind":"pith_short_16","alias_value":"AH37GLWRPV6RL5ID","created_at":"2026-07-05T12:07:36.286229+00:00"},{"alias_kind":"pith_short_8","alias_value":"AH37GLWR","created_at":"2026-07-05T12:07:36.286229+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02542","citing_title":"Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2408.14828","citing_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10714","citing_title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2601.10964","citing_title":"Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":244,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P","json":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P.json","graph_json":"https://pith.science/api/pith-number/AH37GLWRPV6RL5IDQ5FXBJ522P/graph.json","events_json":"https://pith.science/api/pith-number/AH37GLWRPV6RL5IDQ5FXBJ522P/events.json","paper":"https://pith.science/paper/AH37GLWR"},"agent_actions":{"view_html":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P","download_json":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P.json","view_paper":"https://pith.science/paper/AH37GLWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13465&json=true","fetch_graph":"https://pith.science/api/pith-number/AH37GLWRPV6RL5IDQ5FXBJ522P/graph.json","fetch_events":"https://pith.science/api/pith-number/AH37GLWRPV6RL5IDQ5FXBJ522P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P/action/storage_attestation","attest_author":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P/action/author_attestation","sign_citation":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P/action/citation_signature","submit_replication":"https://pith.science/pith/AH37GLWRPV6RL5IDQ5FXBJ522P/action/replication_record"}},"created_at":"2026-07-05T12:07:36.286229+00:00","updated_at":"2026-07-05T12:07:36.286229+00:00"}