Pith Number

pith:H3RLK6HQ

pith:2026:H3RLK6HQHILSJ7A77O5BS65DJM

not attested not anchored not stored refs resolved

Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits

Dolev Bluvstein, Harry Levine, Hsin-Yuan Huang, John Preskill, Lewis R. B. Picard, Madelyn Cain, Manuel Endres, Qian Xu, Robbie King

Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.

arxiv:2603.28627 v1 · 2026-03-30 · quant-ph

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{H3RLK6HQHILSJ7A77O5BS65DJM}

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 show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits.

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

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

References

86 extracted · 86 resolved · 4 Pith anchors

[1] Kubica, A.et al.Erasure qubits: Overcoming theT 1 limit in superconducting circuits.Phys. Rev. X13, 041022 (2023) 2023

[2] Taming Rydberg Decay with Measurement-based Quantum Computation 2025 · arXiv:2411.04664

[3] arXiv:2408.00842 [quant-ph] 2024

[4] Perrin, H., Jandura, S. & Pupillo, G. Quantum error correction resilient against atom loss (2025). arXiv:2412.07841 [quant-ph] 2025

[5] arXiv:2502.20558 [quant-ph] 2025

Formal links

2 machine-checked theorem links

Cited by

25 papers in Pith

Sample-efficient benchmarking of shallow all-to-all random quantum circuits

Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes

Forced Gap Post-Selection for Quantum LDPC Codes and their Operations

PIQC: Scalable Distributed Quantum Computing via Photonic Integration of Designed Molecular Quantum Nodes

Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor

Receipt and verification

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

Canonical hash

3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235

Aliases

arxiv: 2603.28627 · arxiv_version: 2603.28627v1 · doi: 10.48550/arxiv.2603.28627 · pith_short_12: H3RLK6HQHILS · pith_short_16: H3RLK6HQHILSJ7A7 · pith_short_8: H3RLK6HQ

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/H3RLK6HQHILSJ7A77O5BS65DJM \
  | 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: 3ee2b578f03a1724fc1ffbba197ba34b3102eb1f9cfea40d9db9221273aba235

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "d076e27e5491f7e65d38a91711c91e851859e2b18ec18190b22fbc1b840b2179",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "quant-ph",
    "submitted_at": "2026-03-30T16:10:08Z",
    "title_canon_sha256": "0a7055d930073cdc885d5de7687ce443e79b6ed37211705fa0dbff525f459493"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2603.28627",
    "kind": "arxiv",
    "version": 1
  }
}