Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Algoritmo de Grover× | Estimativa de Fase Quântica× | |
|---|---|---|
| Área | Computação quântica | Computação quântica |
| Família | Machine learning | Machine learning |
| Ano de origem≠ | 1996 | 1995 |
| Autor original≠ | Lov Grover | Alexei Kitaev |
| Tipo≠ | Quantum algorithm | Subroutine 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. DOI ↗ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ |
| Outros nomes | quantum search, amplitude amplification | QPE, phase kickback |
| Relacionados | 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 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. |
| ScholarGateConjunto de dados ↗ |
|
|