השוואת שיטות

	אלגוריתם גרובר	מונטה קרלו קוונטי	אלגוריתם שור
תחום	מחשוב קוונטי	מחשוב קוונטי	מחשוב קוונטי
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1996	1953	1994
הוגה השיטה	Lov Grover	Nicholas Metropolis and colleagues	Peter Shor
סוג	Quantum algorithm	Monte Carlo simulation	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.	Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092.	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	QMC, variational Monte Carlo, diffusion Monte Carlo	Shor factorization, quantum factorization
קשורות	3	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.	Quantum Monte Carlo (QMC) is a stochastic computational method for computing ground state properties of quantum many-body systems. Combining classical Monte Carlo sampling with quantum mechanics, QMC approaches are among the most accurate methods available for electronic structure and condensed matter physics, achieving sub-percent accuracy for many systems.	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.