{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LKBXQKYEEHPA6I7PHLP7CZHZXA","short_pith_number":"pith:LKBXQKYE","schema_version":"1.0","canonical_sha256":"5a83782b0421de0f23ef3adff164f9b82a89817c1d722b6d4ff042352941f6fd","source":{"kind":"arxiv","id":"2110.10896","version":1},"attestation_state":"computed","paper":{"title":"Efficient Decoding of Surface Code Syndromes for Error Correction in Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debasmita Bhoumik, Latesh Kumar K J, Pinaki Sen, Ritajit Majumdar, Sundaraja Sitharama Iyengar, Susmita Sur-Kolay","submitted_at":"2021-10-21T04:54:44Z","abstract_excerpt":"Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been employed for this purpose. Here we propose a two-level (low and high) ML-based decoding scheme, where the first level corrects errors on physical qubits and the second one corrects any existing logical errors, for different noise models. Our results show that our proposed decoding method achieves $\\sim10 \\times$ and $\\sim2 \\times$ higher values of pseudo-threshold and threshold respectively, than for MWPM. We show t"},"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":"2110.10896","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-10-21T04:54:44Z","cross_cats_sorted":[],"title_canon_sha256":"c34468b570ef8c146870bb5354023d8edca43d8d70809029ddf46d35c30e23c5","abstract_canon_sha256":"8a0553d79c6bfc149ddaa7efa7c63901fab9c08b677c330a973be390bd192ea3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:24:33.928306Z","signature_b64":"s04TBsWQPSZ4rjKecCQNnn9zOlEeOdk/PPlqQ/jGCHn4spXJN9Z7Zg2szc/RQwJCfxqYnZLmeqkihyGOKy1QBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a83782b0421de0f23ef3adff164f9b82a89817c1d722b6d4ff042352941f6fd","last_reissued_at":"2026-07-05T03:24:33.927931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:24:33.927931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Decoding of Surface Code Syndromes for Error Correction in Quantum Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Debasmita Bhoumik, Latesh Kumar K J, Pinaki Sen, Ritajit Majumdar, Sundaraja Sitharama Iyengar, Susmita Sur-Kolay","submitted_at":"2021-10-21T04:54:44Z","abstract_excerpt":"Errors in surface code have typically been decoded by Minimum Weight Perfect Matching (MWPM) based method. Recently, neural-network-based Machine Learning (ML) techniques have been employed for this purpose. Here we propose a two-level (low and high) ML-based decoding scheme, where the first level corrects errors on physical qubits and the second one corrects any existing logical errors, for different noise models. Our results show that our proposed decoding method achieves $\\sim10 \\times$ and $\\sim2 \\times$ higher values of pseudo-threshold and threshold respectively, than for MWPM. We show t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10896","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/2110.10896/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":"2110.10896","created_at":"2026-07-05T03:24:33.927986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10896v1","created_at":"2026-07-05T03:24:33.927986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10896","created_at":"2026-07-05T03:24:33.927986+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKBXQKYEEHPA","created_at":"2026-07-05T03:24:33.927986+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKBXQKYEEHPA6I7P","created_at":"2026-07-05T03:24:33.927986+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKBXQKYE","created_at":"2026-07-05T03:24:33.927986+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA","json":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA.json","graph_json":"https://pith.science/api/pith-number/LKBXQKYEEHPA6I7PHLP7CZHZXA/graph.json","events_json":"https://pith.science/api/pith-number/LKBXQKYEEHPA6I7PHLP7CZHZXA/events.json","paper":"https://pith.science/paper/LKBXQKYE"},"agent_actions":{"view_html":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA","download_json":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA.json","view_paper":"https://pith.science/paper/LKBXQKYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10896&json=true","fetch_graph":"https://pith.science/api/pith-number/LKBXQKYEEHPA6I7PHLP7CZHZXA/graph.json","fetch_events":"https://pith.science/api/pith-number/LKBXQKYEEHPA6I7PHLP7CZHZXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA/action/storage_attestation","attest_author":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA/action/author_attestation","sign_citation":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA/action/citation_signature","submit_replication":"https://pith.science/pith/LKBXQKYEEHPA6I7PHLP7CZHZXA/action/replication_record"}},"created_at":"2026-07-05T03:24:33.927986+00:00","updated_at":"2026-07-05T03:24:33.927986+00:00"}