{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:N7QZPAFKIZY67URD3P6IT4FSJI","short_pith_number":"pith:N7QZPAFK","schema_version":"1.0","canonical_sha256":"6fe19780aa4671efd223dbfc89f0b24a0148427316aec4126362a6d8decdff2b","source":{"kind":"arxiv","id":"2411.11822","version":3},"attestation_state":"computed","paper":{"title":"Fault-tolerant quantum computation with a neutral atom processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Neutral atom processors perform fault-tolerant computation by converting errors into detectable atom losses.","cross_cats":["physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Aaron Smull, Aarthi Sundaram, Adam Paetznick, Albert Ryou, Alexander Vaschillo, Andre Heinz, Andres Paz, Andrew Brown, Antonia M. W. Jones, Benjamin J. Bloom, Ben W. Reichardt, Cheng-An Chen, Christopher Griger, Ciro Nishiguchi, Daniel Crow, Daniel Stack, David Aasen, David Rodr\\'iguez P\\'erez, Eli Halperin, Eli Megidish, Eliot Kapit, Evan Zalys-Geller, Frederic Hummel, Graham Booth, Hyosub Kim, Ivan Basov, Jan Marjanovic, Jeffrey M. Epstein, Jonathan King, Jonathan M. Kindem, Jon Simon, Joseph Lauigan, Juan A. Muniz, Juan M. Bello-Rivas, Katrina Barnes, Kayleigh Cassella, Kelly A. Pawlak, Krish Kotru, Kristen L. Pudenz, Krysta M. Svore, Laura Wadleigh, Marcus P. da Silva, Mark O. Brown, Mark Stone, Matthew A. Norcia, Matthew B. Hastings, Matthew Jaffe, Matthew Meredith, Matt Zanner, Max Feldkamp, Michael McDonald, Ming Li, Miroslav Urbanek, Parsa Bonderson, Peter Battaglino, Ren\\'e J. M. van de Veerdonk, Robert T. Weverka, Robin Coxe, Rui Chao, Ryan Morshead, Ryan V. Mishmash, Sandeep Narayanaswami, Thomas C. Bohdanowicz, Thomas Wilkason, Timothy Paule, Tsung-Yao Wu, William B. Cairncross, Wim van Dam, Xiaogang Zhang, Xin Xie, Zachary Vendeiro, Zhenghan Wang","submitted_at":"2024-11-18T18:39:23Z","abstract_excerpt":"Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, wh"},"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":"2411.11822","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-18T18:39:23Z","cross_cats_sorted":["physics.atom-ph"],"title_canon_sha256":"2b2e3e39f529cd0a6385d9de616695c2bdbcfc330e7d3ed0eaa1bb19e3a046f0","abstract_canon_sha256":"bbb7b262a37267fbd17c8d28accbbf18ff67fa65345f4fbcaf129c39aa9bbc9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:49.925137Z","signature_b64":"z1luhZZL1Pzo6BFvUFFn4uPgZ3ErUGk8xDGIilJan/qA6MsTeyGoB4UXv9QemtxPrVGDEUvjqvQl9N4ueYDuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fe19780aa4671efd223dbfc89f0b24a0148427316aec4126362a6d8decdff2b","last_reissued_at":"2026-05-17T23:38:49.924441Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:49.924441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant quantum computation with a neutral atom processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Neutral atom processors perform fault-tolerant computation by converting errors into detectable atom losses.","cross_cats":["physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Aaron Smull, Aarthi Sundaram, Adam Paetznick, Albert Ryou, Alexander Vaschillo, Andre Heinz, Andres Paz, Andrew Brown, Antonia M. W. Jones, Benjamin J. Bloom, Ben W. Reichardt, Cheng-An Chen, Christopher Griger, Ciro Nishiguchi, Daniel Crow, Daniel Stack, David Aasen, David Rodr\\'iguez P\\'erez, Eli Halperin, Eli Megidish, Eliot Kapit, Evan Zalys-Geller, Frederic Hummel, Graham Booth, Hyosub Kim, Ivan Basov, Jan Marjanovic, Jeffrey M. Epstein, Jonathan King, Jonathan M. Kindem, Jon Simon, Joseph Lauigan, Juan A. Muniz, Juan M. Bello-Rivas, Katrina Barnes, Kayleigh Cassella, Kelly A. Pawlak, Krish Kotru, Kristen L. Pudenz, Krysta M. Svore, Laura Wadleigh, Marcus P. da Silva, Mark O. Brown, Mark Stone, Matthew A. Norcia, Matthew B. Hastings, Matthew Jaffe, Matthew Meredith, Matt Zanner, Max Feldkamp, Michael McDonald, Ming Li, Miroslav Urbanek, Parsa Bonderson, Peter Battaglino, Ren\\'e J. M. van de Veerdonk, Robert T. Weverka, Robin Coxe, Rui Chao, Ryan Morshead, Ryan V. Mishmash, Sandeep Narayanaswami, Thomas C. Bohdanowicz, Thomas Wilkason, Timothy Paule, Tsung-Yao Wu, William B. Cairncross, Wim van Dam, Xiaogang Zhang, Xin Xie, Zachary Vendeiro, Zhenghan Wang","submitted_at":"2024-11-18T18:39:23Z","abstract_excerpt":"Quantum computing experiments are transitioning from running on physical qubits to using encoded, logical qubits. Fault-tolerant computation can identify and correct errors, and has the potential to enable the dramatically reduced logical error rates required for valuable algorithms. However, it requires flexible control of high-fidelity operations performed on large numbers of qubits. We demonstrate fault-tolerant quantum computation on a quantum processor with 256 qubits, each an individual neutral Ytterbium atom. The operations are designed so that key error sources convert to atom loss, wh"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that the dominant error sources in the neutral-atom array convert reliably to detectable atom loss, allowing independent error detection without disturbing the logical qubit state.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Neutral atom processors perform fault-tolerant computation by converting errors into detectable atom losses.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a962b1028640243e5aa1a039e60a8b80c6d7a9650d0c568272f0e7395d8553ce"},"source":{"id":"2411.11822","kind":"arxiv","version":3},"verdict":{"id":"31dfcc70-d358-4491-a80e-69dca0773ee0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T22:31:24.043266Z","strongest_claim":"We demonstrate the entanglement of 24 logical qubits encoded into 48 atoms, at once catching errors and correcting for, on average 1.8, lost atoms. We also implement the Bernstein-Vazirani algorithm with up to 28 logical qubits encoded into 112 atoms, showing better-than-physical error rates.","one_line_summary":"A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that the dominant error sources in the neutral-atom array convert reliably to detectable atom loss, allowing independent error detection without disturbing the logical qubit state.","pith_extraction_headline":"Neutral atom processors perform fault-tolerant computation by converting errors into detectable atom losses."},"references":{"count":65,"sample":[{"doi":"10.26421/qic6.2-1","year":2006,"title":"arXiv preprint quant-ph/0504218 , year=","work_id":"0c7f841a-eecc-46d4-88ae-f1eb889f65e7","ref_index":1,"cited_arxiv_id":"quant-ph/0504218","is_internal_anchor":true},{"doi":"10.1103/physreva.73.012340","year":2006,"title":"Operator quantum error-correcting subsystems for self-correcting quantum memories","work_id":"27c5678d-aaeb-439f-b828-cd5a6a1337a3","ref_index":2,"cited_arxiv_id":"quant-ph/0506023","is_internal_anchor":true},{"doi":"10.1038/s41467-022-29977-z","year":2022,"title":"K. Barnes, P. Battaglino, B. J. Bloom, et al. Assembly and coherent control of a register of nuclear spin qubits. http://dx.doi.org/10.1038/s41467-022-29977-z Nat. Commun. 13(1):2779 (2022) , arXiv:21","work_id":"acec75ab-3863-4490-8135-5df74fb65132","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1038/s41586-023-06927-3","year":2024,"title":"D. Bluvstein, S. J. Evered, A. A. Geim, et al. Logical quantum processor based on reconfigurable atom arrays. http://dx.doi.org/10.1038/s41586-023-06927-3 Nature 626:58--65 (2024) , arXiv:2312.03982 h","work_id":"8ef2e3ae-6fce-440e-9dee-8e1479bfe318","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Assessing requirements to scale to practical quantum advantage","work_id":"e7813b83-6bed-4c93-bc82-53ef716563d6","ref_index":5,"cited_arxiv_id":"2211.07629","is_internal_anchor":true}],"resolved_work":65,"snapshot_sha256":"f78a633bbde5388d9d8557872837c2e2901e5b1a37f344b170a07a02370d6d87","internal_anchors":16},"formal_canon":{"evidence_count":2,"snapshot_sha256":"852a9265cb2f1e5746f5a37c4da04ae9ff485131d50d637659bb2ea874432d05"},"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":"2411.11822","created_at":"2026-05-17T23:38:49.924567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.11822v3","created_at":"2026-05-17T23:38:49.924567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.11822","created_at":"2026-05-17T23:38:49.924567+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7QZPAFKIZY6","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7QZPAFKIZY67URD","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7QZPAFK","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":32,"internal_anchor_count":32,"sample":[{"citing_arxiv_id":"2408.14828","citing_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","ref_index":66,"is_internal_anchor":true},{"citing_arxiv_id":"2504.21172","citing_title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","ref_index":50,"is_internal_anchor":true},{"citing_arxiv_id":"2505.09133","citing_title":"Quantum Error-Corrected Computation of Molecular Energies","ref_index":42,"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":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02498","citing_title":"Permutation Routing on Ramanujan Hypergraphs with Applications to Neutral Atom Quantum Architectures","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05036","citing_title":"Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2506.09686","citing_title":"Multi-Qubit Parity Gates for Rydberg Atoms in Various Configurations","ref_index":30,"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":70,"is_internal_anchor":true},{"citing_arxiv_id":"2508.11765","citing_title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","ref_index":22,"is_internal_anchor":true},{"citing_arxiv_id":"2509.13247","citing_title":"Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2510.05221","citing_title":"Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2510.10835","citing_title":"Rigorous estimation of error thresholds of transversal Clifford logical circuits","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2512.00843","citing_title":"Multiqubit Rydberg Gates for Quantum Error Correction","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2602.13399","citing_title":"Protection of Exponential Operation using Stabilizer Codes in the Early Fault Tolerance Era","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2511.05465","citing_title":"Helios: A 98-qubit trapped-ion quantum computer","ref_index":28,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15090","citing_title":"Energy efficiency of quantum computers","ref_index":81,"is_internal_anchor":true},{"citing_arxiv_id":"2603.24237","citing_title":"Correlated Atom Loss as a Resource for Quantum Error Correction","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03229","citing_title":"A scalable infrastructure for strontium optical clocks with integrated photonics","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03629","citing_title":"Adversarial Effects on Expressibility and Trainability in Distributed Variational Quantum Algorithms","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08341","citing_title":"Quantum metrology via partial quantum error correction","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25987","citing_title":"High-fidelity entangling gates and nonlocal circuits with neutral atoms","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25042","citing_title":"Stabilizers for Compiling Logical Circuits under Hardware Constraints","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06101","citing_title":"Syndrome resampling enhances quantum error correction thresholds","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05036","citing_title":"Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2604.19871","citing_title":"Co-Designing Error Mitigation and Error Detection for Logical Qubits","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI","json":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI.json","graph_json":"https://pith.science/api/pith-number/N7QZPAFKIZY67URD3P6IT4FSJI/graph.json","events_json":"https://pith.science/api/pith-number/N7QZPAFKIZY67URD3P6IT4FSJI/events.json","paper":"https://pith.science/paper/N7QZPAFK"},"agent_actions":{"view_html":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI","download_json":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI.json","view_paper":"https://pith.science/paper/N7QZPAFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.11822&json=true","fetch_graph":"https://pith.science/api/pith-number/N7QZPAFKIZY67URD3P6IT4FSJI/graph.json","fetch_events":"https://pith.science/api/pith-number/N7QZPAFKIZY67URD3P6IT4FSJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI/action/storage_attestation","attest_author":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI/action/author_attestation","sign_citation":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI/action/citation_signature","submit_replication":"https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI/action/replication_record"}},"created_at":"2026-05-17T23:38:49.924567+00:00","updated_at":"2026-05-17T23:38:49.924567+00:00"}