{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LPLMQPUMY6IOI6427W62FQCLKG","short_pith_number":"pith:LPLMQPUM","schema_version":"1.0","canonical_sha256":"5bd6c83e8cc790e47b9afdbda2c04b51b9db9014d90b29533d733e231bcc7438","source":{"kind":"arxiv","id":"2502.16132","version":1},"attestation_state":"computed","paper":{"title":"A Constant Rate Quantum Computer on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Thiago Bergamaschi","submitted_at":"2025-02-22T07:58:20Z","abstract_excerpt":"We prove by construction that the Bravyi-Poulin-Terhal bound on the spatial density of stabilizer codes does not generalize to stabilizer circuits. To do so, we construct a fault tolerant quantum computer with a coding rate above 5% and quasi-polylog time overhead, out of a line of qubits with nearest-neighbor connectivity, and prove it has a threshold. The construction is based on modifications to the tower of Hamming codes of Yamasaki and Koashi (Nature Physics, 2024), with operators measured using a variant of Shor's measurement gadget."},"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":"2502.16132","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-22T07:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"477c2a4c0f071052c6026b8c121d94408c5d88e55e2294f968ff655ee881b7ce","abstract_canon_sha256":"9d386fe19d4127cdb10f40f994d25607e79079feb80be78a646394fbb5b2eddf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:21.683265Z","signature_b64":"BUcvFCP3YtCA28gPiMBmHywu9zs6Hj1B+cixfuUkLJmnDEfJZEDcJSVeMPipZj79Wle0N3mn39D615Ly8fMjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bd6c83e8cc790e47b9afdbda2c04b51b9db9014d90b29533d733e231bcc7438","last_reissued_at":"2026-07-05T10:18:21.682811Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:21.682811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant Rate Quantum Computer on a Line","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Craig Gidney, Thiago Bergamaschi","submitted_at":"2025-02-22T07:58:20Z","abstract_excerpt":"We prove by construction that the Bravyi-Poulin-Terhal bound on the spatial density of stabilizer codes does not generalize to stabilizer circuits. To do so, we construct a fault tolerant quantum computer with a coding rate above 5% and quasi-polylog time overhead, out of a line of qubits with nearest-neighbor connectivity, and prove it has a threshold. The construction is based on modifications to the tower of Hamming codes of Yamasaki and Koashi (Nature Physics, 2024), with operators measured using a variant of Shor's measurement gadget."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16132","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/2502.16132/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":"2502.16132","created_at":"2026-07-05T10:18:21.682867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16132v1","created_at":"2026-07-05T10:18:21.682867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16132","created_at":"2026-07-05T10:18:21.682867+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPLMQPUMY6IO","created_at":"2026-07-05T10:18:21.682867+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPLMQPUMY6IOI642","created_at":"2026-07-05T10:18:21.682867+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPLMQPUM","created_at":"2026-07-05T10:18:21.682867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26090","citing_title":"Fast mixing of all-to-all quantum systems at high temperatures","ref_index":144,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05870","citing_title":"Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG","json":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG.json","graph_json":"https://pith.science/api/pith-number/LPLMQPUMY6IOI6427W62FQCLKG/graph.json","events_json":"https://pith.science/api/pith-number/LPLMQPUMY6IOI6427W62FQCLKG/events.json","paper":"https://pith.science/paper/LPLMQPUM"},"agent_actions":{"view_html":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG","download_json":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG.json","view_paper":"https://pith.science/paper/LPLMQPUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16132&json=true","fetch_graph":"https://pith.science/api/pith-number/LPLMQPUMY6IOI6427W62FQCLKG/graph.json","fetch_events":"https://pith.science/api/pith-number/LPLMQPUMY6IOI6427W62FQCLKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG/action/storage_attestation","attest_author":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG/action/author_attestation","sign_citation":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG/action/citation_signature","submit_replication":"https://pith.science/pith/LPLMQPUMY6IOI6427W62FQCLKG/action/replication_record"}},"created_at":"2026-07-05T10:18:21.682867+00:00","updated_at":"2026-07-05T10:18:21.682867+00:00"}