{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HRE62DXCTCAWMEITCBEDSRKARN","short_pith_number":"pith:HRE62DXC","schema_version":"1.0","canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","source":{"kind":"arxiv","id":"1405.4883","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Vargo, Martin Suchara, Sergey Bravyi","submitted_at":"2014-05-19T20:33:08Z","abstract_excerpt":"We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time $O(n^2)$, where $n$ is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our i"},"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":"1405.4883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-19T20:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"1cf1c9df1823bb239d2bc18e6ea662765e9d37b814b372475ad20890ad1aaed1","abstract_canon_sha256":"2e576884bd0d8de39423cc96c9e17b25efe05ef7dcc4fe27224eb50493d2a13d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:24.598838Z","signature_b64":"lF+bq7aJNQmAKO/IMWKSI6eJPWrI3x38EOGazS0ijImUDfVXVyn48DOG8EyASREMhnM5FCAbFjttAYPfi6qjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c49ed0ee2988166111310483945408b7a051ecbab239eab6eee64d2e8fc250f","last_reissued_at":"2026-05-18T02:41:24.598372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:24.598372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Vargo, Martin Suchara, Sergey Bravyi","submitted_at":"2014-05-19T20:33:08Z","abstract_excerpt":"We describe two implementations of the optimal error correction algorithm known as the maximum likelihood decoder (MLD) for the 2D surface code with a noiseless syndrome extraction. First, we show how to implement MLD exactly in time $O(n^2)$, where $n$ is the number of code qubits. Our implementation uses a reduction from MLD to simulation of matchgate quantum circuits. This reduction however requires a special noise model with independent bit-flip and phase-flip errors. Secondly, we show how to implement MLD approximately for more general noise models using matrix product states (MPS). Our i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4883","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":""},"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":"1405.4883","created_at":"2026-05-18T02:41:24.598448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.4883v1","created_at":"2026-05-18T02:41:24.598448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4883","created_at":"2026-05-18T02:41:24.598448+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRE62DXCTCAW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRE62DXCTCAWMEIT","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRE62DXC","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN","json":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN.json","graph_json":"https://pith.science/api/pith-number/HRE62DXCTCAWMEITCBEDSRKARN/graph.json","events_json":"https://pith.science/api/pith-number/HRE62DXCTCAWMEITCBEDSRKARN/events.json","paper":"https://pith.science/paper/HRE62DXC"},"agent_actions":{"view_html":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN","download_json":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN.json","view_paper":"https://pith.science/paper/HRE62DXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.4883&json=true","fetch_graph":"https://pith.science/api/pith-number/HRE62DXCTCAWMEITCBEDSRKARN/graph.json","fetch_events":"https://pith.science/api/pith-number/HRE62DXCTCAWMEITCBEDSRKARN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/action/storage_attestation","attest_author":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/action/author_attestation","sign_citation":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/action/citation_signature","submit_replication":"https://pith.science/pith/HRE62DXCTCAWMEITCBEDSRKARN/action/replication_record"}},"created_at":"2026-05-18T02:41:24.598448+00:00","updated_at":"2026-05-18T02:41:24.598448+00:00"}