{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:R3APCJXRHGKB35ZZ3U2OUSARTQ","short_pith_number":"pith:R3APCJXR","schema_version":"1.0","canonical_sha256":"8ec0f126f139941df739dd34ea48119c30c38ecc5b46a5669dc63a488924c99b","source":{"kind":"arxiv","id":"2503.19790","version":1},"attestation_state":"computed","paper":{"title":"Clifford gates with logical transversality for self-dual CSS codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Theerapat Tansuwannont, Yugo Takada","submitted_at":"2025-03-25T15:55:12Z","abstract_excerpt":"Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on $[\\![n,k,d]\\!]$ self-dual Calderbank-Shor-Steane (CSS) codes with $k \\geq 1$ and prove necessary and sufficient condit"},"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":"2503.19790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-25T15:55:12Z","cross_cats_sorted":[],"title_canon_sha256":"ace816303060a23c853973139aca84927087355b5677d18e443056ca1161b4e4","abstract_canon_sha256":"d37f4e19a0ab201392b29256c7baa6f38257e867b7145e978bd99421a302fe86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:01.772380Z","signature_b64":"SWWdGUEmilkyogw/FitGNC5YbzALXqlTq+ZQGDZHIf4Dd0izkXHMI4/O/Vs/OH4tU9iV+K2xg02LfkSAJjLCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ec0f126f139941df739dd34ea48119c30c38ecc5b46a5669dc63a488924c99b","last_reissued_at":"2026-07-05T10:39:01.771877Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:01.771877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clifford gates with logical transversality for self-dual CSS codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Keisuke Fujii, Theerapat Tansuwannont, Yugo Takada","submitted_at":"2025-03-25T15:55:12Z","abstract_excerpt":"Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical gate of a high-rate code can be fault-tolerantly implemented using transversal physical gates, but its logical operation may depend on the choice of a symplectic basis that defines logical Pauli operators of the code. In this work, we focus on $[\\![n,k,d]\\!]$ self-dual Calderbank-Shor-Steane (CSS) codes with $k \\geq 1$ and prove necessary and sufficient condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.19790","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/2503.19790/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":"2503.19790","created_at":"2026-07-05T10:39:01.771943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.19790v1","created_at":"2026-07-05T10:39:01.771943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.19790","created_at":"2026-07-05T10:39:01.771943+00:00"},{"alias_kind":"pith_short_12","alias_value":"R3APCJXRHGKB","created_at":"2026-07-05T10:39:01.771943+00:00"},{"alias_kind":"pith_short_16","alias_value":"R3APCJXRHGKB35ZZ","created_at":"2026-07-05T10:39:01.771943+00:00"},{"alias_kind":"pith_short_8","alias_value":"R3APCJXR","created_at":"2026-07-05T10:39:01.771943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30108","citing_title":"Asymptotic magic state distillation with almost linear rate","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2601.08568","citing_title":"Asymptotically good CSS codes that realize the logical transversal Clifford group fault-tolerantly","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2602.14499","citing_title":"Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":174,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ","json":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ.json","graph_json":"https://pith.science/api/pith-number/R3APCJXRHGKB35ZZ3U2OUSARTQ/graph.json","events_json":"https://pith.science/api/pith-number/R3APCJXRHGKB35ZZ3U2OUSARTQ/events.json","paper":"https://pith.science/paper/R3APCJXR"},"agent_actions":{"view_html":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ","download_json":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ.json","view_paper":"https://pith.science/paper/R3APCJXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.19790&json=true","fetch_graph":"https://pith.science/api/pith-number/R3APCJXRHGKB35ZZ3U2OUSARTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/R3APCJXRHGKB35ZZ3U2OUSARTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ/action/storage_attestation","attest_author":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ/action/author_attestation","sign_citation":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ/action/citation_signature","submit_replication":"https://pith.science/pith/R3APCJXRHGKB35ZZ3U2OUSARTQ/action/replication_record"}},"created_at":"2026-07-05T10:39:01.771943+00:00","updated_at":"2026-07-05T10:39:01.771943+00:00"}