Shor’s quantum factoring algorithm (Shor’s algorithm) can solve factorization problem of large integers by using a fully-operational quantum computer with the complexity of polynomial-time level, thereby cracking a series of encryption algorithms (such as Rivest-Shamir-Adleman encryption algorithm, and Diffie-Hellman key exchange protocol) whose security is guaranteed by factorizing large integers, which is a difficult problem. We are currently in a noisy intermediate-scale quantum era, which means that we can only operate on quantum computers with a limited number of qubits and we have to take care of the effects of quantum noise. Quantum states on a quantum computer are prone to quantum noise caused by low-fidelity gates or interactions between qubits and the environment, which results in inaccurate measurements. We study the influence of quantum noise on Shor’s algorithm through 3 typical quantum noise channels: the depolarizing channel, the state preparation and measurement channel, and the thermal relaxation channel. We successfully simulate the factorization of the numbers 15, 21, and 35 into their corresponding prime factors by using the quantum circuit we have constructed on a classical computer. Then we simulate a running quantum circuit of Shor’s algorithm in a noisy environment with different level of noise for a certain type of noise channel and present numerical results. We can obtain precise measurements by calculating the state vector prior to measurement, instead of simulating and measuring expending much time, which contributes to higher efficiency. Each experiment is repeated 1000 times to reduce discrepancy. Our research indicates that Shor’s algorithm is easily affected by quantum noise. Successful rate of Shor’s algorithm decreases exponentially with the increase of noise level in the depolarizing channel, where the successful rate is an indicator we propose in this research to quantify the influence of noise on Shor’s algorithm, meanwhile the noise in the state preparation and measurement channel and the thermal relaxation channel can linearly affect the successful rate of Shor’s algorithm. There are <inline-formula><tex-math id="M1">\begin{document}$O(n^4) $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="5-20231414_M1.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="5-20231414_M1.png"/></alternatives></inline-formula> quantum gates in the circuit, each of which is disrupted by noise in depolarizing channel during running the circuit, meanwhile there are only <i>O</i>(<i>n</i>) interruptions caused by noise in state preparation and measurement channel since we repeat the measurements only <i>O</i>(<i>n</i>) times in the circuit where <i>n</i> is the number of bits of the integer about to be factored. Linear relationship in thermal relaxation channel is mainly due to the large gap between quantum gate time and relaxation time even if each gate in the circuit is disrupted by noise in thermal relaxation channel such as depolarizing channel. The present research results can be used for correcting the subsequent errors, improving Shor’s algorithm, and providing guidance for the fidelity required in engineering implementation of Shor’s algorithm.
Read full abstract