Porovnať metódy

	Kvantová teleportácia	Shorov algoritmus
Odbor	Kvantové výpočty	Kvantové výpočty
Rodina	Machine learning	Machine learning
Rok vzniku	1993	1994
Tvorca	Charles Bennett and colleagues	Peter Shor
Typ	Communication protocol	Quantum algorithm
Pôvodný zdroj	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.
Ďalšie názvy	teleportation, entanglement-assisted communication	Shor factorization, quantum factorization
Príbuzné	2	3
Zhrnutie	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.