Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

Xinhua Peng, Zeyang Liao, Nanyang Xu, Gan Qin, Xianyi Zhou, Dieter Suter, and Jiangfeng Du
Phys. Rev. Lett. 101, 220405 – Published 26 November 2008

Abstract

We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor’s algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales polynomially with the problem size.

  • Figure
  • Figure
  • Figure
  • Received 10 August 2008

DOI:https://doi.org/10.1103/PhysRevLett.101.220405

©2008 American Physical Society

Authors & Affiliations

Xinhua Peng1, Zeyang Liao1, Nanyang Xu1, Gan Qin1, Xianyi Zhou1, Dieter Suter2, and Jiangfeng Du1,*

  • 1Hefei National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026, People’s Republic of China
  • 2Fakultät Physik, Technische Universität Dortmund, 44221 Dortmund, Germany

  • *djf@ustc.edu.cn

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 101, Iss. 22 — 28 November 2008

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×