Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Algoritmo di Grover× | Quantum Key Distribution (BB84)× | |
|---|---|---|
| Campo | Calcolo quantistico | Calcolo quantistico |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 1996 | 1984 |
| Ideatore≠ | Lov Grover | Charles Bennett and Gilles Brassard |
| Tipo≠ | Quantum algorithm | Cryptographic protocol |
| Fonte seminale≠ | 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 |
| Correlati≠ | 3 | 2 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|