Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Estimation de phase quantique× | Algorithme de Grover× | |
|---|---|---|
| Domaine | Informatique quantique | Informatique quantique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1995 | 1996 |
| Auteur d'origine≠ | Alexei Kitaev | Lov Grover |
| Type≠ | Subroutine algorithm | Quantum algorithm |
| Source fondatrice≠ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ | 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 ↗ |
| Alias | QPE, phase kickback | quantum search, amplitude amplification |
| Apparentées | 3 | 3 |
| Résumé≠ | 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. | 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. |
| ScholarGateJeu de données ↗ |
|
|