{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7HKE4SITYQLHRQ2W7AAECTMASR","short_pith_number":"pith:7HKE4SIT","schema_version":"1.0","canonical_sha256":"f9d44e4913c41678c356f800414d809451fb5e150c151092328449f62ca1c13f","source":{"kind":"arxiv","id":"2605.12796","version":1},"attestation_state":"computed","paper":{"title":"Quantum Precoded Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Rate-1 precoded polar codes yield CSS quantum codes with logical error rates matching a much larger surface code.","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Shrinivas Kudekar, Tyler Kann","submitted_at":"2026-05-12T22:25:00Z","abstract_excerpt":"We introduce a new family of CSS codes obtained from rate-1 precoded polar codes, which harnesses the precoding benefits obtained for classical short blocklength polar codes. We optimize the rate profile and precoder of these codes with a genetic algorithm, and present codes of dimension $ [\\![256, 2 ]\\!] $ and $ [\\![512, 2]\\!] $ that have logical error rates similar to the $ [\\![1201, 1, 25 ]\\!] $ surface code over the depolarizing channel."},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.12796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-12T22:25:00Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"fb08a9c8d73b130615470f7c06132c4df5dd5e8360e82159c31c8f4fdc56bb57","abstract_canon_sha256":"26940ee96b33df98e7e9565fcb10841de3ce34b9a660d5eed529d1ff6454fc45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:12.793153Z","signature_b64":"rjRDDTE2hLWH7d4l4a7MrOmjKZI5aTO+grxH6X7oO3xhb16N9tqAKorVwJKdoDvSO2jWhRgv33LNPh8/BreeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9d44e4913c41678c356f800414d809451fb5e150c151092328449f62ca1c13f","last_reissued_at":"2026-05-18T03:09:12.792277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:12.792277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Precoded Polar Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Rate-1 precoded polar codes yield CSS quantum codes with logical error rates matching a much larger surface code.","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Shrinivas Kudekar, Tyler Kann","submitted_at":"2026-05-12T22:25:00Z","abstract_excerpt":"We introduce a new family of CSS codes obtained from rate-1 precoded polar codes, which harnesses the precoding benefits obtained for classical short blocklength polar codes. We optimize the rate profile and precoder of these codes with a genetic algorithm, and present codes of dimension $ [\\![256, 2 ]\\!] $ and $ [\\![512, 2]\\!] $ that have logical error rates similar to the $ [\\![1201, 1, 25 ]\\!] $ surface code over the depolarizing channel."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present codes of dimension [[256, 2]] and [[512, 2]] that have logical error rates similar to the [[1201, 1, 25]] surface code over the depolarizing channel.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The benefits of classical rate-1 precoding for short-blocklength polar codes transfer directly to the quantum CSS setting after genetic-algorithm optimization of the rate profile and precoder.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Quantum CSS codes derived from precoded polar codes match the logical error performance of a large surface code at small block lengths [[256,2]] and [[512,2]] over depolarizing noise.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Rate-1 precoded polar codes yield CSS quantum codes with logical error rates matching a much larger surface code.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fb8c78c2f11f81d74373fc0e7790122254f6a8100d1503613abdbcbe5b7179b2"},"source":{"id":"2605.12796","kind":"arxiv","version":1},"verdict":{"id":"d130ae68-982c-45c2-aedf-90cef59f776d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:22:58.051999Z","strongest_claim":"We present codes of dimension [[256, 2]] and [[512, 2]] that have logical error rates similar to the [[1201, 1, 25]] surface code over the depolarizing channel.","one_line_summary":"Quantum CSS codes derived from precoded polar codes match the logical error performance of a large surface code at small block lengths [[256,2]] and [[512,2]] over depolarizing noise.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The benefits of classical rate-1 precoding for short-blocklength polar codes transfer directly to the quantum CSS setting after genetic-algorithm optimization of the rate profile and precoder.","pith_extraction_headline":"Rate-1 precoded polar codes yield CSS quantum codes with logical error rates matching a much larger surface code."},"references":{"count":26,"sample":[{"doi":"","year":1997,"title":"Gottesman,Stabilizer codes and quantum error correction","work_id":"c43c2cf6-082c-4a22-ae91-b8ab7242b8ff","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1996,"title":"Good Quantum Error-Correcting Codes Exist,","work_id":"13375479-1efe-4258-9ec4-86442696d445","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1954,"title":"Multiple-particle interference and quantum error correction,","work_id":"6bd491d0-a541-46e2-87c7-e294fc8da2a2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"Efficient Polar Coding of Quantum Information,","work_id":"7e3eaf2c-a973-495d-a2d8-69552e8ac6ef","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Fault-tolerant preparation of quantum polar codes encoding one logical qubit,","work_id":"bd6ad896-5ebe-4ef0-8c1b-7855e9d6b513","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":26,"snapshot_sha256":"3fd95a94693b54a78726692419db5a0793ecd67103ee8163109fd06d783645bf","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":"2605.12796","created_at":"2026-05-18T03:09:12.792411+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12796v1","created_at":"2026-05-18T03:09:12.792411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12796","created_at":"2026-05-18T03:09:12.792411+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HKE4SITYQLH","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HKE4SITYQLHRQ2W","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HKE4SIT","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/7HKE4SITYQLHRQ2W7AAECTMASR","json":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR.json","graph_json":"https://pith.science/api/pith-number/7HKE4SITYQLHRQ2W7AAECTMASR/graph.json","events_json":"https://pith.science/api/pith-number/7HKE4SITYQLHRQ2W7AAECTMASR/events.json","paper":"https://pith.science/paper/7HKE4SIT"},"agent_actions":{"view_html":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR","download_json":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR.json","view_paper":"https://pith.science/paper/7HKE4SIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12796&json=true","fetch_graph":"https://pith.science/api/pith-number/7HKE4SITYQLHRQ2W7AAECTMASR/graph.json","fetch_events":"https://pith.science/api/pith-number/7HKE4SITYQLHRQ2W7AAECTMASR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR/action/storage_attestation","attest_author":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR/action/author_attestation","sign_citation":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR/action/citation_signature","submit_replication":"https://pith.science/pith/7HKE4SITYQLHRQ2W7AAECTMASR/action/replication_record"}},"created_at":"2026-05-18T03:09:12.792411+00:00","updated_at":"2026-05-18T03:09:12.792411+00:00"}