按年被提到
20082013 · 1 次2026
物理与量子›量子计算·arXiv:0808.1935 · quant-ph

A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

Xinhua Peng, Zeyang Liao, Nanyang Xu, Gan Qin, Xianyi Zhou, Dieter Suter, Jiangfeng Du · 2008
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2013-05-13 · 最近 2015-08-21
2不同的人
2活跃月份
2讨论串
175被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations indicate that the running time grows only quadratically with the number of qubits.

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

HN 书评

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

“edit: Just to be clear, it does seem that adiabatic quantum computing can do factorization in quadratic time [1] http://arxiv.org/abs/0808.1935”

Commercial quantum computer leaves PC in the dust原评论 ↗
评论khed · 2015-08

“There was a paper in 2008 claiming that adiabatic quantum computers could factor with a quantum speed up. http://arxiv.org/abs/0808.1935”

Announcing the D-Wave 2X Quantum Computer原评论 ↗