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 Shor× | |
|---|---|---|
| Domaine | Informatique quantique | Informatique quantique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1995 | 1994 |
| Auteur d'origine≠ | Alexei Kitaev | Peter Shor |
| Type≠ | Subroutine algorithm | Quantum algorithm |
| Source fondatrice≠ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ | 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. DOI ↗ |
| Alias | QPE, phase kickback | Shor factorization, quantum factorization |
| 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. | 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. |
| ScholarGateJeu de données ↗ |
|
|