Shallow Depth Factoring Based on Quantum Feasibility Labeling and Variational Quantum Search. (arXiv:2305.19542v1 [quant-ph])

Large integer factorization is a prominent research challenge, particularly
in the context of quantum computing. The classical computation of prime factors
for an integer entails exponential time complexity. Quantum computing offers
the potential for significantly faster computational processes compared to
classical processors. We proposed a new quantum algorithm, Shallow Depth
Factoring (SDF), to factor an integer. SDF consists of three steps. First, it
converts a factoring problem to an optimization problem without an objective
function. Then, we use a Quantum …

challenge complexity computation computational computing context factoring integer labeling large prime processes processors quantum quantum computing research search