{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TANPPEAMKQY4UX74KF2DE3XG3Y","short_pith_number":"pith:TANPPEAM","schema_version":"1.0","canonical_sha256":"981af7900c5431ca5ffc5174326ee6de2a6cefec30e6731fad262a4bea89ce5a","source":{"kind":"arxiv","id":"2409.18175","version":3},"attestation_state":"computed","paper":{"title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhishek Rajput, Dan E Browne, Hasan Sayginel, Mark Webster, Stergios Koutsioumpas","submitted_at":"2024-09-26T18:00:00Z","abstract_excerpt":"We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted. We provide a rigorous formulation of the method for finding automorphisms of stabilizer codes and generalize ZX-dualities to non-CSS codes. We provide a Python package implementing our algorithms which uses the computational algebra system MAGMA. Our algorithms map automorphism group generato"},"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.18175","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-09-26T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"de26d92f442cfba83f53d77f7e0b616a963ab68fec3b43197fda5bda539e038b","abstract_canon_sha256":"e6e0b1838d58dda1aec9b6bc33ec96e8393b85fdd92da158a7c8f8ad97b7bf78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:00:39.212769Z","signature_b64":"U12MbNZ7g8y8JcZK52H+249SpxAF9LP+F2LSuBsKvlfJ1tj4pRtASNYPkkizRt83P7RmqrJjS+A+sJb+4RuwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"981af7900c5431ca5ffc5174326ee6de2a6cefec30e6731fad262a4bea89ce5a","last_reissued_at":"2026-07-05T11:00:39.212270Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:00:39.212270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhishek Rajput, Dan E Browne, Hasan Sayginel, Mark Webster, Stergios Koutsioumpas","submitted_at":"2024-09-26T18:00:00Z","abstract_excerpt":"We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted. We provide a rigorous formulation of the method for finding automorphisms of stabilizer codes and generalize ZX-dualities to non-CSS codes. We provide a Python package implementing our algorithms which uses the computational algebra system MAGMA. Our algorithms map automorphism group generato"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.18175","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/2409.18175/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.18175","created_at":"2026-07-05T11:00:39.212336+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.18175v3","created_at":"2026-07-05T11:00:39.212336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.18175","created_at":"2026-07-05T11:00:39.212336+00:00"},{"alias_kind":"pith_short_12","alias_value":"TANPPEAMKQY4","created_at":"2026-07-05T11:00:39.212336+00:00"},{"alias_kind":"pith_short_16","alias_value":"TANPPEAMKQY4UX74","created_at":"2026-07-05T11:00:39.212336+00:00"},{"alias_kind":"pith_short_8","alias_value":"TANPPEAM","created_at":"2026-07-05T11:00:39.212336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.11942","citing_title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","ref_index":123,"is_internal_anchor":false},{"citing_arxiv_id":"2503.05003","citing_title":"Parallel Logical Measurements via Quantum Code Surgery","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2511.04430","citing_title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24739","citing_title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y","json":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y.json","graph_json":"https://pith.science/api/pith-number/TANPPEAMKQY4UX74KF2DE3XG3Y/graph.json","events_json":"https://pith.science/api/pith-number/TANPPEAMKQY4UX74KF2DE3XG3Y/events.json","paper":"https://pith.science/paper/TANPPEAM"},"agent_actions":{"view_html":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y","download_json":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y.json","view_paper":"https://pith.science/paper/TANPPEAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.18175&json=true","fetch_graph":"https://pith.science/api/pith-number/TANPPEAMKQY4UX74KF2DE3XG3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/TANPPEAMKQY4UX74KF2DE3XG3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y/action/storage_attestation","attest_author":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y/action/author_attestation","sign_citation":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y/action/citation_signature","submit_replication":"https://pith.science/pith/TANPPEAMKQY4UX74KF2DE3XG3Y/action/replication_record"}},"created_at":"2026-07-05T11:00:39.212336+00:00","updated_at":"2026-07-05T11:00:39.212336+00:00"}