HackerPapers

arXiv:0808.1935quant-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

Abstract

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.

arXiv comments
5 pages, 3 figures
Journal reference
DOI
doi:10.1103/PhysRevLett.101.220405
Subjects
quant-phQuantum Physics

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from May 2013 to Aug 2015.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. Announcing the D-Wave 2X Quantum Computer 1 comment

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

      khedView on HNParent context

  2. Commercial quantum computer leaves PC in the dust 1 comment

    • 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

      mtrimpeView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.