Sammenlign metoder

	Shor's Algoritme	Grover's Algoritme	Kvantefaseestimering
Fagområde	Kvanteberegning	Kvanteberegning	Kvanteberegning
Familie	Machine learning	Machine learning	Machine learning
Oprindelsesår	1994	1996	1995
Ophavsperson	Peter Shor	Lov Grover	Alexei Kitaev
Type	Quantum algorithm	Quantum algorithm	Subroutine algorithm
Oprindelig kilde	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.	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.
Aliasser	Shor factorization, quantum factorization	quantum search, amplitude amplification	QPE, phase kickback
Relaterede	3	3	3
Resumé	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.	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.