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.
citation dossier
Shor’s algorithm is possible with as few as 10,000 reconfigurable atomic qubits
17Pith papers citing it
17reference links
quant-phtop field · 16 papers
UNVERDICTEDtop verdict bucket · 17 papers
why this work matters in Pith
Pith has found this work in 17 reviewed papers. Its strongest current cluster is quant-ph (16 papers). The largest review-status bucket among citing papers is UNVERDICTED (17 papers). For highly cited works, this page shows a dossier first and a bounded explorer second; it never tries to render every citing paper at once.
years
2026 17verdicts
UNVERDICTED 17representative citing papers
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.
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.
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.
Experimental demonstration of an active 1:4 CV-QKD quantum network in the finite-size regime with adaptable protocols achieving 0.19 bits per channel use over 11 km channels.
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.
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.
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.
QLLVM delivers an LLVM-based end-to-end co-compiler that unifies classical HPC and quantum programs into one executable, with a three-stage quantum path via MLIR and QIR that reduces circuit depth and gate counts on MQTBench versus prior compilers.
A multi-atom Rydberg gate with N ancillae enables N-fold photon collection for fast neutral-atom measurement, achieving infidelity below 10^{-3} in 6 μs with N=5 in Cs-Rb simulations.
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.
WPGS algorithm enforces inter-frame phase continuity in holographic tweezers to suppress refresh-induced atom loss and speed up updates for large neutral-atom arrays.
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.
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
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.
-
Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding
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.
-
An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays
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.
-
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.
-
The true cost of factoring: Linking magic and number-theoretic complexity in Shor's algorithm
Shor's algorithm generates and consumes magic resources in direct proportion to the difficulty of the underlying factoring problem.
-
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.
-
Adaptable Continuous Variable Quantum Network with Finite Size Security
Experimental demonstration of an active 1:4 CV-QKD quantum network in the finite-size regime with adaptable protocols achieving 0.19 bits per channel use over 11 km channels.
-
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.
-
GreenPeas: Unlocking Adaptive Quantum Error Correction with Just-in-Time Decoding Hypergraphs
GreenPeas delivers a just-in-time GPU compiler for decoding hypergraphs that achieves >10x speedup on surface and bivariate bicycle codes, unlocking circuit-level decoding for adaptive quantum error correction.
-
Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
A family of quantum LDPC codes with encoding rates exceeding 1/2 achieves logical error rates of 10^{-13} per round on atom arrays under 0.1% circuit noise using hierarchical decoding.
-
QLLVM: A Scalable Quantum-Classical Co-Compilation Framework based on LLVM
QLLVM delivers an LLVM-based end-to-end co-compiler that unifies classical HPC and quantum programs into one executable, with a three-stage quantum path via MLIR and QIR that reduces circuit depth and gate counts on MQTBench versus prior compilers.
-
Fast measurement of neutral atoms with a multi-atom gate
A multi-atom Rydberg gate with N ancillae enables N-fold photon collection for fast neutral-atom measurement, achieving infidelity below 10^{-3} in 6 μs with N=5 in Cs-Rb simulations.
-
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.
-
Phase-Stable Hologram Updates for Large-Scale Neutral-Atom Array Reconfiguration
WPGS algorithm enforces inter-frame phase continuity in holographic tweezers to suppress refresh-induced atom loss and speed up updates for large neutral-atom arrays.
-
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.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.