{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3BGWLAQTZHQ2XSWF7Z5GTAAVPA","short_pith_number":"pith:3BGWLAQT","schema_version":"1.0","canonical_sha256":"d84d658213c9e1abcac5fe7a6980157825f178905658c9a80b8ba8ee2c1087df","source":{"kind":"arxiv","id":"2405.07433","version":2},"attestation_state":"computed","paper":{"title":"Efficient soft-output decoders for the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, John Preskill, Nadine Meister","submitted_at":"2024-05-13T02:22:28Z","abstract_excerpt":"Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome (\"soft-output decoders\") can reduce the overhead cost of fault-tolerant quantum memory and computation. In this work, we construct efficient soft-output decoders for the surface code derived from the Minimum-Weight Perfect Matching and Union-Find decoders. We show that soft-output decoding can improve the performance of a \"hierarchical code,\" a concatenated scheme in which the inner code is the surface code, and the outer code is a high-rate quantum low-density parity-check code. Alterna"},"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":"2405.07433","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-13T02:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"3e79cb3d76dc987e1fed9037adf42ed1e167418c176fe6c5de829a86cbfba94f","abstract_canon_sha256":"21fa532569c2a68a413aa205f6006ae1bf88ea195ddc6f050db03e0b59e62305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:26:24.666181Z","signature_b64":"3QCga3kQSiAopkE3cK03awg7uSqEmSkOQuE5jFjgikGKJez41d9eybegl8s/UrsVEmBkkfGuQ2nIBlsS95VbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d84d658213c9e1abcac5fe7a6980157825f178905658c9a80b8ba8ee2c1087df","last_reissued_at":"2026-07-05T08:26:24.665724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:26:24.665724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient soft-output decoders for the surface code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher A. Pattison, John Preskill, Nadine Meister","submitted_at":"2024-05-13T02:22:28Z","abstract_excerpt":"Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome (\"soft-output decoders\") can reduce the overhead cost of fault-tolerant quantum memory and computation. In this work, we construct efficient soft-output decoders for the surface code derived from the Minimum-Weight Perfect Matching and Union-Find decoders. We show that soft-output decoding can improve the performance of a \"hierarchical code,\" a concatenated scheme in which the inner code is the surface code, and the outer code is a high-rate quantum low-density parity-check code. Alterna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07433","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/2405.07433/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":"2405.07433","created_at":"2026-07-05T08:26:24.665781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07433v2","created_at":"2026-07-05T08:26:24.665781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07433","created_at":"2026-07-05T08:26:24.665781+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BGWLAQTZHQ2","created_at":"2026-07-05T08:26:24.665781+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BGWLAQTZHQ2XSWF","created_at":"2026-07-05T08:26:24.665781+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BGWLAQT","created_at":"2026-07-05T08:26:24.665781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08758","citing_title":"Neural network decoder confidence as a learned proxy for the logical gap","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14637","citing_title":"Adaptive Window Decoding based on Spatiotemporal Complementary Gap","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06101","citing_title":"Syndrome resampling enhances quantum error correction thresholds","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19871","citing_title":"Co-Designing Error Mitigation and Error Detection for Logical Qubits","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19319","citing_title":"An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics","ref_index":99,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA","json":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA.json","graph_json":"https://pith.science/api/pith-number/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/graph.json","events_json":"https://pith.science/api/pith-number/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/events.json","paper":"https://pith.science/paper/3BGWLAQT"},"agent_actions":{"view_html":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA","download_json":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA.json","view_paper":"https://pith.science/paper/3BGWLAQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07433&json=true","fetch_graph":"https://pith.science/api/pith-number/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/graph.json","fetch_events":"https://pith.science/api/pith-number/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/action/storage_attestation","attest_author":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/action/author_attestation","sign_citation":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/action/citation_signature","submit_replication":"https://pith.science/pith/3BGWLAQTZHQ2XSWF7Z5GTAAVPA/action/replication_record"}},"created_at":"2026-07-05T08:26:24.665781+00:00","updated_at":"2026-07-05T08:26:24.665781+00:00"}