Σύγκριση μεθόδων

	Αλγόριθμος του Grover	Αλγόριθμος του Shor
Πεδίο	Κβαντική Υπολογιστική	Κβαντική Υπολογιστική
Οικογένεια	Machine learning	Machine learning
Έτος προέλευσης	1996	1994
Δημιουργός	Lov Grover	Peter Shor
Τύπος	Quantum algorithm	Quantum algorithm
Θεμελιώδης πηγή	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.	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.
Εναλλακτικές ονομασίες	quantum search, amplitude amplification	Shor factorization, quantum factorization
Συναφείς	3	3
Σύνοψη	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.	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.