{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QEYFW7SR2BNA4QML62WE6RZOVP","short_pith_number":"pith:QEYFW7SR","schema_version":"1.0","canonical_sha256":"81305b7e51d05a0e418bf6ac4f472eabfc6c6ddae99203d5aba9a54826a2bfb7","source":{"kind":"arxiv","id":"2406.09951","version":1},"attestation_state":"computed","paper":{"title":"Genons, Double Covers and Fault-tolerant Clifford Gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elijah Durso-Sabina, Natalie C. Brown, Simon Burton","submitted_at":"2024-06-14T11:57:51Z","abstract_excerpt":"A great deal of work has been done developing quantum codes with varying overhead and connectivity constraints. However, given the such an abundance of codes, there is a surprising shortage of fault-tolerant logical gates supported therein. We define a construction, such that given an input $[[n,k,d]]$ code, yields a $[[2n,2k,\\ge d]]$ symplectic double code with naturally occurring fault-tolerant logical Clifford gates. As applied to 2-dimensional $D(\\mathbb{Z}_2)$-topological codes with genons (twists) and domain walls, we find the symplectic double is genon free, and of possibly higher genus"},"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":"2406.09951","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-06-14T11:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"9fdf7eeabc5127c9cc0271f6dba138d210512a0565acfb90370c5b3b598d6b68","abstract_canon_sha256":"87eb281173b5c7727518d804c0333ba2b1ef268cf38b8a020153021e6a4eb248"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:02.412203Z","signature_b64":"NZGe0D271Iw+BM4EKYnYa30jx1US28q5KFVIcsaQC17ATf4hf4dmtz9p7o0VKejtCJeGDSEInnxDtanOsP+8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81305b7e51d05a0e418bf6ac4f472eabfc6c6ddae99203d5aba9a54826a2bfb7","last_reissued_at":"2026-07-05T08:32:02.411717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:02.411717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genons, Double Covers and Fault-tolerant Clifford Gates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elijah Durso-Sabina, Natalie C. Brown, Simon Burton","submitted_at":"2024-06-14T11:57:51Z","abstract_excerpt":"A great deal of work has been done developing quantum codes with varying overhead and connectivity constraints. However, given the such an abundance of codes, there is a surprising shortage of fault-tolerant logical gates supported therein. We define a construction, such that given an input $[[n,k,d]]$ code, yields a $[[2n,2k,\\ge d]]$ symplectic double code with naturally occurring fault-tolerant logical Clifford gates. As applied to 2-dimensional $D(\\mathbb{Z}_2)$-topological codes with genons (twists) and domain walls, we find the symplectic double is genon free, and of possibly higher genus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.09951","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/2406.09951/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":"2406.09951","created_at":"2026-07-05T08:32:02.411772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.09951v1","created_at":"2026-07-05T08:32:02.411772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.09951","created_at":"2026-07-05T08:32:02.411772+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEYFW7SR2BNA","created_at":"2026-07-05T08:32:02.411772+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEYFW7SR2BNA4QML","created_at":"2026-07-05T08:32:02.411772+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEYFW7SR","created_at":"2026-07-05T08:32:02.411772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP","json":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP.json","graph_json":"https://pith.science/api/pith-number/QEYFW7SR2BNA4QML62WE6RZOVP/graph.json","events_json":"https://pith.science/api/pith-number/QEYFW7SR2BNA4QML62WE6RZOVP/events.json","paper":"https://pith.science/paper/QEYFW7SR"},"agent_actions":{"view_html":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP","download_json":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP.json","view_paper":"https://pith.science/paper/QEYFW7SR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.09951&json=true","fetch_graph":"https://pith.science/api/pith-number/QEYFW7SR2BNA4QML62WE6RZOVP/graph.json","fetch_events":"https://pith.science/api/pith-number/QEYFW7SR2BNA4QML62WE6RZOVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP/action/storage_attestation","attest_author":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP/action/author_attestation","sign_citation":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP/action/citation_signature","submit_replication":"https://pith.science/pith/QEYFW7SR2BNA4QML62WE6RZOVP/action/replication_record"}},"created_at":"2026-07-05T08:32:02.411772+00:00","updated_at":"2026-07-05T08:32:02.411772+00:00"}