Seeking feedback on a new quantum algorithm

This work describes a new quantum algorithm for polynomial-time semiprime factorization. The algorithm reduces the semiprime factorization problem to a decision problem where a quantum computer helps to determine if a function is constant and this enables us to rapidly narrow down a specific range of numbers until a unique sharing a common divisior is found. Then the euclidean algorithm is used to obtain the prime factors. The paper includes the algorithm, complexity analysis, and discussion of its performance relative to existing approaches. I'm interested in feedback on the algorithm, assumptions, correctness, and complexity analysis. submitted by /u/QuantumExplorerV [link] [comments]