{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SFK7KZHC57PXX4IEN4H5I5IORX","short_pith_number":"pith:SFK7KZHC","schema_version":"1.0","canonical_sha256":"9155f564e2efdf7bf1046f0fd4750e8dd85520df4f78ee7e4ec5bdeac77374e3","source":{"kind":"arxiv","id":"2407.18490","version":1},"attestation_state":"computed","paper":{"title":"Fast and Parallelizable Logical Computation with Homological Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dolev Bluvstein, Guo Zheng, Hengyun Zhou, J. Pablo Bonilla Ataides, Liang Jiang, Mikhail D. Lukin, Qian Xu","submitted_at":"2024-07-26T03:49:59Z","abstract_excerpt":"Quantum error correction is necessary to perform large-scale quantum computation, but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes, and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical CNOTs between a data "},"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":"2407.18490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-07-26T03:49:59Z","cross_cats_sorted":[],"title_canon_sha256":"24e1a8de419d5262d1bd81f9c4708debe0c228b339b56bee3daebf4ea870e9aa","abstract_canon_sha256":"5283f1e486a085773502ad1ef446e903074ca45011409a82afa84fc798da4364"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:50.427702Z","signature_b64":"mqLcmsfCE0ISsAiXguCRAMxGeoWfuE3q8hd+fuc6I2aQuyHfb0YoWbFJ3ldC1L79U9vFKZEsSJpHpFONtPMpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9155f564e2efdf7bf1046f0fd4750e8dd85520df4f78ee7e4ec5bdeac77374e3","last_reissued_at":"2026-07-05T08:48:50.427288Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:50.427288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Parallelizable Logical Computation with Homological Product Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dolev Bluvstein, Guo Zheng, Hengyun Zhou, J. Pablo Bonilla Ataides, Liang Jiang, Mikhail D. Lukin, Qian Xu","submitted_at":"2024-07-26T03:49:59Z","abstract_excerpt":"Quantum error correction is necessary to perform large-scale quantum computation, but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes, and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical CNOTs between a data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18490","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/2407.18490/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":"2407.18490","created_at":"2026-07-05T08:48:50.427357+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.18490v1","created_at":"2026-07-05T08:48:50.427357+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18490","created_at":"2026-07-05T08:48:50.427357+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFK7KZHC57PX","created_at":"2026-07-05T08:48:50.427357+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFK7KZHC57PXX4IE","created_at":"2026-07-05T08:48:50.427357+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFK7KZHC","created_at":"2026-07-05T08:48:50.427357+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":92,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":92,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2411.11822","citing_title":"Fault-tolerant quantum computation with a neutral atom processor","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24739","citing_title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05126","citing_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX","json":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX.json","graph_json":"https://pith.science/api/pith-number/SFK7KZHC57PXX4IEN4H5I5IORX/graph.json","events_json":"https://pith.science/api/pith-number/SFK7KZHC57PXX4IEN4H5I5IORX/events.json","paper":"https://pith.science/paper/SFK7KZHC"},"agent_actions":{"view_html":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX","download_json":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX.json","view_paper":"https://pith.science/paper/SFK7KZHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.18490&json=true","fetch_graph":"https://pith.science/api/pith-number/SFK7KZHC57PXX4IEN4H5I5IORX/graph.json","fetch_events":"https://pith.science/api/pith-number/SFK7KZHC57PXX4IEN4H5I5IORX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX/action/storage_attestation","attest_author":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX/action/author_attestation","sign_citation":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX/action/citation_signature","submit_replication":"https://pith.science/pith/SFK7KZHC57PXX4IEN4H5I5IORX/action/replication_record"}},"created_at":"2026-07-05T08:48:50.427357+00:00","updated_at":"2026-07-05T08:48:50.427357+00:00"}