{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H3RLK6HQHILSJ7A77O5BS65DJM","short_pith_number":"pith:H3RLK6HQ","schema_version":"1.0","canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","source":{"kind":"arxiv","id":"2603.28627","version":1},"attestation_state":"computed","paper":{"title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dolev Bluvstein, Harry Levine, Hsin-Yuan Huang, John Preskill, Lewis R. B. Picard, Madelyn Cain, Manuel Endres, Qian Xu, Robbie King","submitted_at":"2026-03-30T16:10:08Z","abstract_excerpt":"Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, "},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2603.28627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-30T16:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"0a7055d930073cdc885d5de7687ce443e79b6ed37211705fa0dbff525f459493","abstract_canon_sha256":"d076e27e5491f7e65d38a91711c91e851859e2b18ec18190b22fbc1b840b2179"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:49.102126Z","signature_b64":"KSZNHjNmPbuJj21+3SeEgNlGT//wQ9fsFvM8BnHAc1doRpTVvxUY7RrGqD3VPtvB8b3x3ai1Yo9xvGwO3fwcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235","last_reissued_at":"2026-05-17T23:38:49.101567Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:49.101567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dolev Bluvstein, Harry Levine, Hsin-Yuan Huang, John Preskill, Lewis R. B. Picard, Madelyn Cain, Manuel Endres, Qian Xu, Robbie King","submitted_at":"2026-03-30T16:10:08Z","abstract_excerpt":"Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance and practical relevance to cryptography. However, due to the high overhead of quantum error correction, optimized resource estimates for cryptographically relevant instances of Shor's algorithm require millions of physical qubits. Here, by leveraging advances in high-rate quantum error-correcting codes, efficient logical instruction sets, and circuit design, "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The performance and overhead of the high-rate quantum error-correcting codes, together with the assumption that neutral-atom hardware can achieve universal fault-tolerant operations below the error-correction threshold at the required scale and reconfigurability.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"84d83adea245091fb137bfc604525958d0c86b8aae422906c90bb9d494234fb2"},"source":{"id":"2603.28627","kind":"arxiv","version":1},"verdict":{"id":"cc7d43f6-f75c-4108-b956-37aa0c63b5be","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T04:29:40.755782Z","strongest_claim":"we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.","one_line_summary":"Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The performance and overhead of the high-rate quantum error-correcting codes, together with the assumption that neutral-atom hardware can achieve universal fault-tolerant operations below the error-correction threshold at the required scale and reconfigurability.","pith_extraction_headline":"Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits."},"references":{"count":86,"sample":[{"doi":"","year":2023,"title":"Kubica, A.et al.Erasure qubits: Overcoming theT 1 limit in superconducting circuits.Phys. Rev. X13, 041022 (2023)","work_id":"7a264430-3b89-48ec-b09d-b987608c664d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Taming Rydberg Decay with Measurement-based Quantum Computation","work_id":"3e59e5af-f445-434e-b31b-eb2d5b6db5dc","ref_index":2,"cited_arxiv_id":"2411.04664","is_internal_anchor":true},{"doi":"","year":2024,"title":"arXiv:2408.00842 [quant-ph]","work_id":"3737eb18-65cf-428a-8b39-1d5761a26d95","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Perrin, H., Jandura, S. & Pupillo, G. Quantum error correction resilient against atom loss (2025). arXiv:2412.07841 [quant-ph]","work_id":"b1173af5-d20e-49a3-a01b-470c5dacd440","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"arXiv:2502.20558 [quant-ph]","work_id":"069f4e20-0e7c-49dc-b182-af687085c438","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":86,"snapshot_sha256":"0554c028438a9ff7bd5df3bebc925f3162403b3dda08f259ae7b4604c0f5da2c","internal_anchors":4},"formal_canon":{"evidence_count":2,"snapshot_sha256":"275030b7691bd4f2771c050b901ae9cb93b56669dc14095374bb7af348a09180"},"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":"2603.28627","created_at":"2026-05-17T23:38:49.101656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.28627v1","created_at":"2026-05-17T23:38:49.101656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.28627","created_at":"2026-05-17T23:38:49.101656+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3RLK6HQHILS","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3RLK6HQHILSJ7A7","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3RLK6HQ","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":25,"internal_anchor_count":25,"sample":[{"citing_arxiv_id":"2605.22909","citing_title":"Sample-efficient benchmarking of shallow all-to-all random quantum circuits","ref_index":81,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21898","citing_title":"Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20346","citing_title":"Forced Gap Post-Selection for Quantum LDPC Codes and their Operations","ref_index":80,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21204","citing_title":"PIQC: Scalable Distributed Quantum Computing via Photonic Integration of Designed Molecular Quantum Nodes","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2605.21276","citing_title":"Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16010","citing_title":"Demonstration of a Multiplexing Trapped Ion Quantum Processing Unit","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15297","citing_title":"Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03715","citing_title":"Real-time Krylov Diagonalisation for Open Quantum Systems","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11318","citing_title":"Spatial overhead reduction for 2D hypergraph product codes","ref_index":111,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27943","citing_title":"Adaptable Continuous Variable Quantum Network with Finite Size Security","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10924","citing_title":"Multi-Qubit Stabilizer Readout on a Dual-Species Rydberg Array","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03951","citing_title":"Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05347","citing_title":"The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm","ref_index":54,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19481","citing_title":"Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.13158","citing_title":"Fast measurement of neutral atoms with a multi-atom gate","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2604.08669","citing_title":"An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06322","citing_title":"Probing the Planck scale with quantum computation","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06319","citing_title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","ref_index":35,"is_internal_anchor":true},{"citing_arxiv_id":"2604.04600","citing_title":"Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2604.15094","citing_title":"QLLVM: A Scalable Quantum-Classical Co-Compilation Framework based on LLVM","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16209","citing_title":"Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays","ref_index":75,"is_internal_anchor":true},{"citing_arxiv_id":"2604.16613","citing_title":"GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19735","citing_title":"Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03180","citing_title":"Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03854","citing_title":"Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM","json":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM.json","graph_json":"https://pith.science/api/pith-number/H3RLK6HQHILSJ7A77O5BS65DJM/graph.json","events_json":"https://pith.science/api/pith-number/H3RLK6HQHILSJ7A77O5BS65DJM/events.json","paper":"https://pith.science/paper/H3RLK6HQ"},"agent_actions":{"view_html":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM","download_json":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM.json","view_paper":"https://pith.science/paper/H3RLK6HQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.28627&json=true","fetch_graph":"https://pith.science/api/pith-number/H3RLK6HQHILSJ7A77O5BS65DJM/graph.json","fetch_events":"https://pith.science/api/pith-number/H3RLK6HQHILSJ7A77O5BS65DJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/action/storage_attestation","attest_author":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/action/author_attestation","sign_citation":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/action/citation_signature","submit_replication":"https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM/action/replication_record"}},"created_at":"2026-05-17T23:38:49.101656+00:00","updated_at":"2026-05-17T23:38:49.101656+00:00"}