Quantum computers are considered to have more computing power than classical computers, although this has not been strictly proved. It is well known that quantum computing can achieve exponential acceleration for specific problems, such as Deutsch-Jozsa's algorithm[1]}, Simon's algorithm[2]}, and the most famous Shor's algorithm[3]}, [4]}. Shor's algorithm is essentially a quantum period-finding algorithm (QPA)[3]}, [4]}, [7]}. It can obtain the period of any \(m\) -bit function in \(O\left(\log m\right)\)  oracle operations, which is impossible for any known classical algorithm. The special nature of QPA is exactly what we need. In fact, assume we have several functions with positive integer periods. If the outputs of these functions are connected together to form a new function, the period of the new function is exactly the LCM of all small periods. This allows us to use QPA to bypass the prime factorization and directly complete the LCM computation.
