{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DDVWZP6HO3R5CW5UFIXDL5TQMI","short_pith_number":"pith:DDVWZP6H","schema_version":"1.0","canonical_sha256":"18eb6cbfc776e3d15bb42a2e35f6706212c428b0d14d2b365600a738119ff9b0","source":{"kind":"arxiv","id":"2607.02482","version":1},"attestation_state":"computed","paper":{"title":"Automated logical Clifford gadgets for heterogeneous architectures via chain maps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asmae Benhemou, Noah Berthusen","submitted_at":"2026-07-02T17:49:54Z","abstract_excerpt":"Transversal CNOTs are ubiquitous for entangling logical qubits of identical CSS codes pairwise. For distinct codes, the options are much more limited, and are typically known only for structurally related code families. We introduce an automated framework for synthesising inter-code logical CNOT circuits between arbitrary CSS codes using chain maps. Given a prescribed bipartite logical CNOT network between these codes, our method constructs the affine space of chain maps realising the desired logical action, and then searches this space for shallow and sparse physical circuit candidates. We be"},"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":"2607.02482","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-02T17:49:54Z","cross_cats_sorted":[],"title_canon_sha256":"1109de1b61da7bf27abf661542c6995378af034924155082ee2c2b62571465ab","abstract_canon_sha256":"0d81124743d2ebd527a84bc6127cf8b98d14aea725ced08adbcfc11efc3fe2e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:18:00.451688Z","signature_b64":"mmXDTdVRFNmhjOrv4tq5jad+IFElBHGi2K87mpRhgmRnSiL1iRWKJxYq/qtjIomhm99kcwc7IjgKTKbJEeQjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18eb6cbfc776e3d15bb42a2e35f6706212c428b0d14d2b365600a738119ff9b0","last_reissued_at":"2026-07-03T01:18:00.451263Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:18:00.451263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated logical Clifford gadgets for heterogeneous architectures via chain maps","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asmae Benhemou, Noah Berthusen","submitted_at":"2026-07-02T17:49:54Z","abstract_excerpt":"Transversal CNOTs are ubiquitous for entangling logical qubits of identical CSS codes pairwise. For distinct codes, the options are much more limited, and are typically known only for structurally related code families. We introduce an automated framework for synthesising inter-code logical CNOT circuits between arbitrary CSS codes using chain maps. Given a prescribed bipartite logical CNOT network between these codes, our method constructs the affine space of chain maps realising the desired logical action, and then searches this space for shallow and sparse physical circuit candidates. We be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.02482","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/2607.02482/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":"2607.02482","created_at":"2026-07-03T01:18:00.451335+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.02482v1","created_at":"2026-07-03T01:18:00.451335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.02482","created_at":"2026-07-03T01:18:00.451335+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDVWZP6HO3R5","created_at":"2026-07-03T01:18:00.451335+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDVWZP6HO3R5CW5U","created_at":"2026-07-03T01:18:00.451335+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDVWZP6H","created_at":"2026-07-03T01:18:00.451335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI","json":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI.json","graph_json":"https://pith.science/api/pith-number/DDVWZP6HO3R5CW5UFIXDL5TQMI/graph.json","events_json":"https://pith.science/api/pith-number/DDVWZP6HO3R5CW5UFIXDL5TQMI/events.json","paper":"https://pith.science/paper/DDVWZP6H"},"agent_actions":{"view_html":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI","download_json":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI.json","view_paper":"https://pith.science/paper/DDVWZP6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.02482&json=true","fetch_graph":"https://pith.science/api/pith-number/DDVWZP6HO3R5CW5UFIXDL5TQMI/graph.json","fetch_events":"https://pith.science/api/pith-number/DDVWZP6HO3R5CW5UFIXDL5TQMI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI/action/storage_attestation","attest_author":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI/action/author_attestation","sign_citation":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI/action/citation_signature","submit_replication":"https://pith.science/pith/DDVWZP6HO3R5CW5UFIXDL5TQMI/action/replication_record"}},"created_at":"2026-07-03T01:18:00.451335+00:00","updated_at":"2026-07-03T01:18:00.451335+00:00"}