Porównaj metody

	Algorytm Grovera	Kwantowy Monte Carlo	Estymacja Fazy Kwantowej
Dziedzina	Obliczenia kwantowe	Obliczenia kwantowe	Obliczenia kwantowe
Rodzina	Machine learning	Machine learning	Machine learning
Rok powstania	1996	1953	1995
Twórca	Lov Grover	Nicholas Metropolis and colleagues	Alexei Kitaev
Typ	Quantum algorithm	Monte Carlo simulation	Subroutine algorithm
Źródło pierwotne	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.	Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026.
Inne nazwy	quantum search, amplitude amplification	QMC, variational Monte Carlo, diffusion Monte Carlo	QPE, phase kickback
Pokrewne	3	3	3
Podsumowanie	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.	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.