{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:E5XODGJZD6M7BECO3MOGLEX34X","short_pith_number":"pith:E5XODGJZ","schema_version":"1.0","canonical_sha256":"276ee199391f99f0904edb1c6592fbe5fd5a0d93b8e4766e112aa24c79e59940","source":{"kind":"arxiv","id":"2504.08887","version":4},"attestation_state":"computed","paper":{"title":"Planar quantum low-density parity-check codes with open boundaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Jens Niklas Eberhardt, Yu-An Chen, Zijian Liang","submitted_at":"2025-04-11T18:00:05Z","abstract_excerpt":"Although high-threshold and low-overhead quantum low-density parity-check (qLDPC) codes, such as bivariate bicycle (BB) codes, can reduce the physical-qubit cost by an order of magnitude compared to the Kitaev toric code, their torus layout remains difficult for physical implementation. In this work, we introduce the first systematic procedure to convert BB codes into fully planar, open-boundary qLDPC codes, preserving their performance. We present planar code families with logical dimensions $6 \\leq k\\leq13$, e.g., $[[78, 6, 6]]$, $[[107, 7, 7]]$, $[[268, 8, 12]]$, $[[405, 9, 15]]$, $[[348, 1"},"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":"2504.08887","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-11T18:00:05Z","cross_cats_sorted":["cond-mat.str-el","math-ph","math.MP"],"title_canon_sha256":"1a476cddd114ff7186d6bd83192d4c8fac3e84250a9da7bf8a04dbfbf93dc69e","abstract_canon_sha256":"f20f5a32e0c0b0a530a01f7faafc7e35580acb9a3f25c829071051a98b9327c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:35.781927Z","signature_b64":"RyHPZQgnjEioWFcABQsXoS9HvMLZUjwfQm5UWJWpO6H0+s14nskUyRsxZWIzcfdgJy8xPRxW1AOK7B2axSwbBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"276ee199391f99f0904edb1c6592fbe5fd5a0d93b8e4766e112aa24c79e59940","last_reissued_at":"2026-07-05T11:57:35.781453Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:35.781453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar quantum low-density parity-check codes with open boundaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el","math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Jens Niklas Eberhardt, Yu-An Chen, Zijian Liang","submitted_at":"2025-04-11T18:00:05Z","abstract_excerpt":"Although high-threshold and low-overhead quantum low-density parity-check (qLDPC) codes, such as bivariate bicycle (BB) codes, can reduce the physical-qubit cost by an order of magnitude compared to the Kitaev toric code, their torus layout remains difficult for physical implementation. In this work, we introduce the first systematic procedure to convert BB codes into fully planar, open-boundary qLDPC codes, preserving their performance. We present planar code families with logical dimensions $6 \\leq k\\leq13$, e.g., $[[78, 6, 6]]$, $[[107, 7, 7]]$, $[[268, 8, 12]]$, $[[405, 9, 15]]$, $[[348, 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.08887","kind":"arxiv","version":4},"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/2504.08887/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":"2504.08887","created_at":"2026-07-05T11:57:35.781513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.08887v4","created_at":"2026-07-05T11:57:35.781513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.08887","created_at":"2026-07-05T11:57:35.781513+00:00"},{"alias_kind":"pith_short_12","alias_value":"E5XODGJZD6M7","created_at":"2026-07-05T11:57:35.781513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E5XODGJZD6M7BECO","created_at":"2026-07-05T11:57:35.781513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E5XODGJZ","created_at":"2026-07-05T11:57:35.781513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22853","citing_title":"Bunny Codes: Broadening Superconducting Quantum Error Correction Capability through Advanced Control Engineering","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20263","citing_title":"Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2410.11942","citing_title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2507.23011","citing_title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01040","citing_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X","json":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X.json","graph_json":"https://pith.science/api/pith-number/E5XODGJZD6M7BECO3MOGLEX34X/graph.json","events_json":"https://pith.science/api/pith-number/E5XODGJZD6M7BECO3MOGLEX34X/events.json","paper":"https://pith.science/paper/E5XODGJZ"},"agent_actions":{"view_html":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X","download_json":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X.json","view_paper":"https://pith.science/paper/E5XODGJZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.08887&json=true","fetch_graph":"https://pith.science/api/pith-number/E5XODGJZD6M7BECO3MOGLEX34X/graph.json","fetch_events":"https://pith.science/api/pith-number/E5XODGJZD6M7BECO3MOGLEX34X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X/action/storage_attestation","attest_author":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X/action/author_attestation","sign_citation":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X/action/citation_signature","submit_replication":"https://pith.science/pith/E5XODGJZD6M7BECO3MOGLEX34X/action/replication_record"}},"created_at":"2026-07-05T11:57:35.781513+00:00","updated_at":"2026-07-05T11:57:35.781513+00:00"}