Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Алгоритм Шора× | Алгоритм Гровера× | Квантовий розподіл ключів (BB84)× | |
|---|---|---|---|
| Галузь | Квантові обчислення | Квантові обчислення | Квантові обчислення |
| Родина | Machine learning | Machine learning | Machine learning |
| Рік появи≠ | 1994 | 1996 | 1984 |
| Автор методу≠ | Peter Shor | Lov Grover | Charles Bennett and Gilles Brassard |
| Тип≠ | Quantum algorithm | Quantum algorithm | Cryptographic protocol |
| Основоположне джерело≠ | 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 ↗ | 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 ↗ |
| Інші назви | Shor factorization, quantum factorization | quantum search, amplitude amplification | BB84, quantum cryptography |
| Пов'язані≠ | 3 | 3 | 2 |
| Підсумок≠ | 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. | 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. |
| ScholarGateНабір даних ↗ |
|
|
|