{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NJ7WMSCATEHDW2CV3M7YVR34RI","short_pith_number":"pith:NJ7WMSCA","schema_version":"1.0","canonical_sha256":"6a7f664840990e3b6855db3f8ac77c8a2fcb3f25849fc68fa4ab225a8498a92e","source":{"kind":"arxiv","id":"2408.12752","version":3},"attestation_state":"computed","paper":{"title":"Transversal Clifford and T-gate codes of short length and high distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NT"],"primary_cat":"quant-ph","authors_text":"Shubham P. Jain, Victor V. Albert","submitted_at":"2024-08-22T22:45:47Z","abstract_excerpt":"The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to $31$. First, we construct the smallest known doubly even codes, a"},"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":"2408.12752","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-22T22:45:47Z","cross_cats_sorted":["cs.IT","math.IT","math.NT"],"title_canon_sha256":"4aaa5897d92c5e1a96390ebd3c09b57512a6c8bdd1800ab343ec3e499c7cee67","abstract_canon_sha256":"f9f18dad9eb7769a671ff30ea852c417ca62567d8e1b8d295d76ab65fb3381f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:39.007117Z","signature_b64":"7fzeHvmtqAH5zz19x2g7qcZeo9j43wAnW0us9mkqos+akiVpUTSliMvj4HopmEowUUzbZmTRZTBwLNe/uCQWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a7f664840990e3b6855db3f8ac77c8a2fcb3f25849fc68fa4ab225a8498a92e","last_reissued_at":"2026-07-05T11:15:39.006624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:39.006624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversal Clifford and T-gate codes of short length and high distance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NT"],"primary_cat":"quant-ph","authors_text":"Shubham P. Jain, Victor V. Albert","submitted_at":"2024-08-22T22:45:47Z","abstract_excerpt":"The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to $31$. First, we construct the smallest known doubly even codes, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12752","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/2408.12752/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":"2408.12752","created_at":"2026-07-05T11:15:39.006682+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12752v3","created_at":"2026-07-05T11:15:39.006682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12752","created_at":"2026-07-05T11:15:39.006682+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJ7WMSCATEHD","created_at":"2026-07-05T11:15:39.006682+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJ7WMSCATEHDW2CV","created_at":"2026-07-05T11:15:39.006682+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJ7WMSCA","created_at":"2026-07-05T11:15:39.006682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12590","citing_title":"A solvable model of 3d quantum gravity","ref_index":77,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI","json":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI.json","graph_json":"https://pith.science/api/pith-number/NJ7WMSCATEHDW2CV3M7YVR34RI/graph.json","events_json":"https://pith.science/api/pith-number/NJ7WMSCATEHDW2CV3M7YVR34RI/events.json","paper":"https://pith.science/paper/NJ7WMSCA"},"agent_actions":{"view_html":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI","download_json":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI.json","view_paper":"https://pith.science/paper/NJ7WMSCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12752&json=true","fetch_graph":"https://pith.science/api/pith-number/NJ7WMSCATEHDW2CV3M7YVR34RI/graph.json","fetch_events":"https://pith.science/api/pith-number/NJ7WMSCATEHDW2CV3M7YVR34RI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI/action/storage_attestation","attest_author":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI/action/author_attestation","sign_citation":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI/action/citation_signature","submit_replication":"https://pith.science/pith/NJ7WMSCATEHDW2CV3M7YVR34RI/action/replication_record"}},"created_at":"2026-07-05T11:15:39.006682+00:00","updated_at":"2026-07-05T11:15:39.006682+00:00"}