{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EULIIEVAJ4ZD65DY7JISEUYD7J","short_pith_number":"pith:EULIIEVA","schema_version":"1.0","canonical_sha256":"25168412a04f323f7478fa51225303fa653291214b8b41cfd3770b4e00ecbaea","source":{"kind":"arxiv","id":"2307.14425","version":3},"attestation_state":"computed","paper":{"title":"Code conversion with the quantum Golay code for a universal transversal gate set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Matthew Sullivan","submitted_at":"2023-07-26T18:00:04Z","abstract_excerpt":"The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. These two codes have transversal implementations of all Clifford gates, but require some other scheme for fault-tolerant $T$ gates. Using magic states, Clifford operations, and measurements is one common scheme, but magic state distillation can have a large overhead. Code conversion is one avenue for implementing a universal gate set fault-tolerantly without the use of magic state distillation. Analogously to how the $[[7,1,3]]$ St"},"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":"2307.14425","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-07-26T18:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"58e8dc77ebdc459e1e3dbe1454bfc724555c45e8410b1f488cc6fa0d02c1e951","abstract_canon_sha256":"2a1a2da70ae38182b101baeb58c75dc4c7579765e726b934864febd6888c0668"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:09:43.643405Z","signature_b64":"SOj5u98ExA3Y7dX/Dzt3o+5GygB0s3XwcoYjpCIEzIDoaDRKtZEzSdsUcutNWIzSJnFbcS0rszZy1O88LE/VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25168412a04f323f7478fa51225303fa653291214b8b41cfd3770b4e00ecbaea","last_reissued_at":"2026-07-05T08:09:43.642957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:09:43.642957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code conversion with the quantum Golay code for a universal transversal gate set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Matthew Sullivan","submitted_at":"2023-07-26T18:00:04Z","abstract_excerpt":"The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. These two codes have transversal implementations of all Clifford gates, but require some other scheme for fault-tolerant $T$ gates. Using magic states, Clifford operations, and measurements is one common scheme, but magic state distillation can have a large overhead. Code conversion is one avenue for implementing a universal gate set fault-tolerantly without the use of magic state distillation. Analogously to how the $[[7,1,3]]$ St"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14425","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/2307.14425/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":"2307.14425","created_at":"2026-07-05T08:09:43.643009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.14425v3","created_at":"2026-07-05T08:09:43.643009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14425","created_at":"2026-07-05T08:09:43.643009+00:00"},{"alias_kind":"pith_short_12","alias_value":"EULIIEVAJ4ZD","created_at":"2026-07-05T08:09:43.643009+00:00"},{"alias_kind":"pith_short_16","alias_value":"EULIIEVAJ4ZD65DY","created_at":"2026-07-05T08:09:43.643009+00:00"},{"alias_kind":"pith_short_8","alias_value":"EULIIEVA","created_at":"2026-07-05T08:09:43.643009+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24519","citing_title":"On Constructing and Decoding Quantum Triorthogonal Codes","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J","json":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J.json","graph_json":"https://pith.science/api/pith-number/EULIIEVAJ4ZD65DY7JISEUYD7J/graph.json","events_json":"https://pith.science/api/pith-number/EULIIEVAJ4ZD65DY7JISEUYD7J/events.json","paper":"https://pith.science/paper/EULIIEVA"},"agent_actions":{"view_html":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J","download_json":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J.json","view_paper":"https://pith.science/paper/EULIIEVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.14425&json=true","fetch_graph":"https://pith.science/api/pith-number/EULIIEVAJ4ZD65DY7JISEUYD7J/graph.json","fetch_events":"https://pith.science/api/pith-number/EULIIEVAJ4ZD65DY7JISEUYD7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J/action/storage_attestation","attest_author":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J/action/author_attestation","sign_citation":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J/action/citation_signature","submit_replication":"https://pith.science/pith/EULIIEVAJ4ZD65DY7JISEUYD7J/action/replication_record"}},"created_at":"2026-07-05T08:09:43.643009+00:00","updated_at":"2026-07-05T08:09:43.643009+00:00"}