{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FRMJMAEOO2NS32COCZD5NZ5M6T","short_pith_number":"pith:FRMJMAEO","schema_version":"1.0","canonical_sha256":"2c5896008e769b2de84e1647d6e7acf4d6a4a196d18d9869ed486c5fd94001c9","source":{"kind":"arxiv","id":"2605.21898","version":1},"attestation_state":"computed","paper":{"title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Andrew W. Cross, Jay M. Gambetta, Lev S. Bishop, Michael E. Beverland, Patrick Rall, Vikesh Siddhu","submitted_at":"2026-05-21T02:12:36Z","abstract_excerpt":"Different quantum error correction schemes trade off overhead, error suppression, and hardware connectivity. Code concatenation can relax these tradeoffs by using an outer code whose non-local connectivity is supplied by logical operations of an inner code rather than directly by hardware. Prior works showed that this can reduce memory overhead for local low-rate inner codes such as the surface code. Here, we study concatenation over non-local, high-rate inner codes. Such inner codes experience correlated errors among the many logical qubits in a single codeblock. We handle this by treating ea"},"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":"2605.21898","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-21T02:12:36Z","cross_cats_sorted":[],"title_canon_sha256":"92ef84e24c37f8714fa6b42260f72db00c723511d42b82c47314ab0445504614","abstract_canon_sha256":"0cf573dc70ea63a880735869f1287fde875e655173a02f6159d4df135c7f5917"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:04:13.555964Z","signature_b64":"waP8PLXzpojag1aC4gJkonj7GWJXDfSAT/aEtB+5fATMOsRdfriaeJ4jU8hFPpgbagjHbp1L6bD6SJAvJydHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c5896008e769b2de84e1647d6e7acf4d6a4a196d18d9869ed486c5fd94001c9","last_reissued_at":"2026-05-22T01:04:13.555160Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:04:13.555160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Andrew W. Cross, Jay M. Gambetta, Lev S. Bishop, Michael E. Beverland, Patrick Rall, Vikesh Siddhu","submitted_at":"2026-05-21T02:12:36Z","abstract_excerpt":"Different quantum error correction schemes trade off overhead, error suppression, and hardware connectivity. Code concatenation can relax these tradeoffs by using an outer code whose non-local connectivity is supplied by logical operations of an inner code rather than directly by hardware. Prior works showed that this can reduce memory overhead for local low-rate inner codes such as the surface code. Here, we study concatenation over non-local, high-rate inner codes. Such inner codes experience correlated errors among the many logical qubits in a single codeblock. We handle this by treating ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21898","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/2605.21898/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":"2605.21898","created_at":"2026-05-22T01:04:13.555299+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21898v1","created_at":"2026-05-22T01:04:13.555299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21898","created_at":"2026-05-22T01:04:13.555299+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRMJMAEOO2NS","created_at":"2026-05-22T01:04:13.555299+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRMJMAEOO2NS32CO","created_at":"2026-05-22T01:04:13.555299+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRMJMAEO","created_at":"2026-05-22T01:04:13.555299+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/FRMJMAEOO2NS32COCZD5NZ5M6T","json":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T.json","graph_json":"https://pith.science/api/pith-number/FRMJMAEOO2NS32COCZD5NZ5M6T/graph.json","events_json":"https://pith.science/api/pith-number/FRMJMAEOO2NS32COCZD5NZ5M6T/events.json","paper":"https://pith.science/paper/FRMJMAEO"},"agent_actions":{"view_html":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T","download_json":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T.json","view_paper":"https://pith.science/paper/FRMJMAEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21898&json=true","fetch_graph":"https://pith.science/api/pith-number/FRMJMAEOO2NS32COCZD5NZ5M6T/graph.json","fetch_events":"https://pith.science/api/pith-number/FRMJMAEOO2NS32COCZD5NZ5M6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T/action/storage_attestation","attest_author":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T/action/author_attestation","sign_citation":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T/action/citation_signature","submit_replication":"https://pith.science/pith/FRMJMAEOO2NS32COCZD5NZ5M6T/action/replication_record"}},"created_at":"2026-05-22T01:04:13.555299+00:00","updated_at":"2026-05-22T01:04:13.555299+00:00"}