{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CZ2M2P7456SWZTEZDSPRPP7MX2","short_pith_number":"pith:CZ2M2P74","schema_version":"1.0","canonical_sha256":"1674cd3ffcefa56ccc991c9f17bfecbea1b78ccaf8f0e4b9ac1f29c63b2e7e5d","source":{"kind":"arxiv","id":"2601.15505","version":3},"attestation_state":"computed","paper":{"title":"Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform.","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Ruediger Urbanke, Shrinivas Kudekar, Tyler Kann","submitted_at":"2026-01-21T22:24:46Z","abstract_excerpt":"The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to apply a small inner stabilizer code to a few channel uses, decode, and treat the resulting logical noise as an induced Pauli channel; reapplying the hashing argument to this induced channel can beat the baseline hashing bound. We generalize this induced-channel viewpoint to arbitrary stabilizer codes used purely as channel transforms. Given any $ [\\![ n, k "},"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":"2601.15505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-01-21T22:24:46Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"b51b8a069a2f91a8f6f5e1eddaf0e327f644b9c9e990920e4f84f33299a62f55","abstract_canon_sha256":"9fc5f483f03c03ab0c4c269e9e63c6d98654f4e1bacbccdd3c9df13d41f39530"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:31.896260Z","signature_b64":"7wWAg8V41pKMxXZbM3zq1o+iA+8P7XZSxtFyN35cgXn1UUPBRUOj49KyDJjiInHsCeZJpA0pOhI9pJLRTaTHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1674cd3ffcefa56ccc991c9f17bfecbea1b78ccaf8f0e4b9ac1f29c63b2e7e5d","last_reissued_at":"2026-05-18T02:44:31.895846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:31.895846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stabilizer-Code Channel Transforms Beyond Repetition Codes for Improved Hashing Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform.","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Ruediger Urbanke, Shrinivas Kudekar, Tyler Kann","submitted_at":"2026-01-21T22:24:46Z","abstract_excerpt":"The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to apply a small inner stabilizer code to a few channel uses, decode, and treat the resulting logical noise as an induced Pauli channel; reapplying the hashing argument to this induced channel can beat the baseline hashing bound. We generalize this induced-channel viewpoint to arbitrary stabilizer codes used purely as channel transforms. Given any $ [\\![ n, k "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Given any [[n, k]] stabilizer generator set, we construct a full symplectic tableau, compute the induced joint distribution of logical Pauli errors and syndromes under the physical Pauli channel, and obtain an achievable rate via a hashing bound with decoder side information.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The induced logical channel after inner decoding can be treated as memoryless for re-applying the hashing bound, with the joint error-syndrome distribution accurately capturing all relevant statistics.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Arbitrary small stabilizer codes used as channel transforms improve hashing bounds for Pauli channels beyond repetition codes via induced logical noise distributions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"46f19dddaa43a468ee059bcbb693055d677b8bd36f7c1fa8fe0979ccf0570c52"},"source":{"id":"2601.15505","kind":"arxiv","version":3},"verdict":{"id":"b24abcac-d4c4-4fcc-8ac4-e2136268c8ae","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T11:38:55.932829Z","strongest_claim":"Given any [[n, k]] stabilizer generator set, we construct a full symplectic tableau, compute the induced joint distribution of logical Pauli errors and syndromes under the physical Pauli channel, and obtain an achievable rate via a hashing bound with decoder side information.","one_line_summary":"Arbitrary small stabilizer codes used as channel transforms improve hashing bounds for Pauli channels beyond repetition codes via induced logical noise distributions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The induced logical channel after inner decoding can be treated as memoryless for re-applying the hashing bound, with the joint error-syndrome distribution accurately capturing all relevant statistics.","pith_extraction_headline":"Any stabilizer code can improve hashing rates on asymmetric Pauli channels by acting as a channel transform."},"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":"2601.15505","created_at":"2026-05-18T02:44:31.895905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.15505v3","created_at":"2026-05-18T02:44:31.895905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.15505","created_at":"2026-05-18T02:44:31.895905+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZ2M2P7456SW","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZ2M2P7456SWZTEZ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZ2M2P74","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2","json":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2.json","graph_json":"https://pith.science/api/pith-number/CZ2M2P7456SWZTEZDSPRPP7MX2/graph.json","events_json":"https://pith.science/api/pith-number/CZ2M2P7456SWZTEZDSPRPP7MX2/events.json","paper":"https://pith.science/paper/CZ2M2P74"},"agent_actions":{"view_html":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2","download_json":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2.json","view_paper":"https://pith.science/paper/CZ2M2P74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.15505&json=true","fetch_graph":"https://pith.science/api/pith-number/CZ2M2P7456SWZTEZDSPRPP7MX2/graph.json","fetch_events":"https://pith.science/api/pith-number/CZ2M2P7456SWZTEZDSPRPP7MX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2/action/storage_attestation","attest_author":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2/action/author_attestation","sign_citation":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2/action/citation_signature","submit_replication":"https://pith.science/pith/CZ2M2P7456SWZTEZDSPRPP7MX2/action/replication_record"}},"created_at":"2026-05-18T02:44:31.895905+00:00","updated_at":"2026-05-18T02:44:31.895905+00:00"}