Shor's algorithm is possible with as few as 10k reconfigurable atomic qubits
ipnon
13 points
4 comments
March 31, 2026
Related Discussions
Found 5 related stories in 88.5ms across 8,303 title embeddings via pgvector HNSW
- A more efficient implementation of Shor's algorithm signa11 · 14 pts · May 01, 2026 · 60% similar
- The JVG algorithm could break RSA-2048 encryption with fewer than 5k qubits giuliomagnifico · 12 pts · March 04, 2026 · 55% similar
- Quantum computing bombshells that are not April Fools Strilanc · 103 pts · April 02, 2026 · 46% similar
- A cryptography engineer's perspective on quantum computing timelines thadt · 412 pts · April 06, 2026 · 45% similar
- UpDown: Efficient Manycore based on Many Threading & Scalable Memory Parallelism matt_d · 12 pts · April 14, 2026 · 45% similar
Discussion Highlights (2 comments)
rramadass
> 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. Caltech Team Sets Record with 6,100-Qubit Array - https://www.caltech.edu/about/news/caltech-team-sets-record-...
da-bacon
Worth reading the comments over on scirate https://scirate.com/arxiv/2603.28627 for how to interpret some the claims.