按年被提到
20262026 · 6 次2026
物理与量子›量子计算·arXiv:2603.28627 · quant-ph

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

Madelyn Cain, Qian Xu, Robbie King, Lewis R. B. Picard, Harry Levine, Manuel Endres, John Preskill, Hsin-Yuan Huang, Dolev Bluvstein · 2026
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 6 人首次 2026-03-31 · 最近 2026-04-06
6不同的人
2活跃月份
6讨论串
12被引(OpenAlex)
arXiv 摘要(候选层不写导读)

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.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论spr-alex · 2026-03

“Beware the Ides of march: this is 1 of 2 cryptographic doom papers that was released this week. This google paper with Babbush, Gidney, Boneh is authoritative. And we also have another with Preskill and Hsin-Yuan Huang (widely cited for classical shadows among other quantum work) among others: https://arxiv.org/pdf/2603.28627 "Here, by leveraging advance…”

Safeguarding cryptocurrency by disclosing quantum vulnerabilities responsibly原评论 ↗
评论chrysander · 2026-03

“Their new paper https://arxiv.org/pdf/2603.28627 reduces the number of required qubits to break various cryptography algorithms by more than an order of magnitude.”

Caltech quantum startup Oratomic launches with achieving scaling breakthrough原评论 ↗
评论sigmoid10 · 2026-04

“If they're going public I imagine they already sell some kind of QC chips. But, like, who buys them? Yesterday there was a new paper [1] that shows how Shor's algorithm could break realistic encryptions with as little as 10,000 qubits (instead of millions), but as far as I know quantum hardware is still orders of magnitude below even that target. So how b…”

Quantum computing bombshells that are not April Fools原评论 ↗
评论upofadown · 2026-04

“So this is the exciting paper: * https://arxiv.org/pdf/2603.28627 The new thing here seems to be the use of the neutral atom technique. Supposedly we are up to 96 entangled qubits for a second or two based on neutral atoms. Shouldn't that be enough capability to factor 15 using Shor's?”

A Cryptography Engineer's Perspective on Quantum Computing Timelines原评论 ↗
被提交为 story · 2 次