Vertaile menetelmiä

	Groverin algoritmi	Kvanttifaseestimaatio	Shorin algoritmi
Tieteenala	Kvanttilaskenta	Kvanttilaskenta	Kvanttilaskenta
Menetelmäperhe	Machine learning	Machine learning	Machine learning
Syntyvuosi	1996	1995	1994
Kehittäjä	Lov Grover	Alexei Kitaev	Peter Shor
Tyyppi	Quantum algorithm	Subroutine algorithm	Quantum algorithm
Alkuperäislähde	Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), 212–219.	Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026.	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.
Rinnakkaisnimet	quantum search, amplitude amplification	QPE, phase kickback	Shor factorization, quantum factorization
Liittyvät	3	3	3
Tiivistelmä	Grover's Algorithm is a quantum algorithm for searching an unsorted database, offering a quadratic speedup over classical linear search. Proposed by Lov Grover in 1996, it exploits quantum superposition and amplitude amplification to find a target item among N items in O(√N) queries, compared to the classical O(N) requirement.	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.	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.