{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6ZB2QZWZ5RGBGPUPW6AI5X45BV","short_pith_number":"pith:6ZB2QZWZ","schema_version":"1.0","canonical_sha256":"f643a866d9ec4c133e8fb7808edf9d0d7b7852f3721e8a3cfdd1285c3eac8533","source":{"kind":"arxiv","id":"2506.15636","version":1},"attestation_state":"computed","paper":{"title":"Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kenta Kasai","submitted_at":"2025-06-18T17:07:04Z","abstract_excerpt":"Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decoding performance. Simulation results over the depolarizing channel indicate that the proposed method, at"},"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":"2506.15636","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-18T17:07:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"beb397f573284b0bd263c1e1df220f7e9ff6ba570b17555d59c63d4554e1fb0e","abstract_canon_sha256":"740a0ebb66dea6da780cc34ef85c1f74d52205154e857c95c3e493590799699f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:47.476601Z","signature_b64":"/3T/0SHslSesTvEKO7RW3RNTKSacpMDJjPzJQs9iTU7qDy6cKdZxPIchGNju+7sQjuSEO27q4ImIZCnq1Fg7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f643a866d9ec4c133e8fb7808edf9d0d7b7852f3721e8a3cfdd1285c3eac8533","last_reissued_at":"2026-07-05T11:23:47.476091Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:47.476091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Kenta Kasai","submitted_at":"2025-06-18T17:07:04Z","abstract_excerpt":"Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decoding performance. Simulation results over the depolarizing channel indicate that the proposed method, at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15636","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/2506.15636/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":"2506.15636","created_at":"2026-07-05T11:23:47.476162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15636v1","created_at":"2026-07-05T11:23:47.476162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15636","created_at":"2026-07-05T11:23:47.476162+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZB2QZWZ5RGB","created_at":"2026-07-05T11:23:47.476162+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZB2QZWZ5RGBGPUP","created_at":"2026-07-05T11:23:47.476162+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZB2QZWZ","created_at":"2026-07-05T11:23:47.476162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23894","citing_title":"A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15307","citing_title":"Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV","json":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV.json","graph_json":"https://pith.science/api/pith-number/6ZB2QZWZ5RGBGPUPW6AI5X45BV/graph.json","events_json":"https://pith.science/api/pith-number/6ZB2QZWZ5RGBGPUPW6AI5X45BV/events.json","paper":"https://pith.science/paper/6ZB2QZWZ"},"agent_actions":{"view_html":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV","download_json":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV.json","view_paper":"https://pith.science/paper/6ZB2QZWZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15636&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZB2QZWZ5RGBGPUPW6AI5X45BV/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZB2QZWZ5RGBGPUPW6AI5X45BV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV/action/storage_attestation","attest_author":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV/action/author_attestation","sign_citation":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV/action/citation_signature","submit_replication":"https://pith.science/pith/6ZB2QZWZ5RGBGPUPW6AI5X45BV/action/replication_record"}},"created_at":"2026-07-05T11:23:47.476162+00:00","updated_at":"2026-07-05T11:23:47.476162+00:00"}