{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZRSTNDS5YTWK2APABKWHNLNN5Y","short_pith_number":"pith:ZRSTNDS5","schema_version":"1.0","canonical_sha256":"cc65368e5dc4ecad01e00aac76adadee0538aa14709555125a23cc0cf0cd2206","source":{"kind":"arxiv","id":"1403.2734","version":1},"attestation_state":"computed","paper":{"title":"Fault-tolerant conversion between the Steane and Reed-Muller quantum codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Poulin, Guillaume Duclos-Cianci, Jonas T. Anderson","submitted_at":"2014-03-11T20:07:01Z","abstract_excerpt":"Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The 15-qubit Reed-Muller code also does not admit a universal fault-tolerant gate set but possesses fault-tolerant T and control-control-Z gates. Combined with the Clifford group, either of these two gates generate a universal set. Here, we combine these two features by demonstrating how to fault-tolerantly convert between these two codes, providing a new method to realize universal fault-tolerant quantum computation. On"},"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":"1403.2734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-03-11T20:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"250460235c6f0850e8e48e8e1018ca913cdd174cbc2d0ed9a85e4408da65a829","abstract_canon_sha256":"7c8b3ba189d75c41beff1579fc3e240f6f43d1e47a31025a7796575008cbf7f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:08.993358Z","signature_b64":"3y9/eEROTXczlAFDHIYzU50R0qVKurJ4g/hkrjiM7cFdiYzSFBkAQ1veNlNasZ7UmI4KjUCATa1QpU+aFvt0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc65368e5dc4ecad01e00aac76adadee0538aa14709555125a23cc0cf0cd2206","last_reissued_at":"2026-05-18T02:44:08.992910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:08.992910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant conversion between the Steane and Reed-Muller quantum codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Poulin, Guillaume Duclos-Cianci, Jonas T. Anderson","submitted_at":"2014-03-11T20:07:01Z","abstract_excerpt":"Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The 15-qubit Reed-Muller code also does not admit a universal fault-tolerant gate set but possesses fault-tolerant T and control-control-Z gates. Combined with the Clifford group, either of these two gates generate a universal set. Here, we combine these two features by demonstrating how to fault-tolerantly convert between these two codes, providing a new method to realize universal fault-tolerant quantum computation. On"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2734","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":""},"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":"1403.2734","created_at":"2026-05-18T02:44:08.992985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2734v1","created_at":"2026-05-18T02:44:08.992985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2734","created_at":"2026-05-18T02:44:08.992985+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRSTNDS5YTWK","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRSTNDS5YTWK2APA","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRSTNDS5","created_at":"2026-05-18T12:28:59.999130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.14499","citing_title":"Homological origin of transversal implementability of logical diagonal gates in quantum CSS codes","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y","json":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y.json","graph_json":"https://pith.science/api/pith-number/ZRSTNDS5YTWK2APABKWHNLNN5Y/graph.json","events_json":"https://pith.science/api/pith-number/ZRSTNDS5YTWK2APABKWHNLNN5Y/events.json","paper":"https://pith.science/paper/ZRSTNDS5"},"agent_actions":{"view_html":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y","download_json":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y.json","view_paper":"https://pith.science/paper/ZRSTNDS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2734&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRSTNDS5YTWK2APABKWHNLNN5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRSTNDS5YTWK2APABKWHNLNN5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y/action/storage_attestation","attest_author":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y/action/author_attestation","sign_citation":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y/action/citation_signature","submit_replication":"https://pith.science/pith/ZRSTNDS5YTWK2APABKWHNLNN5Y/action/replication_record"}},"created_at":"2026-05-18T02:44:08.992985+00:00","updated_at":"2026-05-18T02:44:08.992985+00:00"}