{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:X24LV36YS4LU2B546FPTPANN4K","short_pith_number":"pith:X24LV36Y","schema_version":"1.0","canonical_sha256":"beb8baefd897174d07bcf15f3781ade2bc8b642f431989d84ac17efcf168911a","source":{"kind":"arxiv","id":"2005.07016","version":2},"attestation_state":"computed","paper":{"title":"Decoding Across the Quantum LDPC Code Landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David R. White, Earl T. Campbell, Joschka Roffe, Simon Burton","submitted_at":"2020-05-14T14:33:08Z","abstract_excerpt":"We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low density parity check codes constructed from the hypergraph product. To this end, we run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes and a new class of codes that we call semi-topological codes. Our new code families share properties of both topological and random hypergraph product codes, with a construction that allows for a finely-controlled trade-off between code threshold and stabilize"},"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":"2005.07016","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-05-14T14:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"0d26f7b08aa0f0d6337eb02f59945c22b51b1f3b58532418e3d07173e12afc8c","abstract_canon_sha256":"73df7b469b901c94211f56d00322f90534815a08247d77b48f328400389bd4a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:03:29.978158Z","signature_b64":"HT1BEMu6ybkAfVsNgQ2jMcesiSOQoC0QcDuZfbWdsfNt9r+7YXqiEWUXjh3tSo4t7I9kppzxpoQGyCaBTjMuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beb8baefd897174d07bcf15f3781ade2bc8b642f431989d84ac17efcf168911a","last_reissued_at":"2026-07-05T02:03:29.977701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:03:29.977701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding Across the Quantum LDPC Code Landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David R. White, Earl T. Campbell, Joschka Roffe, Simon Burton","submitted_at":"2020-05-14T14:33:08Z","abstract_excerpt":"We show that belief propagation combined with ordered statistics post-processing is a general decoder for quantum low density parity check codes constructed from the hypergraph product. To this end, we run numerical simulations of the decoder applied to three families of hypergraph product code: topological codes, fixed-rate random codes and a new class of codes that we call semi-topological codes. Our new code families share properties of both topological and random hypergraph product codes, with a construction that allows for a finely-controlled trade-off between code threshold and stabilize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07016","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/2005.07016/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":"2005.07016","created_at":"2026-07-05T02:03:29.977768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07016v2","created_at":"2026-07-05T02:03:29.977768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07016","created_at":"2026-07-05T02:03:29.977768+00:00"},{"alias_kind":"pith_short_12","alias_value":"X24LV36YS4LU","created_at":"2026-07-05T02:03:29.977768+00:00"},{"alias_kind":"pith_short_16","alias_value":"X24LV36YS4LU2B54","created_at":"2026-07-05T02:03:29.977768+00:00"},{"alias_kind":"pith_short_8","alias_value":"X24LV36Y","created_at":"2026-07-05T02:03:29.977768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":23,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.08386","citing_title":"Parallel QEC Decoding Applied to Distributed Quantum Computing","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06062","citing_title":"Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20263","citing_title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2501.08036","citing_title":"Decoding Quantum LDPC Codes using Collaborative Check Node Removal","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2504.01164","citing_title":"Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17230","citing_title":"Maximum Likelihood Decoding of Quantum Error Correction Codes","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15348","citing_title":"Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":24,"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":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01040","citing_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11088","citing_title":"Tolerating Device Failure in Distributed Quantum Computing","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09142","citing_title":"DART-Q : A Deadline-Driven Framework for Real-Time QLDPC Decoding","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06153","citing_title":"Secure Seed-Based Multi-bit Watermarking for Diffusion Models from First Principles","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":65,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":111,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00038","citing_title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","ref_index":76,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24640","citing_title":"DiffQEC: A versatile diffusion model for quantum error correction","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04049","citing_title":"FTPrimitiveBench: A Benchmark Suite For Logical Computation Under Hardware-Motivated and Biased Noise Models","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04663","citing_title":"Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05315","citing_title":"Two Layers, No Swaps: Biplanar SPOQC Architecture Improves Runtime of Fermi-Hubbard Simulation","ref_index":88,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K","json":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K.json","graph_json":"https://pith.science/api/pith-number/X24LV36YS4LU2B546FPTPANN4K/graph.json","events_json":"https://pith.science/api/pith-number/X24LV36YS4LU2B546FPTPANN4K/events.json","paper":"https://pith.science/paper/X24LV36Y"},"agent_actions":{"view_html":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K","download_json":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K.json","view_paper":"https://pith.science/paper/X24LV36Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07016&json=true","fetch_graph":"https://pith.science/api/pith-number/X24LV36YS4LU2B546FPTPANN4K/graph.json","fetch_events":"https://pith.science/api/pith-number/X24LV36YS4LU2B546FPTPANN4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K/action/storage_attestation","attest_author":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K/action/author_attestation","sign_citation":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K/action/citation_signature","submit_replication":"https://pith.science/pith/X24LV36YS4LU2B546FPTPANN4K/action/replication_record"}},"created_at":"2026-07-05T02:03:29.977768+00:00","updated_at":"2026-07-05T02:03:29.977768+00:00"}