{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DLIA6VPYYKI4JLSCRG7P4MRB4D","short_pith_number":"pith:DLIA6VPY","schema_version":"1.0","canonical_sha256":"1ad00f55f8c291c4ae4289befe3221e0de0e4404e35e3c57acda44614c3ce8d1","source":{"kind":"arxiv","id":"2410.23263","version":1},"attestation_state":"computed","paper":{"title":"Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anqi Gong, Joseph M. Renes","submitted_at":"2024-10-30T17:47:35Z","abstract_excerpt":"We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the $[[127,1,15]]$ self-dual doubly-even code that has transversal Clifford gates (CNOT, H, S) and the triply-even $[[127,1,7]]$ code that has transversal T and CNOT gates. We show that code switching between these codes can be accomplished using Steane error correction. For fault-tolerant ancilla preparation we utilize the low-depth hypercube encoding circuit along with different code automorphism permutations in different ancilla blocks, "},"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":"2410.23263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-30T17:47:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"41b29cb177940ff4b0a02e7b1d6e9b49a0a91d23ff4845ea75fcad08ef85576a","abstract_canon_sha256":"3720f6d403a56eab857820d9bf640a3944c70acf31d30f29e3bf6de24f4f14ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:28:57.811014Z","signature_b64":"HsfX6+Y3wGEtJ4ks7SHa1jX81mVaqUDqp9A0RQPDBNN5mIDYeDwTdg0tMmCEQN9nOysiQlDs6CFKcvSMXApoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ad00f55f8c291c4ae4289befe3221e0de0e4404e35e3c57acda44614c3ce8d1","last_reissued_at":"2026-07-05T09:28:57.810501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:28:57.810501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Anqi Gong, Joseph M. Renes","submitted_at":"2024-10-30T17:47:35Z","abstract_excerpt":"We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the $[[127,1,15]]$ self-dual doubly-even code that has transversal Clifford gates (CNOT, H, S) and the triply-even $[[127,1,7]]$ code that has transversal T and CNOT gates. We show that code switching between these codes can be accomplished using Steane error correction. For fault-tolerant ancilla preparation we utilize the low-depth hypercube encoding circuit along with different code automorphism permutations in different ancilla blocks, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.23263","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/2410.23263/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":"2410.23263","created_at":"2026-07-05T09:28:57.810569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.23263v1","created_at":"2026-07-05T09:28:57.810569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.23263","created_at":"2026-07-05T09:28:57.810569+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLIA6VPYYKI4","created_at":"2026-07-05T09:28:57.810569+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLIA6VPYYKI4JLSC","created_at":"2026-07-05T09:28:57.810569+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLIA6VPY","created_at":"2026-07-05T09:28:57.810569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21468","citing_title":"Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28518","citing_title":"Borrowed Identities: Malleable Distillation Factories and a Unified Numerical Search","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19471","citing_title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":59,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15436","citing_title":"Parity-unfolded distillation architecture for noise-biased platforms","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21472","citing_title":"LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D","json":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D.json","graph_json":"https://pith.science/api/pith-number/DLIA6VPYYKI4JLSCRG7P4MRB4D/graph.json","events_json":"https://pith.science/api/pith-number/DLIA6VPYYKI4JLSCRG7P4MRB4D/events.json","paper":"https://pith.science/paper/DLIA6VPY"},"agent_actions":{"view_html":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D","download_json":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D.json","view_paper":"https://pith.science/paper/DLIA6VPY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.23263&json=true","fetch_graph":"https://pith.science/api/pith-number/DLIA6VPYYKI4JLSCRG7P4MRB4D/graph.json","fetch_events":"https://pith.science/api/pith-number/DLIA6VPYYKI4JLSCRG7P4MRB4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D/action/storage_attestation","attest_author":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D/action/author_attestation","sign_citation":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D/action/citation_signature","submit_replication":"https://pith.science/pith/DLIA6VPYYKI4JLSCRG7P4MRB4D/action/replication_record"}},"created_at":"2026-07-05T09:28:57.810569+00:00","updated_at":"2026-07-05T09:28:57.810569+00:00"}