{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2GEVYH67AUNBUA6R53Q2UIUERD","short_pith_number":"pith:2GEVYH67","schema_version":"1.0","canonical_sha256":"d1895c1fdf051a1a03d1eee1aa228488f6766662c9fbbfeb4f671e5f4d0ff857","source":{"kind":"arxiv","id":"1709.06218","version":3},"attestation_state":"computed","paper":{"title":"Almost-linear time decoding algorithm for topological codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Naomi H. Nickerson, Nicolas Delfosse","submitted_at":"2017-09-19T01:35:11Z","abstract_excerpt":"In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure. Our algorithm has a worst case complexity of $O(n \\alpha(n))$, where $n$ is the number of physical qubits and $\\alpha$ is the inverse of Ackermann's function, which is very slowly growing. For all practical purposes, $\\alpha(n) \\leq 3$. We prove that our algorithm performs optimally for errors of weight up to $(d-1)/2$ and for loss of up to $d-1$ qubits, "},"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":"1709.06218","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2017-09-19T01:35:11Z","cross_cats_sorted":[],"title_canon_sha256":"f3f264dcf265de476dd18152c563a4c114cd071cf4b02edd570cf5c9865e7aec","abstract_canon_sha256":"c55fd93458e25e842f6c494fbac9694302bf909180e4a7d7749b239a5146b650"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:09.897596Z","signature_b64":"G4HYnGLqqi99gxoKtVfQDD38fPx38CEVj0PhAhDjSY6FD39vdpdQvq34g7XSgfmKSAC3wZ0G2DdIHZ3oJdsIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1895c1fdf051a1a03d1eee1aa228488f6766662c9fbbfeb4f671e5f4d0ff857","last_reissued_at":"2026-07-05T03:38:09.897166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:09.897166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost-linear time decoding algorithm for topological codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Naomi H. Nickerson, Nicolas Delfosse","submitted_at":"2017-09-19T01:35:11Z","abstract_excerpt":"In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and erasure. Our algorithm has a worst case complexity of $O(n \\alpha(n))$, where $n$ is the number of physical qubits and $\\alpha$ is the inverse of Ackermann's function, which is very slowly growing. For all practical purposes, $\\alpha(n) \\leq 3$. We prove that our algorithm performs optimally for errors of weight up to $(d-1)/2$ and for loss of up to $d-1$ qubits, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06218","kind":"arxiv","version":3},"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/1709.06218/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":"1709.06218","created_at":"2026-07-05T03:38:09.897223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06218v3","created_at":"2026-07-05T03:38:09.897223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06218","created_at":"2026-07-05T03:38:09.897223+00:00"},{"alias_kind":"pith_short_12","alias_value":"2GEVYH67AUNB","created_at":"2026-07-05T03:38:09.897223+00:00"},{"alias_kind":"pith_short_16","alias_value":"2GEVYH67AUNBUA6R","created_at":"2026-07-05T03:38:09.897223+00:00"},{"alias_kind":"pith_short_8","alias_value":"2GEVYH67","created_at":"2026-07-05T03:38:09.897223+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10399","citing_title":"Average-Case and Smoothed Near-Optimality for Color-Code Decoding","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00038","citing_title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15389","citing_title":"A Unified Hardware-to-Decoder Architecture for Hybrid Continuous-Variable and Discrete-Variable Quantum Error Correction in LiDMaS+","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD","json":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD.json","graph_json":"https://pith.science/api/pith-number/2GEVYH67AUNBUA6R53Q2UIUERD/graph.json","events_json":"https://pith.science/api/pith-number/2GEVYH67AUNBUA6R53Q2UIUERD/events.json","paper":"https://pith.science/paper/2GEVYH67"},"agent_actions":{"view_html":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD","download_json":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD.json","view_paper":"https://pith.science/paper/2GEVYH67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06218&json=true","fetch_graph":"https://pith.science/api/pith-number/2GEVYH67AUNBUA6R53Q2UIUERD/graph.json","fetch_events":"https://pith.science/api/pith-number/2GEVYH67AUNBUA6R53Q2UIUERD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD/action/storage_attestation","attest_author":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD/action/author_attestation","sign_citation":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD/action/citation_signature","submit_replication":"https://pith.science/pith/2GEVYH67AUNBUA6R53Q2UIUERD/action/replication_record"}},"created_at":"2026-07-05T03:38:09.897223+00:00","updated_at":"2026-07-05T03:38:09.897223+00:00"}