Large　integer　factorization　is　one　of　the　basic　ways　to　crack　RSA　encryption　algorithm,　however,　it　is　difficult　for　classical　computers　to　solve　the　large　integer　factorization　problem　effectively　due　to　the　large　amount　of　computation.　Shor＇s　algorithm　is　a　quantum　algorithm　that　can　efficiently　and　rapidly　factorize　large　integers.　However,　Shor＇s　algorithm　requires　modular　exponentiation,　which　makes　circuit　design　extremely　complex　and　time　complexity　high.　To　solve　this　problem,　a　new　heuristic　algorithm　was　proposed　based　on　the　inspiration　of　classical　computing　by　using　the　parallelism　of　quantum　computing.　The　relevant　Oracle　was　designed　to　calculate　the　product　of　two　odd　superposition　states　a　and　b,　and　then　the　negative　phase　of　the　superposition　state　product　was　added　to　the　Fourier　basis　of　the　large　integer　N.　When　the　result　was　0,　a　prime　factor　p　satisfying　pq　=　N　was　extracted　by　using　multiple　control　gates.　The　proposed　algorithm　only　needed　2n　qubits　at　least,　and　its　time　complexity　reached　exponential　acceleration.　In　addition,　the　algorithm　was　implemented　on　the　framework　of　QISKit,　which　proves　the　feasibility　and　generality　of　the　algorithm.　©　2023　Beijing　University　of　Technology.　All　rights　reserved.