Σύγκριση μεθόδων

	Κβαντική Διανομή Κλειδιού (BB84)	Κβαντική Τηλεμεταφορά	Αλγόριθμος του Shor
Πεδίο	Κβαντική Υπολογιστική	Κβαντική Υπολογιστική	Κβαντική Υπολογιστική
Οικογένεια	Machine learning	Machine learning	Machine learning
Έτος προέλευσης	1984	1993	1994
Δημιουργός	Charles Bennett and Gilles Brassard	Charles Bennett and colleagues	Peter Shor
Τύπος	Cryptographic protocol	Communication protocol	Quantum algorithm
Θεμελιώδης πηγή	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.	Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., Wootters, W. K. (1993). Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters, 70, 1895–1899.	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.
Εναλλακτικές ονομασίες	BB84, quantum cryptography	teleportation, entanglement-assisted communication	Shor factorization, quantum factorization
Συναφείς	2	2	3
Σύνοψη	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.	Quantum Teleportation is a protocol for transferring an unknown quantum state between distant parties using entanglement and classical communication. Discovered by Bennett et al. in 1993, teleportation violates no fundamental principles but demonstrates the power of entanglement: an unknown quantum state can be reconstructed at a distant location without ever being transmitted.	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.