pith. sign in
Pith Number

pith:N7QZPAFK

pith:2024:N7QZPAFKIZY67URD3P6IT4FSJI
not attested not anchored not stored refs resolved

Fault-tolerant quantum computation with a neutral atom processor

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

Neutral atom processors perform fault-tolerant computation by converting errors into detectable atom losses.

arxiv:2411.11822 v3 · 2024-11-18 · quant-ph · physics.atom-ph

Add to your LaTeX paper
\usepackage{pith}
\pithnumber{N7QZPAFKIZY67URD3P6IT4FSJI}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp
2 Internet Archive
3 Author claim open · sign in to claim
4 Citations open
5 Replications open
Portable graph bundle live · download bundle · merged state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

65 extracted · 65 resolved · 16 Pith anchors

[1] arXiv preprint quant-ph/0504218 , year= 2006 · doi:10.26421/qic6.2-1
[2] Operator quantum error-correcting subsystems for self-correcting quantum memories 2006 · doi:10.1103/physreva.73.012340
[3] 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 2022 · doi:10.1038/s41467-022-29977-z
[4] 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 2024 · doi:10.1038/s41586-023-06927-3
[5] Assessing requirements to scale to practical quantum advantage 2022 · arXiv:2211.07629

Formal links

2 machine-checked theorem links

Cited by

32 papers in Pith

Receipt and verification
First computed 2026-05-17T23:38:49.924441Z
Builder pith-number-builder-2026-05-17-v1
Signature Pith Ed25519 (pith-v1-2026-05) · public key
Schema pith-number/v1.0

Canonical hash

6fe19780aa4671efd223dbfc89f0b24a0148427316aec4126362a6d8decdff2b

Aliases

arxiv: 2411.11822 · arxiv_version: 2411.11822v3 · doi: 10.48550/arxiv.2411.11822 · pith_short_12: N7QZPAFKIZY6 · pith_short_16: N7QZPAFKIZY67URD · pith_short_8: N7QZPAFK
Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/N7QZPAFKIZY67URD3P6IT4FSJI \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 6fe19780aa4671efd223dbfc89f0b24a0148427316aec4126362a6d8decdff2b
Canonical record JSON
{
  "metadata": {
    "abstract_canon_sha256": "bbb7b262a37267fbd17c8d28accbbf18ff67fa65345f4fbcaf129c39aa9bbc9f",
    "cross_cats_sorted": [
      "physics.atom-ph"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2024-11-18T18:39:23Z",
    "title_canon_sha256": "2b2e3e39f529cd0a6385d9de616695c2bdbcfc330e7d3ed0eaa1bb19e3a046f0"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2411.11822",
    "kind": "arxiv",
    "version": 3
  }
}