{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XMA7BYTWPNADCJUEJM44OPEVGG","short_pith_number":"pith:XMA7BYTW","schema_version":"1.0","canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","source":{"kind":"arxiv","id":"2308.13377","version":1},"attestation_state":"computed","paper":{"title":"Layered Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francisco Garcia-Herrero, Javier Valls, Julien du Crest, Mehdi Mhalla, Valentin Savin","submitted_at":"2023-08-25T13:37:56Z","abstract_excerpt":"We address the problem of performing message-passing-based decoding of quantum LDPC codes under hardware latency limitations. We propose a novel way to do layered decoding that suits quantum constraints and outperforms flooded scheduling, the usual scheduling on parallel architectures. A generic construction is given to construct layers of hypergraph product codes. In the process, we introduce two new notions, t-covering layers which is a generalization of the usual layer decomposition, and a new scheduling called random order scheduling. Numerical simulations show that the random ordering is "},"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":"2308.13377","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-25T13:37:56Z","cross_cats_sorted":[],"title_canon_sha256":"1017a5c71b3900cfe55d2c64cdb5d50cd1dd6516d40c0681207d335650ec853a","abstract_canon_sha256":"8542f92b231c8a02d1fe2a36234c7e4fc1e09214b4ba52bdb195aa4a4d189882"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:44:42.991023Z","signature_b64":"LvABpgIERc6hu+D0PbefKrbAucFpsgL7XQhlnK7VwLFoWQAbCcRyMeb7BK7X2VWkVhOyeb6G/hj67xqN/W8yCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb01f0e2767b403126844b39c73c9531a51663dc99628de99913844032330ae5","last_reissued_at":"2026-07-05T06:44:42.990528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:44:42.990528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layered Decoding of Quantum LDPC Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Francisco Garcia-Herrero, Javier Valls, Julien du Crest, Mehdi Mhalla, Valentin Savin","submitted_at":"2023-08-25T13:37:56Z","abstract_excerpt":"We address the problem of performing message-passing-based decoding of quantum LDPC codes under hardware latency limitations. We propose a novel way to do layered decoding that suits quantum constraints and outperforms flooded scheduling, the usual scheduling on parallel architectures. A generic construction is given to construct layers of hypergraph product codes. In the process, we introduce two new notions, t-covering layers which is a generalization of the usual layer decomposition, and a new scheduling called random order scheduling. Numerical simulations show that the random ordering is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13377","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/2308.13377/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":"2308.13377","created_at":"2026-07-05T06:44:42.990598+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13377v1","created_at":"2026-07-05T06:44:42.990598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13377","created_at":"2026-07-05T06:44:42.990598+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMA7BYTWPNAD","created_at":"2026-07-05T06:44:42.990598+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMA7BYTWPNADCJUE","created_at":"2026-07-05T06:44:42.990598+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMA7BYTW","created_at":"2026-07-05T06:44:42.990598+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03218","citing_title":"Edge-Based Anisotropic Decoding for Generalized Bicycle Codes","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG","json":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG.json","graph_json":"https://pith.science/api/pith-number/XMA7BYTWPNADCJUEJM44OPEVGG/graph.json","events_json":"https://pith.science/api/pith-number/XMA7BYTWPNADCJUEJM44OPEVGG/events.json","paper":"https://pith.science/paper/XMA7BYTW"},"agent_actions":{"view_html":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG","download_json":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG.json","view_paper":"https://pith.science/paper/XMA7BYTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13377&json=true","fetch_graph":"https://pith.science/api/pith-number/XMA7BYTWPNADCJUEJM44OPEVGG/graph.json","fetch_events":"https://pith.science/api/pith-number/XMA7BYTWPNADCJUEJM44OPEVGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/action/storage_attestation","attest_author":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/action/author_attestation","sign_citation":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/action/citation_signature","submit_replication":"https://pith.science/pith/XMA7BYTWPNADCJUEJM44OPEVGG/action/replication_record"}},"created_at":"2026-07-05T06:44:42.990598+00:00","updated_at":"2026-07-05T06:44:42.990598+00:00"}