{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:M4ZDLLJI4VN5AM56STJNVBMBS2","short_pith_number":"pith:M4ZDLLJI","schema_version":"1.0","canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","source":{"kind":"arxiv","id":"1106.2190","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Ben W. Reichardt","submitted_at":"2011-06-11T00:52:01Z","abstract_excerpt":"In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization.\n  We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla"},"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":"1106.2190","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-06-11T00:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"67935b3aa1f64f6cc38e841c571bb62ed66164d9e71df628b29d8ad950485b0f","abstract_canon_sha256":"2bc2e05de259cf2072dcce652637c331467c3398e397fc26eaff43afcf5c67b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:17.748190Z","signature_b64":"tE3udsk9tqwMEG5NqXRr1KSSfUWD7uur3TugfjOpKuisp6EpN76MfYUUKu4lWacPlWmfmSDOqOfPiMDQuZdUBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"673235ad28e55bd033be94d2da8581969a7921134efa51350392e803746c7123","last_reissued_at":"2026-05-18T03:28:17.747708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:17.747708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Paetznick, Ben W. Reichardt","submitted_at":"2011-06-11T00:52:01Z","abstract_excerpt":"In fault-tolerant quantum computing schemes, the overhead is often dominated by the cost of preparing codewords reliably. This cost generally increases quadratically with the block size of the underlying quantum error-correcting code. In consequence, large codes that are otherwise very efficient have found limited fault-tolerance applications. Fault-tolerant preparation circuits therefore are an important target for optimization.\n  We study the Golay code, a 23-qubit quantum error-correcting code that protects the logical qubit to a distance of seven. In simulations, even using a naive ancilla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2190","kind":"arxiv","version":2},"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":"1106.2190","created_at":"2026-05-18T03:28:17.747789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2190v2","created_at":"2026-05-18T03:28:17.747789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2190","created_at":"2026-05-18T03:28:17.747789+00:00"},{"alias_kind":"pith_short_12","alias_value":"M4ZDLLJI4VN5","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"M4ZDLLJI4VN5AM56","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"M4ZDLLJI","created_at":"2026-05-18T12:26:34.985390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.19471","citing_title":"Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15266","citing_title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","ref_index":73,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06928","citing_title":"Realistic Simulation of Quantum Repeater with Encoding and Classical Error Correction","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2","json":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2.json","graph_json":"https://pith.science/api/pith-number/M4ZDLLJI4VN5AM56STJNVBMBS2/graph.json","events_json":"https://pith.science/api/pith-number/M4ZDLLJI4VN5AM56STJNVBMBS2/events.json","paper":"https://pith.science/paper/M4ZDLLJI"},"agent_actions":{"view_html":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2","download_json":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2.json","view_paper":"https://pith.science/paper/M4ZDLLJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2190&json=true","fetch_graph":"https://pith.science/api/pith-number/M4ZDLLJI4VN5AM56STJNVBMBS2/graph.json","fetch_events":"https://pith.science/api/pith-number/M4ZDLLJI4VN5AM56STJNVBMBS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/action/storage_attestation","attest_author":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/action/author_attestation","sign_citation":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/action/citation_signature","submit_replication":"https://pith.science/pith/M4ZDLLJI4VN5AM56STJNVBMBS2/action/replication_record"}},"created_at":"2026-05-18T03:28:17.747789+00:00","updated_at":"2026-05-18T03:28:17.747789+00:00"}