পদ্ধতির তুলনা করুন

	Shor's Algorithm	কোয়ান্টাম ফেজ এস্টিমেশন
ক্ষেত্র	কোয়ান্টাম কম্পিউটিং	কোয়ান্টাম কম্পিউটিং
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1994	1995
প্রবর্তক	Peter Shor	Alexei Kitaev
ধরন	Quantum algorithm	Subroutine algorithm
মৌলিক উৎস	Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134.	Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026.
অপর নাম	Shor factorization, quantum factorization	QPE, phase kickback
সম্পর্কিত	3	3
সারসংক্ষেপ	Shor's Algorithm is a polynomial-time quantum algorithm for factoring large integers and computing discrete logarithms, problems believed to be intractable on classical computers. Discovered by Peter Shor in 1994, it demonstrated the potential of quantum computers to break widely used cryptographic systems like RSA, marking a landmark in quantum computing theory.	Quantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling.