Algorithmu ya Shor
Algorithmu ya Shor ni algolithmu ya kompyuta ya quantum inayofanya kazi kwa muda wa polynomial kwa ajili ya kugawanya nambari kubwa na kuhesabu logariti za kipekee, matatizo ambayo huaminika kuwa magumu kwa kompyuta za kawaida. Iligunduliwa na Peter Shor mwaka 1994, ilionyesha uwezo wa kompyuta za quantum kuvunja mifumo ya usimbaji fiche inayotumiwa sana kama RSA, na kuashiria hatua muhimu katika nadharia ya kompyuta za quantum.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- 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: 10.1109/SFCS.1994.365700 ↗
- Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 41, 303–332. DOI: 10.1137/S0036144598347011 ↗
- Ekert, A. K., Raussendorf, R. (2014). A short introduction to quantum computing. Reviews of Modern Physics, 74, 339–373. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Shor's Algorithm for Integer Factorization and Discrete Logarithm. ScholarGate. https://scholargate.app/sw/quantum-computing/shors-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Algoriti ya GroverUkokotoaji wa Kwantamu↔ compare
- Usambazaji wa Funguho la Kiasi (BB84)Ukokotoaji wa Kwantamu↔ compare
- Ukadiriaji wa Awamu ya KiasiUkokotoaji wa Kwantamu↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →