{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MCYWZHBVA4ZQIZTDLSZCSHHUP4","short_pith_number":"pith:MCYWZHBV","schema_version":"1.0","canonical_sha256":"60b16c9c3507330466635cb2291cf47f17eb423ea23df2ee54b740fc1fb86df2","source":{"kind":"arxiv","id":"2404.17676","version":2},"attestation_state":"computed","paper":{"title":"Toward a 2D Local Implementation of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Andrew M. Childs, Daniel Gottesman, Dhruv Devulapalli, Eddie Schoute, Michael J. Gullans, Noah Berthusen","submitted_at":"2024-04-26T19:48:07Z","abstract_excerpt":"Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes which affects code performance and ease of physical realization. For device architectures restricted to 2D local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investiga"},"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":"2404.17676","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-26T19:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"ad2a701d599ff27ae95fd2826c20014eeef3fb20f554cd1f9ead93f5cd26aab1","abstract_canon_sha256":"b718f96c72b2c012ca64df2e7a8b2d1c02d37c407a330091d2971ff0d5c05f56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:26.063046Z","signature_b64":"q3WDIJ00uB2ss4hiFlPUSjSEv6sMtWb9VcbYI5iknAbJKYaarYmvjhmjXECj8vLfvtsbegDsb4TuNZN3pXBgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60b16c9c3507330466635cb2291cf47f17eb423ea23df2ee54b740fc1fb86df2","last_reissued_at":"2026-07-05T10:00:26.062623Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:26.062623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a 2D Local Implementation of Quantum LDPC Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Andrew M. Childs, Daniel Gottesman, Dhruv Devulapalli, Eddie Schoute, Michael J. Gullans, Noah Berthusen","submitted_at":"2024-04-26T19:48:07Z","abstract_excerpt":"Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes which affects code performance and ease of physical realization. For device architectures restricted to 2D local gates, naively implementing the high-rate codes suitable for low-overhead fault-tolerant quantum computing incurs prohibitive overhead. In this work, we present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates by measuring some generators less frequently than others. We investiga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.17676","kind":"arxiv","version":2},"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/2404.17676/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":"2404.17676","created_at":"2026-07-05T10:00:26.062678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.17676v2","created_at":"2026-07-05T10:00:26.062678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.17676","created_at":"2026-07-05T10:00:26.062678+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCYWZHBVA4ZQ","created_at":"2026-07-05T10:00:26.062678+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCYWZHBVA4ZQIZTD","created_at":"2026-07-05T10:00:26.062678+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCYWZHBV","created_at":"2026-07-05T10:00:26.062678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2407.16176","citing_title":"Quantum memory based on concatenating surface codes and quantum Hamming codes","ref_index":30,"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":117,"is_internal_anchor":false},{"citing_arxiv_id":"2507.23011","citing_title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2603.19062","citing_title":"Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.01040","citing_title":"Geometry-induced correlated noise in qLDPC syndrome extraction","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4","json":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4.json","graph_json":"https://pith.science/api/pith-number/MCYWZHBVA4ZQIZTDLSZCSHHUP4/graph.json","events_json":"https://pith.science/api/pith-number/MCYWZHBVA4ZQIZTDLSZCSHHUP4/events.json","paper":"https://pith.science/paper/MCYWZHBV"},"agent_actions":{"view_html":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4","download_json":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4.json","view_paper":"https://pith.science/paper/MCYWZHBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.17676&json=true","fetch_graph":"https://pith.science/api/pith-number/MCYWZHBVA4ZQIZTDLSZCSHHUP4/graph.json","fetch_events":"https://pith.science/api/pith-number/MCYWZHBVA4ZQIZTDLSZCSHHUP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4/action/storage_attestation","attest_author":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4/action/author_attestation","sign_citation":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4/action/citation_signature","submit_replication":"https://pith.science/pith/MCYWZHBVA4ZQIZTDLSZCSHHUP4/action/replication_record"}},"created_at":"2026-07-05T10:00:26.062678+00:00","updated_at":"2026-07-05T10:00:26.062678+00:00"}