A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
classification
🪐 quant-ph
keywords
algorithmquantumadiabaticnumberqubitscapableexperimentalexperimentally
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.