{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ","short_pith_number":"pith:ZRZB6NXI","schema_version":"1.0","canonical_sha256":"cc721f36e896b39e359d18bb732452466f2720b2f3770645fb70297639805d0b","source":{"kind":"arxiv","id":"2308.07915","version":2},"attestation_state":"computed","paper":{"title":"High-threshold and low-overhead fault-tolerant quantum memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Dmitri Maslov, Jay M. Gambetta, Patrick Rall, Sergey Bravyi, Theodore J. Yoder","submitted_at":"2023-08-15T17:55:12Z","abstract_excerpt":"Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement circuit, and decoding algorithm. Here we present an end-to-end quantum error correction protocol that implements fault-tolerant memory based on a family of LDPC codes with a high encoding rate that achieves an error threshold of $0.8\\%$ for the standard circuit-based noise model. This is on par with the surface code which has remained an uncontested leader in terms of its high error threshold for nearly 20 years. The"},"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":"2308.07915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-15T17:55:12Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"575f2d791ffb0b26f40c39e3b6defd24403e3c69aba8f9cfbe12b88fb0f5f1ab","abstract_canon_sha256":"63ce60ef392406ff3aaea17c3d245e8ada1b541065fb7d4e5d30753e9403f063"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:07.447246Z","signature_b64":"5VDcIlzesKt5jlB9PsBmk2EEr9leW4gh0L8qa0ivqPkVg0gG7nNRZbRNP3P20dBx3GZf0s5/XQj38S/oS0KFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc721f36e896b39e359d18bb732452466f2720b2f3770645fb70297639805d0b","last_reissued_at":"2026-07-05T08:16:07.446740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:07.446740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-threshold and low-overhead fault-tolerant quantum memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Andrew W. Cross, Dmitri Maslov, Jay M. Gambetta, Patrick Rall, Sergey Bravyi, Theodore J. Yoder","submitted_at":"2023-08-15T17:55:12Z","abstract_excerpt":"Quantum error correction becomes a practical possibility only if the physical error rate is below a threshold value that depends on a particular quantum code, syndrome measurement circuit, and decoding algorithm. Here we present an end-to-end quantum error correction protocol that implements fault-tolerant memory based on a family of LDPC codes with a high encoding rate that achieves an error threshold of $0.8\\%$ for the standard circuit-based noise model. This is on par with the surface code which has remained an uncontested leader in terms of its high error threshold for nearly 20 years. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07915","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.07915/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":"2308.07915","created_at":"2026-07-05T08:16:07.446798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07915v2","created_at":"2026-07-05T08:16:07.446798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07915","created_at":"2026-07-05T08:16:07.446798+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRZB6NXIS2ZZ","created_at":"2026-07-05T08:16:07.446798+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRZB6NXIS2ZZ4NM5","created_at":"2026-07-05T08:16:07.446798+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRZB6NXI","created_at":"2026-07-05T08:16:07.446798+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08767","citing_title":"Plaquette: A hardware-aware design platform for fault-tolerant quantum computers","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2606.25870","citing_title":"Evolving Quantum Error-Correcting Encodings for Molecular Simulation","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12724","citing_title":"Block algebra for morphing circuits","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.08771","citing_title":"Algebra of Bivariate-Bicycle Surface Codes","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02418","citing_title":"Evolutionary Discovery of Bivariate Bicycle Codes with LLM-Guided Search","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2310.17758","citing_title":"Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2504.05611","citing_title":"Transversal Fault Tolerant Distributed Quantum Computing Operations","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2511.04430","citing_title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2603.19062","citing_title":"Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01040","citing_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25094","citing_title":"INJEQT: Improved Magic-State Injection Protocol for Fault-Tolerant Quantum Extractor Architectures","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ","json":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ.json","graph_json":"https://pith.science/api/pith-number/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/graph.json","events_json":"https://pith.science/api/pith-number/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/events.json","paper":"https://pith.science/paper/ZRZB6NXI"},"agent_actions":{"view_html":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ","download_json":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ.json","view_paper":"https://pith.science/paper/ZRZB6NXI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07915&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZRZB6NXIS2ZZ4NM5DC5XGJCSIZ/action/replication_record"}},"created_at":"2026-07-05T08:16:07.446798+00:00","updated_at":"2026-07-05T08:16:07.446798+00:00"}