Hybrid scheme for factorization: Factoring 551 using a 3-qubit NMR quantum adiabatic processor
Preprint
Abstract
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the factors of a given composite number. The main challenge in scaling it to larger numbers is the unavailability of large number of qubits. Here we propose a hybrid scheme that involves both classical and quantum computation, which reduces the number of qubits required for factorization. The classical part involves setting up and partially simplifying a set of bit-wise factoring equations and the quantum part involves solving these coupled equations using a quantum adiabatic process. We demonstrate the hybrid scheme by factoring 551 using a three qubit NMR quantum register.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Steering quantum dynamics via bang-bang control: Implementing optimal fixed-point quantum search algorithmPhysical Review A, 2016
- Realization of a scalable Shor algorithmScience, 2016
- Experimental Test of the Quantum No-Hiding TheoremPhysical Review Letters, 2011
- Demonstration of a Compiled Version of Shor’s Quantum Factoring Algorithm Using Photonic QubitsPhysical Review Letters, 2007
- Robustness of adiabatic quantum computationPhysical Review A, 2001
- Effective pure states for bulk quantum computationPhysical Review A, 1998