Comparar métodos

	Algoritmo de Grover	Monte Carlo Quântico	Estimativa de Fase Quântica	Algoritmo de Shor
Área	Computação quântica	Computação quântica	Computação quântica	Computação quântica
Família	Machine learning	Machine learning	Machine learning	Machine learning
Ano de origem	1996	1953	1995	1994
Autor original	Lov Grover	Nicholas Metropolis and colleagues	Alexei Kitaev	Peter Shor
Tipo	Quantum algorithm	Monte Carlo simulation	Subroutine algorithm	Quantum algorithm
Fonte seminal	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.	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.
Outros nomes	quantum search, amplitude amplification	QMC, variational Monte Carlo, diffusion Monte Carlo	QPE, phase kickback	Shor factorization, quantum factorization
Relacionados	3	3	3	3
Resumo	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.	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.