{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RPAONS777O75KPERWLSTEKXTVY","short_pith_number":"pith:RPAONS77","schema_version":"1.0","canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","source":{"kind":"arxiv","id":"2301.08419","version":2},"attestation_state":"computed","paper":{"title":"Scalable Quantum Error Correction for Surface Codes using FPGA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Alexander Deters, Lin Zhong, Namitha Liyanage, Yue Wu","submitted_at":"2023-01-20T04:23:00Z","abstract_excerpt":"A fault-tolerant quantum computer must decode and correct errors faster than they appear. The faster errors can be corrected, the more time the computer can do useful work. The Union-Find (UF) decoder is promising with an average time complexity slightly higher than $O(d^3)$. We report a distributed version of the UF decoder that exploits parallel computing resources for further speedup. Using an FPGA-based implementation, we empirically show that this distributed UF decoder has a sublinear average time complexity with regard to $d$, given $O(d^3)$ parallel computing resources. The decoding ti"},"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":"2301.08419","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T04:23:00Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"13116032a218c561e5310d24381c876588143c819565858ccda4a93afc71fdda","abstract_canon_sha256":"02e1ed73457386dd668412e489c1463f259e9c6e778f1cfa3bfacb3f4504541c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:47.802623Z","signature_b64":"O3WPInKAoSLVL/r0rIJrWJZ6r4hDrOaB+EChjEBsGSoynAAPCWWybfvt3uCjSHQwhQC8LRq0bLjsmzaJW03PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","last_reissued_at":"2026-07-05T06:09:47.802184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:47.802184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Quantum Error Correction for Surface Codes using FPGA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Alexander Deters, Lin Zhong, Namitha Liyanage, Yue Wu","submitted_at":"2023-01-20T04:23:00Z","abstract_excerpt":"A fault-tolerant quantum computer must decode and correct errors faster than they appear. The faster errors can be corrected, the more time the computer can do useful work. The Union-Find (UF) decoder is promising with an average time complexity slightly higher than $O(d^3)$. We report a distributed version of the UF decoder that exploits parallel computing resources for further speedup. Using an FPGA-based implementation, we empirically show that this distributed UF decoder has a sublinear average time complexity with regard to $d$, given $O(d^3)$ parallel computing resources. The decoding ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08419","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/2301.08419/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":"2301.08419","created_at":"2026-07-05T06:09:47.802237+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.08419v2","created_at":"2026-07-05T06:09:47.802237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08419","created_at":"2026-07-05T06:09:47.802237+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPAONS777O75","created_at":"2026-07-05T06:09:47.802237+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPAONS777O75KPER","created_at":"2026-07-05T06:09:47.802237+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPAONS77","created_at":"2026-07-05T06:09:47.802237+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.02539","citing_title":"Constraint-Optimal Driven Allocation for Scalable QEC Decoder Scheduling","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01035","citing_title":"A Scalable FPGA Architecture for Real-Time Decoding of Quantum LDPC Codes Using GARI","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY","json":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY.json","graph_json":"https://pith.science/api/pith-number/RPAONS777O75KPERWLSTEKXTVY/graph.json","events_json":"https://pith.science/api/pith-number/RPAONS777O75KPERWLSTEKXTVY/events.json","paper":"https://pith.science/paper/RPAONS77"},"agent_actions":{"view_html":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY","download_json":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY.json","view_paper":"https://pith.science/paper/RPAONS77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.08419&json=true","fetch_graph":"https://pith.science/api/pith-number/RPAONS777O75KPERWLSTEKXTVY/graph.json","fetch_events":"https://pith.science/api/pith-number/RPAONS777O75KPERWLSTEKXTVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/action/storage_attestation","attest_author":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/action/author_attestation","sign_citation":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/action/citation_signature","submit_replication":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/action/replication_record"}},"created_at":"2026-07-05T06:09:47.802237+00:00","updated_at":"2026-07-05T06:09:47.802237+00:00"}