Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Algorithme de Grover× | Distribution quantique de clés (BB84)× | |
|---|---|---|
| Domaine | Informatique quantique | Informatique quantique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1996 | 1984 |
| Auteur d'origine≠ | Lov Grover | Charles Bennett and Gilles Brassard |
| Type≠ | Quantum algorithm | Cryptographic protocol |
| Source fondatrice≠ | 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 ↗ | Bennett, C. H., Brassard, G. (1984). Quantum cryptography: public key distribution and coin tossing. Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing, 175–179. link ↗ |
| Alias | quantum search, amplitude amplification | BB84, quantum cryptography |
| Apparentées≠ | 3 | 2 |
| Résumé≠ | 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 Key Distribution (QKD) BB84 is a cryptographic protocol allowing two parties to establish a shared secret key using quantum mechanics. Proposed by Bennett and Brassard in 1984, BB84 provides information-theoretic security: an eavesdropper's presence is guaranteed to be detected, and the secret key is provably secure against unlimited computational power. |
| ScholarGateJeu de données ↗ |
|
|