Semiprime Factorization Algorithm For Quantum Computers Enabling Parallelization

A quantum computer is considered to be superior to a classical computer at performing certain computations. This study proposes an algorithm in which a quantum computer assists a classical computer to perform a significant amount of computations quickly. This gives rise to a computer architecture where the capabilities of a classical and quantum computer are harnessed to solve difficult problems. This paper gives an iterative approach for extracting information from a quantum computer. The proposed algorithm applies core concepts from Deutsch Jozsa algorithm to solve problems on semiprime factorization in polynomial time. It also shows how quantum computers can significantly speed up a specific form of the ordered search problem.