{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7ZG5EHOLNUCPHASLZS3J2O52AX","short_pith_number":"pith:7ZG5EHOL","schema_version":"1.0","canonical_sha256":"fe4dd21dcb6d04f3824bccb69d3bba05f3e13c45a41686367e410f2d5b02f279","source":{"kind":"arxiv","id":"2305.08307","version":1},"attestation_state":"computed","paper":{"title":"Fusion Blossom: Fast MWPM Decoders for QEC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Lin Zhong, Yue Wu","submitted_at":"2023-05-15T02:31:06Z","abstract_excerpt":"The Minimum-Weight Perfect Matching (MWPM) decoder is widely used in Quantum Error Correction (QEC) decoding. Despite its high accuracy, existing implementations of the MWPM decoder cannot catch up with quantum hardware, e.g., 1 million measurements per second for superconducting qubits. They suffer from a backlog of measurements that grows exponentially and as a result, cannot realize the power of quantum computation. We design and implement a fast MWPM decoder, called Parity Blossom, which reaches a time complexity almost proportional to the number of defect measurements. We further design a"},"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":"2305.08307","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-05-15T02:31:06Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"7af1ee7a8e5b2dac47675cc8097de5cd41fb36b64169f7aa41c6268bc2c36433","abstract_canon_sha256":"bafd6768970241987ba31f48d5bfff1b0cb7393b2f75490ce493beaf5a1e6547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:59.856676Z","signature_b64":"1rvSK5V7LQodsWPuWHbFBNCOd5iAWsAVAGKQdCFHYKyXPDtDTWHr/eWR6biY6lJfmSUiR5twDf9GqznaR5MvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4dd21dcb6d04f3824bccb69d3bba05f3e13c45a41686367e410f2d5b02f279","last_reissued_at":"2026-07-05T06:09:59.856201Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:59.856201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fusion Blossom: Fast MWPM Decoders for QEC","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Lin Zhong, Yue Wu","submitted_at":"2023-05-15T02:31:06Z","abstract_excerpt":"The Minimum-Weight Perfect Matching (MWPM) decoder is widely used in Quantum Error Correction (QEC) decoding. Despite its high accuracy, existing implementations of the MWPM decoder cannot catch up with quantum hardware, e.g., 1 million measurements per second for superconducting qubits. They suffer from a backlog of measurements that grows exponentially and as a result, cannot realize the power of quantum computation. We design and implement a fast MWPM decoder, called Parity Blossom, which reaches a time complexity almost proportional to the number of defect measurements. We further design a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.08307","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/2305.08307/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":"2305.08307","created_at":"2026-07-05T06:09:59.856261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.08307v1","created_at":"2026-07-05T06:09:59.856261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.08307","created_at":"2026-07-05T06:09:59.856261+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZG5EHOLNUCP","created_at":"2026-07-05T06:09:59.856261+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZG5EHOLNUCPHASL","created_at":"2026-07-05T06:09:59.856261+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZG5EHOL","created_at":"2026-07-05T06:09:59.856261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"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":67,"is_internal_anchor":true},{"citing_arxiv_id":"2606.19593","citing_title":"Stalls and Spequlation: Pipelined Execution for Fault Tolerant Quantum Computation","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11076","citing_title":"Coset Ensemble Decoder for Quantum Error Correction with Algorithm-Hardware Co-Design","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX","json":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX.json","graph_json":"https://pith.science/api/pith-number/7ZG5EHOLNUCPHASLZS3J2O52AX/graph.json","events_json":"https://pith.science/api/pith-number/7ZG5EHOLNUCPHASLZS3J2O52AX/events.json","paper":"https://pith.science/paper/7ZG5EHOL"},"agent_actions":{"view_html":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX","download_json":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX.json","view_paper":"https://pith.science/paper/7ZG5EHOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.08307&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZG5EHOLNUCPHASLZS3J2O52AX/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZG5EHOLNUCPHASLZS3J2O52AX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX/action/storage_attestation","attest_author":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX/action/author_attestation","sign_citation":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX/action/citation_signature","submit_replication":"https://pith.science/pith/7ZG5EHOLNUCPHASLZS3J2O52AX/action/replication_record"}},"created_at":"2026-07-05T06:09:59.856261+00:00","updated_at":"2026-07-05T06:09:59.856261+00:00"}