A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation

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.

5 pages, 3 figures

References in corpus (6)

• Experimental demonstration of Shor's algorithm with quantum entanglement
• Demonstration of Shor's quantum factoring algorithm using photonic qubits
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Experimental implementation of an adiabatic quantum optimization algorithm
• Noise resistance of adiabatic quantum computation using random matrix theory
• Effect of Local Minima on Adiabatic Quantum Optimization

Cited by in corpus (2)

• Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
• Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum Computer