本論文針對分散式秀爾演算法的模擬與分析進行了研究。首先，在緒論中， 我們介紹了量子演算法的演進，旨在提供對該領域的背景和相關研究的概述。 其次，第二章介紹了傳統的秀爾演算法，分析了其運作原理和應用領域。然 後，第三章介紹了如何達成分散式秀爾演算法。最後，我們在第四章中分別使 用前面介紹的量子演算法去實際分解數字 15 與 21，並對模擬實驗的結果並進行 了討論。這些模擬實驗旨在驗證分散式秀爾演算法的性能和效能。我們通過比 較兩種不同算法，評估了分散式秀爾演算法的優勢。最後，我們討論了未來可 能的研究方向，以進一步改進和擴展分散式秀爾演算法的應用。 ;This paper presents a study on the simulation and analysis of distributed Shor′s algorithm. The introduction provides an overview of the evolution of quantum algorithms, offering background information and related research in the field. The second chapter introduces the traditional Shor′s algorithm, introducing its operating principles and application domains. The third chapter focuses on the introduction of the distributed Shor′s algorithm, which is an algorithm based on distributed computing frameworks, offering higher efficiency and scalability. Lastly, in the fourth chapter, we report the results of simulation experiments and engage in discussions. These simulation experiments aim to validate the performance and effectiveness of the distributed Shor′s algorithm. By comparing algorithms, we evaluate the advantages and limitations of the distributed Shor′s algorithm. Finally, we discuss potential future research directions to further improve and expand the application of the distributed Shor′s algorithm.
