{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GHUI2HHMU2EBVMSQPQIWY5N7ZW","short_pith_number":"pith:GHUI2HHM","schema_version":"1.0","canonical_sha256":"31e88d1ceca6881ab2507c116c75bfcd912cc942b78fd14185dfc7570aa055c1","source":{"kind":"arxiv","id":"2403.08706","version":1},"attestation_state":"computed","paper":{"title":"Optimal adaptation of surface-code decoders to local noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew S. Darmawan","submitted_at":"2024-03-13T17:12:33Z","abstract_excerpt":"Information obtained from noise characterization of a quantum device can be used in classical decoding algorithms to improve the performance of quantum error-correcting codes. Focusing on the surface code under local (i.e. single-qubit) noise, we present a simple method to determine the maximum extent to which adapting a surface-code decoder to a noise feature can lead to a performance improvement. Our method is based on a tensor-network decoding algorithm, which uses the syndrome information as well as a process matrix description of the noise to compute a near-optimal correction. By selectiv"},"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":"2403.08706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T17:12:33Z","cross_cats_sorted":[],"title_canon_sha256":"2966c3f17d5539b5b785a84cc3b5fe2e31cc2ad803848c0a8c682fc8cb8aece8","abstract_canon_sha256":"2f6f42fc324e1462bc24b22e986d15a47e7c6e86779276c0f179d2e796582ba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:42.631017Z","signature_b64":"ARKex83UyH3p5SLmQYRvX2h5gMIEA4XghLC5BjAz24cJ0rzQqGeGxbn1oeX7VxE+S1S0O3M550yp9xmIso0DBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31e88d1ceca6881ab2507c116c75bfcd912cc942b78fd14185dfc7570aa055c1","last_reissued_at":"2026-07-05T07:55:42.630624Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:42.630624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal adaptation of surface-code decoders to local noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew S. Darmawan","submitted_at":"2024-03-13T17:12:33Z","abstract_excerpt":"Information obtained from noise characterization of a quantum device can be used in classical decoding algorithms to improve the performance of quantum error-correcting codes. Focusing on the surface code under local (i.e. single-qubit) noise, we present a simple method to determine the maximum extent to which adapting a surface-code decoder to a noise feature can lead to a performance improvement. Our method is based on a tensor-network decoding algorithm, which uses the syndrome information as well as a process matrix description of the noise to compute a near-optimal correction. By selectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08706","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/2403.08706/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":"2403.08706","created_at":"2026-07-05T07:55:42.630680+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.08706v1","created_at":"2026-07-05T07:55:42.630680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08706","created_at":"2026-07-05T07:55:42.630680+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHUI2HHMU2EB","created_at":"2026-07-05T07:55:42.630680+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHUI2HHMU2EBVMSQ","created_at":"2026-07-05T07:55:42.630680+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHUI2HHM","created_at":"2026-07-05T07:55:42.630680+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.14670","citing_title":"Computing logical error thresholds with the Pauli Frame Sparse Representation","ref_index":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW","json":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW.json","graph_json":"https://pith.science/api/pith-number/GHUI2HHMU2EBVMSQPQIWY5N7ZW/graph.json","events_json":"https://pith.science/api/pith-number/GHUI2HHMU2EBVMSQPQIWY5N7ZW/events.json","paper":"https://pith.science/paper/GHUI2HHM"},"agent_actions":{"view_html":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW","download_json":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW.json","view_paper":"https://pith.science/paper/GHUI2HHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.08706&json=true","fetch_graph":"https://pith.science/api/pith-number/GHUI2HHMU2EBVMSQPQIWY5N7ZW/graph.json","fetch_events":"https://pith.science/api/pith-number/GHUI2HHMU2EBVMSQPQIWY5N7ZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW/action/storage_attestation","attest_author":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW/action/author_attestation","sign_citation":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW/action/citation_signature","submit_replication":"https://pith.science/pith/GHUI2HHMU2EBVMSQPQIWY5N7ZW/action/replication_record"}},"created_at":"2026-07-05T07:55:42.630680+00:00","updated_at":"2026-07-05T07:55:42.630680+00:00"}