评论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”
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 个月。没有做立场标注,所以只写“被提及”。
“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”
“There was a paper in 2008 claiming that adiabatic quantum computers could factor with a quantum speed up. http://arxiv.org/abs/0808.1935”