按年被提到
20212024 · 2 次2026
物理与量子›量子计算·arXiv:2103.13855 · quant-ph

Demonstration of Shor's factoring algorithm for N=21 on IBM quantum processors

Unathi Skosana, Mark Tame · 2021
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2024-03-11 · 最近 2025-09-01
2不同的人
2活跃月份
3讨论串
67被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous demonstration by Martín-López et al. in Nature Photonics 6, 773 (2012). We go beyond this work by using a configuration of approximate Toffoli gates with residual phase shifts, which preserves the functional correctness and allows us to achieve a complete factoring of N=21. We implemented the algorithm on IBM quantum processors using only 5 qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm's speedup in general. The techniques we employ may be useful in carrying out Shor's algorithm for larger integers, or other algorithms in systems with a limited number of noisy qubits.

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

HN 书评

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

“The threat estimate for a quantum computer that breaks cryptography shall be based on currently available data and the understanding that only the Schor algorithm is known to provide exponential speedup for factorisation. Let’s give IBM credit for attempting to factor in the number 35 in 2022, although they failed there [1]. Before that, the successful f…”

Google's threat model for post-quantum cryptography原评论 ↗
评论JanisErdmanis · 2024-03

“It is! Taking into account that only the Schor algorithm is proven to be exponentially faster in factorising numbers and looking into current progress on using it, the threat for RSA 2048 will become real in ridiculous 2^2048 years. This can be estimated by taking three events in factorisation: 2002: factorisation of 15 [1] 2012: factorisation of 21 [2]…”

Post-quantum cryptography is too damn big原评论 ↗
评论patrakov · 2025-09

“The article, if examined by a non-specialist like me, seems to contain an answer to this concern at the end: > There are papers that claim to have factored 21 with a quantum computer. For example, here’s one from 2021 [1]. But, as far as I know, all such experiments are guilty of using optimizations that imply the code generating the circuit had access t…”

Why haven't quantum computers factored 21 yet?原评论 ↗