{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4FH672M4RJEALL24UOPAV6AACH","short_pith_number":"pith:4FH672M4","schema_version":"1.0","canonical_sha256":"e14fefe99c8a4805af5ca39e0af80011f962ec38d2987e8560f3391e08231a2e","source":{"kind":"arxiv","id":"2210.14066","version":1},"attestation_state":"computed","paper":{"title":"The Smallest Code with Transversal T","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alastair Kay, Darren Banfield, Stergios Koutsioumpas","submitted_at":"2022-10-25T14:47:29Z","abstract_excerpt":"We prove that the smallest distance 3 Quantum Error Correcting Code with a transversal gate outside the Clifford group is the well-known 15-qubit Reed-Muller code, also known as a tri-orthogonal code. Our result relies on fewer assumptions than previous works. We further extend this result by finding the minimal code that also possesses any other non Clifford transversal single-qubit gate."},"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":"2210.14066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-25T14:47:29Z","cross_cats_sorted":[],"title_canon_sha256":"a7319c62f077c7524168f9434869c643d8e6f2d2b3bbf26b6659dcf00490c667","abstract_canon_sha256":"4d76e0d0a9c1f89f88136da8d82ce2d3d962224953c49693ab05c891fef74b9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:10:25.832302Z","signature_b64":"RiGss0pUB7asBO75M/eZQm6fJgsFU1b3DYdRXISO+q6mZ87aCiv4P2HxvSwM1Knt5Xllp0L2pZA2AmfKAmyADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14fefe99c8a4805af5ca39e0af80011f962ec38d2987e8560f3391e08231a2e","last_reissued_at":"2026-07-05T05:10:25.831839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:10:25.831839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Smallest Code with Transversal T","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alastair Kay, Darren Banfield, Stergios Koutsioumpas","submitted_at":"2022-10-25T14:47:29Z","abstract_excerpt":"We prove that the smallest distance 3 Quantum Error Correcting Code with a transversal gate outside the Clifford group is the well-known 15-qubit Reed-Muller code, also known as a tri-orthogonal code. Our result relies on fewer assumptions than previous works. We further extend this result by finding the minimal code that also possesses any other non Clifford transversal single-qubit gate."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14066","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/2210.14066/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":"2210.14066","created_at":"2026-07-05T05:10:25.831897+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.14066v1","created_at":"2026-07-05T05:10:25.831897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14066","created_at":"2026-07-05T05:10:25.831897+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FH672M4RJEA","created_at":"2026-07-05T05:10:25.831897+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FH672M4RJEALL24","created_at":"2026-07-05T05:10:25.831897+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FH672M4","created_at":"2026-07-05T05:10:25.831897+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08396","citing_title":"Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2606.07734","citing_title":"Exploring the landscape of compact magic-state distillation factories","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2605.28162","citing_title":"Learning Logical Operations for Arbitrary Quantum Error Correction Codes","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06284","citing_title":"Local distillation from Reed Muller codes unfolding","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH","json":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH.json","graph_json":"https://pith.science/api/pith-number/4FH672M4RJEALL24UOPAV6AACH/graph.json","events_json":"https://pith.science/api/pith-number/4FH672M4RJEALL24UOPAV6AACH/events.json","paper":"https://pith.science/paper/4FH672M4"},"agent_actions":{"view_html":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH","download_json":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH.json","view_paper":"https://pith.science/paper/4FH672M4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.14066&json=true","fetch_graph":"https://pith.science/api/pith-number/4FH672M4RJEALL24UOPAV6AACH/graph.json","fetch_events":"https://pith.science/api/pith-number/4FH672M4RJEALL24UOPAV6AACH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH/action/storage_attestation","attest_author":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH/action/author_attestation","sign_citation":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH/action/citation_signature","submit_replication":"https://pith.science/pith/4FH672M4RJEALL24UOPAV6AACH/action/replication_record"}},"created_at":"2026-07-05T05:10:25.831897+00:00","updated_at":"2026-07-05T05:10:25.831897+00:00"}