{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BNSTMGZRNGHM3QIKHECJ3OCIDT","short_pith_number":"pith:BNSTMGZR","schema_version":"1.0","canonical_sha256":"0b65361b31698ecdc10a39049db8481cd300aa4dac20a3cc31faafb5f32021da","source":{"kind":"arxiv","id":"2311.16980","version":3},"attestation_state":"computed","paper":{"title":"qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic T. Chong, Jonathan M. Baker, Joshua Viszlai, Junyu Liu, Natalia Nottingham, Sophia Fuhui Lin, Willers Yang","submitted_at":"2023-11-28T17:31:08Z","abstract_excerpt":"As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes has been a longstanding challenge.\n  At the e"},"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":"2311.16980","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-11-28T17:31:08Z","cross_cats_sorted":[],"title_canon_sha256":"428e256440d8b00ba566f69bb18c6cbac289f220ee06f5a0bdb99badd637f201","abstract_canon_sha256":"60baa1b9f43c920ddfd8e59c326e203a2c9be3da1c47bb552271190e99a1097c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:32.374863Z","signature_b64":"gIuF73djNxVh8qzQRrh7LwmlgvwcjNXERbAmXYkq4Hz2ZGKLpTKpj/lxeZrz0tdbnkHfGXF1/8uHcL3nGFY/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b65361b31698ecdc10a39049db8481cd300aa4dac20a3cc31faafb5f32021da","last_reissued_at":"2026-05-29T02:05:32.373903Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:32.373903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic T. Chong, Jonathan M. Baker, Joshua Viszlai, Junyu Liu, Natalia Nottingham, Sophia Fuhui Lin, Willers Yang","submitted_at":"2023-11-28T17:31:08Z","abstract_excerpt":"As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes has been a longstanding challenge.\n  At the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.16980","kind":"arxiv","version":3},"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/2311.16980/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":"2311.16980","created_at":"2026-05-29T02:05:32.374030+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.16980v3","created_at":"2026-05-29T02:05:32.374030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.16980","created_at":"2026-05-29T02:05:32.374030+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNSTMGZRNGHM","created_at":"2026-05-29T02:05:32.374030+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNSTMGZRNGHM3QIK","created_at":"2026-05-29T02:05:32.374030+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNSTMGZR","created_at":"2026-05-29T02:05:32.374030+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":8,"sample":[{"citing_arxiv_id":"2504.05611","citing_title":"Transversal Fault Tolerant Distributed Quantum Computing Operations","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2512.06484","citing_title":"PureMagic: A Dynamic Scheduler for Lattice Surgery","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2507.12024","citing_title":"Benchmarking fault-tolerant quantum computing hardware via QLOPS","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2507.23011","citing_title":"Placing and routing quantum LDPC codes in multilayer superconducting hardware","ref_index":84,"is_internal_anchor":true},{"citing_arxiv_id":"2508.10714","citing_title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","ref_index":91,"is_internal_anchor":true},{"citing_arxiv_id":"2604.24739","citing_title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","ref_index":57,"is_internal_anchor":true},{"citing_arxiv_id":"2604.18714","citing_title":"Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16209","citing_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT","json":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT.json","graph_json":"https://pith.science/api/pith-number/BNSTMGZRNGHM3QIKHECJ3OCIDT/graph.json","events_json":"https://pith.science/api/pith-number/BNSTMGZRNGHM3QIKHECJ3OCIDT/events.json","paper":"https://pith.science/paper/BNSTMGZR"},"agent_actions":{"view_html":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT","download_json":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT.json","view_paper":"https://pith.science/paper/BNSTMGZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.16980&json=true","fetch_graph":"https://pith.science/api/pith-number/BNSTMGZRNGHM3QIKHECJ3OCIDT/graph.json","fetch_events":"https://pith.science/api/pith-number/BNSTMGZRNGHM3QIKHECJ3OCIDT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT/action/storage_attestation","attest_author":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT/action/author_attestation","sign_citation":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT/action/citation_signature","submit_replication":"https://pith.science/pith/BNSTMGZRNGHM3QIKHECJ3OCIDT/action/replication_record"}},"created_at":"2026-05-29T02:05:32.374030+00:00","updated_at":"2026-05-29T02:05:32.374030+00:00"}