The　integer　factorization　problem　is　a　major　challenge　in　the　field　of　computer　science,　and　Shor’s　algorithm　provides　a　promising　solution　for　this　problem.　However,　Shor’s　algorithm　involves　complex　modular　exponentiation　computation,　which　leads　to　the　construction　of　complicated　quantum　circuits.　Moreover,　the　precision　of　continued　fraction　computations　in　Shor’s　algorithm　is　influenced　by　the　number　of　qubits,　making　it　difficult　to　implement　the　algorithm　on　Noisy　Intermediate-Scale　Quantum　(NISQ)　computers.　To　address　these　issues,　this　paper　proposes　variational　quantum　computation　integer　factorization　(VQCIF)　algorithm　based　on　variational　quantum　algorithm　(VQA).　Inspired　by　classical　computing,　this　algorithm　utilizes　the　parallelism　of　quantum　computing　to　calculate　the　product　of　parameterized　quantum　states.　Subsequently,　the　quantum　multi-control　gate　is　used　to　map　the　product　satisfying　pq=　N　onto　an　auxiliary　qubit.　Then　the　variational　quantum　circuit　is　adjusted　by　the　optimizer,　and　it　is　possible　to　obtain　a　prime　factor　of　the　integer　N　with　a　high　probability.　While　maintaining　generality,　VQCIF　has　a　simple　quantum　circuit　structure　and　requires　only　2　n+　1　qubits.　Furthermore,　the　time　complexity　is　exponentially　accelerated.　VQCIF　algorithm　is　implemented　using　the　Qiskit　framework,　and　tests　are　conducted　on　factorization　instances　to　demonstrate　its　feasibility.　©　2023,　The　Author(s),　under　exclusive　licence　to　Springer　Science+Business　Media,　LLC,　part　of　Springer　Nature.