Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
hub Canonical reference
Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
Canonical reference. 100% of citing Pith papers cite this work as background.
44
Pith papers citing it
Background
100% of classified citations
abstract
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, we show that Shor's algorithm can be executed at cryptographically relevant scales with as few as 10,000 reconfigurable atomic qubits. Increasing the number of physical qubits improves time efficiency by enabling greater parallelism; under plausible assumptions, the runtime for discrete logarithms on the P-256 elliptic curve could be just a few days for a system with 26,000 physical qubits, while the runtime for factoring RSA-2048 integers is one to two orders of magnitude longer. Recent neutral-atom experiments have demonstrated universal fault-tolerant operations below the error-correction threshold, computation on arrays of hundreds of qubits, and trapping arrays with more than 6,000 highly coherent qubits. Although substantial engineering challenges remain, our theoretical analysis indicates that an appropriately designed neutral-atom architecture could support quantum computation at cryptographically relevant scales. More broadly, these results highlight the capability of neutral atoms for fault-tolerant quantum computing with wide-ranging scientific and technological applications.
hub tools
citation-role summary
background 8
citation-polarity summary
years
2026 44roles
background 8polarities
background 8representative citing papers
Classical codes plus SAT search yield no-go theorems limiting error detection in sub-8-qubit distillation and new minimal-qubit protocols for T-to-T (distances 4-5 on 10-11 qubits) and T-to-CCZ (distances 3-4 on 9-10 qubits).
LLM-driven evolutionary program synthesis discovers Generalized Superfast Encodings with exact distance 5 (and 6 on one instance) for molecular Hamiltonians, the first beyond distance 3.
A new LLM-guided search method called structured concept evolution discovers competitive lifted-product qLDPC code families including non-abelian constructions.
Presents planar open-boundary quantum LDPC codes with nearest-neighbor iSWAP-based syndrome extraction that outperform rotated surface codes in code-efficiency and logical error rate on finite instances like [[323,14,15]].
A parameterized quantum divide-and-conquer TSP solver achieves O*(1.865666…^n) query complexity via 4-subset partitioning and a new set-partition state preparation method, correcting prior work to show no quantum advantage below O*(2^n).
Experimental breakeven demonstration of a qLDPC code encoding 4 logical qubits in 18 physical qubits on trapped ions, with up to 9x lower logical error rate than prior superconducting implementations.
A single metasurface creates a tweezer array that traps 11,000 atoms, reported as the first platform to reach the 10,000-qubit resource scale.
Dual-species Na-Cs Rydberg array enables simultaneous non-destructive readout of multiple Pauli-Z stabilizers on four-qubit plaquettes using a single global pulse sequence after compensating geometric phase errors.
Real-time Krylov subspace methods are extended to Lindblad open quantum systems and demonstrated on a Kerr resonator for estimating the Liouvillian gap in cat qubit regimes.
An automated predecoder generator for arbitrary qLDPC codes cuts decoder utilization by up to 3963x and supports hardware scaling to tens or hundreds of thousands of logical qubits within power limits.
A graph neural network path planner and phase-aware Gerchberg-Saxton algorithm enable defect-free assembly of 10,000-atom arrays in under 6 ms, faster than typical atom loss times.
Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.
A symmetry-co-designed high-rate QEC architecture with parallel STAR injection on bivariate bicycle codes achieves ~5.5x space savings for TFIM and Fermi-Hubbard simulations versus surface-code STAR.
GAS-SCF uses Grover adaptive search and quantum arithmetic to mark and amplify improving Fock states, offering a theoretical quadratic speedup for SCF optimization, shown via classical simulations up to 26 qubits and analysis to 330 qubits.
Full extractors for HGP codes are built to enable logical processing via PBC without compilation overhead, with sizes 50-80% of base codes and low error rates in simulations.
Nonlinear cross-entropy benchmark and heavy-output classifier enable sample-efficient distinction between noisy quantum and classical spoofers for shallow-depth all-to-all random circuits.
Concatenating quantum Reed-Solomon codes over the gross code via Galois qudits reaches teraquop regime at uniform 10^{-3} noise with reduced overhead.
PIQC proposes a distributed FTQC architecture based on molecular quantum nodes with photonic integration, nuclear registers, loss-tolerant entanglement, and Floquetified qLDPC codes.
A forced-gap post-selection strategy using repeated Relay-BP decoder runs improves logical error rates by over 4x on 72- and 144-qubit bivariate bicycle codes at fixed post-selection rate.
Experimental demonstration of a multiplexing trapped-ion QPU using sample-and-hold circuits achieves motional heating rates below 1 phonon/s and expected gate errors below 10^{-4} for sampling intervals under 50 ms.
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance on 256-2048 bit instances.
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
Shor's algorithm generates and consumes magic resources in direct proportion to the difficulty of the underlying factoring problem.
citing papers explorer
-
Multi-Qubit Stabilizer Readout on a Dual-Species Rydberg Array
Dual-species Na-Cs Rydberg array enables simultaneous non-destructive readout of multiple Pauli-Z stabilizers on four-qubit plaquettes using a single global pulse sequence after compensating geometric phase errors.
-
Spatial overhead reduction for 2D hypergraph product codes
A qubit-reduction method for hypergraph product codes preserves dimension, distance, and fault-tolerance properties, producing smaller codes such as [[441,64,6]] from [[610,64,6]] with comparable noise performance and compatibility with logical gates.
-
Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
-
Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage
A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms and 15-hour runtime.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
-
Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
Heterogeneous quantum architectures with task-specific hardware and QEC encodings deliver up to 138x lower physical-qubit overhead than monolithic baselines for fault-tolerant algorithms, including RSA-2048 factoring at 190k-381k qubits.
-
Space-Time Tradeoffs of Pauli-Based Computation in Distributed qLDPC Architectures
Large qLDPC blocks in distributed quantum computing enable Pauli-based computation to run up to 10x faster than surface codes for optimization algorithms by using spare nodes to bypass serialization bottlenecks.
- Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays