{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZNG24YP3F2TKFOXR4WUGE3LJ6X","short_pith_number":"pith:ZNG24YP3","schema_version":"1.0","canonical_sha256":"cb4dae61fb2ea6a2baf1e5a8626d69f5cc5f5dccb54864294a59a6b0a4d983d9","source":{"kind":"arxiv","id":"2303.15933","version":2},"attestation_state":"computed","paper":{"title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Oscar Higgott","submitted_at":"2023-03-28T12:42:54Z","abstract_excerpt":"In this work, we introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder, the most widely used decoder for several important families of quantum error correcting codes, including surface codes. Our algorithm, which we call sparse blossom, is a variant of the blossom algorithm which directly solves the decoding problem relevant to quantum error correction. Sparse blossom avoids the need for all-to-all Dijkstra searches, common amongst MWPM decoder implementations. For 0.1% circuit-level depolarising noise, sparse blossom processes syndrome data in both $X$ and $Z$ "},"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":"2303.15933","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-28T12:42:54Z","cross_cats_sorted":[],"title_canon_sha256":"5c45f71dbdd6adc6821ad03e11aaabffe62807a3a9b8b22c3dac6294992f48ff","abstract_canon_sha256":"2901355f0734aaac91290cd66fff05bd7c1f47ff51f3a5b0b55a0fcb0b898849"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:22.624619Z","signature_b64":"5X8cCsnfyUINx5qWKzCBr4M6lnzk+vFSWra3QcYKKU8y9eGIIr5lfP5Z/9G06eBa6UciuIOsVvzx+9WNv35BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb4dae61fb2ea6a2baf1e5a8626d69f5cc5f5dccb54864294a59a6b0a4d983d9","last_reissued_at":"2026-07-05T10:03:22.624192Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:22.624192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Blossom: correcting a million errors per core second with minimum-weight matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Oscar Higgott","submitted_at":"2023-03-28T12:42:54Z","abstract_excerpt":"In this work, we introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder, the most widely used decoder for several important families of quantum error correcting codes, including surface codes. Our algorithm, which we call sparse blossom, is a variant of the blossom algorithm which directly solves the decoding problem relevant to quantum error correction. Sparse blossom avoids the need for all-to-all Dijkstra searches, common amongst MWPM decoder implementations. For 0.1% circuit-level depolarising noise, sparse blossom processes syndrome data in both $X$ and $Z$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.15933","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/2303.15933/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":"2303.15933","created_at":"2026-07-05T10:03:22.624248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.15933v2","created_at":"2026-07-05T10:03:22.624248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.15933","created_at":"2026-07-05T10:03:22.624248+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNG24YP3F2TK","created_at":"2026-07-05T10:03:22.624248+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNG24YP3F2TKFOXR","created_at":"2026-07-05T10:03:22.624248+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNG24YP3","created_at":"2026-07-05T10:03:22.624248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":14,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.05814","citing_title":"Latency-Constrained Hardware-Aware Quantum Error Correction Co-Design with Adaptive Confidence-Gated Neural Decoding for the Rotated Surface Code","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2607.05814","citing_title":"Latency-Constrained Hardware-Aware Quantum Error Correction Co-Design with Adaptive Confidence-Gated Neural Decoding for the Rotated Surface Code","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12781","citing_title":"Quantum Network Routing based on Surface Code Error Correction","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2607.01887","citing_title":"LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09678","citing_title":"The dynamic 4.8.8 Floquet code","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2406.17995","citing_title":"Managing Classical Processing Requirements for Quantum Error Correction","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2411.04664","citing_title":"Taming Rydberg Decay with Measurement-based Quantum Computation","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2411.16228","citing_title":"Soft information decoding with superconducting qubits","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2412.01446","citing_title":"Magic State Injection on IBM Quantum Processors Above the Distillation Threshold","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2603.05320","citing_title":"Simplified circuit-level decoding using Knill error correction","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":230,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04892","citing_title":"Real-time Surface-Code Error Correction Using an FPGA-based Neural-Network Decoder","ref_index":57,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X","json":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X.json","graph_json":"https://pith.science/api/pith-number/ZNG24YP3F2TKFOXR4WUGE3LJ6X/graph.json","events_json":"https://pith.science/api/pith-number/ZNG24YP3F2TKFOXR4WUGE3LJ6X/events.json","paper":"https://pith.science/paper/ZNG24YP3"},"agent_actions":{"view_html":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X","download_json":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X.json","view_paper":"https://pith.science/paper/ZNG24YP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.15933&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNG24YP3F2TKFOXR4WUGE3LJ6X/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNG24YP3F2TKFOXR4WUGE3LJ6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X/action/storage_attestation","attest_author":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X/action/author_attestation","sign_citation":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X/action/citation_signature","submit_replication":"https://pith.science/pith/ZNG24YP3F2TKFOXR4WUGE3LJ6X/action/replication_record"}},"created_at":"2026-07-05T10:03:22.624248+00:00","updated_at":"2026-07-05T10:03:22.624248+00:00"}