- I-algorithm ye-quantum ebala izinombolo ngempumelelo, isongela ukuphepha ngokusekelwe ebunzimeni bokubala izinombolo, njenge-RSA.
- Ihlanganisa ukunciphisa kwe-classical kanye nokuguqulwa kwe-quantum Fourier ukuthola izikhathi kusetshenziswa i-superposition kanye ne-entanglement.
- Ukusetshenziswa kukhawulelwe yi-qubits ezizinzile kanye nokulungiswa kwamaphutha; kuqhuba i-cryptography yangemva kwe-quantum kanye noshintsho ekuphepheni.
I-algorithm kaShor imele ukusungula okusha emhlabeni we-quantum computing. Yasungulwa yisazi sezibalo uPeter Shor ngo-1994, le algorithm ishintshe ukuqonda kwethu kokufakwa kwezinombolo enkathini ye-quantum. Kusukela yadalwa, ikhono layo lokuhlakaza izinombolo eziphelele zibe yizinto zazo eziyinhloko liye laphonsela inselelo izinhlelo zamanje ze-cryptographic , njenge-RSA, okwathi amashumi eminyaka zabhekwa njengeziphephile ekuhlaselweni okuvamile. Kodwa-ke, amathuba okusetshenziswa kwayo okusebenzayo aphakamisa imibuzo eminingi mayelana nokusebenza kwayo, izinhlelo zokusebenza, kanye nemikhawulo.
Kulesi sihloko, sizohlola ngokujulile ukuthi iyini i-algorithm kaShor, ukuthi isebenza kanjani, izinhlelo zayo ezingaba khona, kanye nezinselele ezihambisana nokusetshenziswa kwayo. Uzofunda hhayi nje kuphela izici zobuchwepheshe ezingemuva kwalokhu kuthuthuka kodwa futhi nomthelela wayo ongaba khona ezindaweni ezifana nokuphepha kwe-cyber kanye ne-cryptography.
Iyini i-Shor's Algorithm?
I-algorithm kaShor iyinqubo ye-quantum eyenzelwe ngqo ukuhlanganisa izinombolo eziphelele ngendlela ephumelelayo zibe yi-prime factor yazo . Lokhu kwenza kube yi-algorithm ebalulekile ekubalweni kwe-quantum, njengoba ibhekana nenkinga, kumakhompyutha akudala, ebhekwa njengengenakulungiswa ngamanani amakhulu ngenxa yemvelo yawo yokuphuma.
Ukubaluleka kwe-algorithm kusekusetshenzisweni kwayo kwezakhiwo ezihlukile ze -quantum mechanics , njenge -superposition kanye ne -entanglement , ukuxazulula imisebenzi ebingenakwenzeka ngamakhompyutha avamile. Isibonelo, ngenkathi ukulinganisa inani elikhulu kungathatha iminyaka kukhompyutha evamile, le algorithm, uma isebenza kukhompyutha ye-quantum eklanywe kahle, inamandla okukwenza ngemizuzwana.
Ukuthuthukiswa kwe-algorithm kwaba yingqophamlando hhayi nje kuphela kwi-quantum computing kodwa futhi nakwi-cryptography. Izinhlelo zamanje zokubethela , njenge-RSA, zithembele ebunzimeni bokuhlela ukuze ziqinisekise ukuphepha kokuthengiselana kwedijithali. Njengoba i-algorithm kaShor isebenza, isizathu sokuba khona kwalezi zinhlelo siyasongelwa.
Isebenza kanjani i-Shor's Algorithm?
Ukusebenza kwe-algorithm kaShor kungahlukaniswa ngezigaba ezimbili eziyinhloko :
- Ukuncishiswa kwakudala: Kulesi sigaba sokuqala, inkinga yokufaka inombolo N Kuncishiswe enkingeni yokuthola isikhathi somsebenzi othize, owenziwa ngu izindlela zakudala ikhompuyutha.
- Ukuguqulwa kwe-Quantum Fourier: Yilapho i-quantum computing iqala khona ukudlala. Lesi sinyathelo sisebenzisa i-quantum Fourier transform (QFT) ukuthola isikhathi somsebenzi oshiwo ngenhla. Lesi sikhathi sibe sesihunyushwa sibe yizici eziyinhloko ze N usebenzisa izindlela zakudala zezibalo.
Impumelelo ye-algorithm isekelwe kakhulu eqinisweni lokuthi amakhompyutha e-quantum angacubungula inani elikhulu lezimo ngasikhathi sinye ngenxa ye -quantum superposition . Lokhu kuvumela ukuhlolwa kwezixazululo eziningi ezingaba khona ngasikhathi sinye, ngaleyo ndlela kufezwe ukusebenza kahle okudlula kude noma iyiphi indlela yakudala.
Kodwa-ke, ukusetshenziswa okusebenzayo kubhekene nezinselele ezinkulu , njengesidingo sama-qubit azinzile futhi anembile kakhulu. Isibonelo, ukuze kufakwe inombolo engu-1024-bit kusetshenziswa le algorithm, kuzodingeka izinkulungwane zama-qubit angenamaphutha, into engenakwenzeka okwamanje ngobuchwepheshe be-quantum bamanje.
Izicelo Eziyinhloko ze-Shor's Algorithm
Umthelela we-algorithm ye-Shor udlula umbono, unyakazisa izisekelo zezindawo ezimbalwa zobuchwepheshe. Ezinye zezinhlelo zokusebenza zayo eziphawuleka kakhulu zifaka:
- I-Cryptography: Mhlawumbe isicelo esaziwa kakhulu nesixoxisana ngaso kakhulu. Amasistimu wokubethela njenge-RSA, asekela ukuvikeleka kwemisebenzi yasebhange, ama-imeyili nokunye ukuxhumana, angase aphelelwe yisikhathi uma i-algorithm ye-Shor isetshenziswa kumakhompyutha e-quantum asebenza kahle.
- Ukuthuthukisa ku-Artificial Intelligence: Nakuba kungeyona inhloso yayo yasekuqaleni, i-algorithm ingashintshwa ukuze kubhekwane nezinkinga zokuthuthukisa emikhakheni efana nokuhlelwa kwezinto, ukuhlela, nokufunda komshini.
- Ukuxazulula izinkinga zezibalo: Ngokukwazi ukucabangela izinombolo ezinkulu, i-algorithm ingasiza emisebenzini yezibalo ethuthukisiwe kanye namathiyori ahlobene.
Imikhawulo Yamanje kanye Nezinselele Zezobuchwepheshe
Naphezu kwamandla ayo, i-algorithm inemikhawulo eminingana evimbela ukuqaliswa kwayo ngokushesha:
- Izidingo zezingxenyekazi zekhompuyutha: Ikhompyutha ye-quantum ekwazi ukusebenzisa i-algorithm ingadinga izinkulungwane zama-qubits azinzile namazinga amaphutha aphansi kakhulu. Njengamanje, amakhompuyutha e-quantum atholakalayo anamakhono alinganiselwe.
- Izinselelo ekulungiseni iziphazamisi: Ukusebenza kwe-Quantum kuthambekele ekubeni namaphutha ngenxa yokuphazanyiswa kwemvelo kanye nokungahlangani kwe-quantum. Lokhu kwenza kube nzima ukwenza ngokunembile ama-algorithms ayinkimbinkimbi njenge-Shor's.
- Ukusebenza kahle okusebenzayo: Nakuba i-algorithm isebenza kahle ngokwethiyori, kuze kube manje isetshenziswe kuphela ukuhlanganisa izinombolo ezincane, njenge-21, amasistimu we-quantum wokuhlola.
Umthelela Ekuvikelekeni Kwekhompyutha
Izindlela zesimanje ze-cryptographic, njenge-RSA kanye ne-ECC, zithembele enkingeni yezinkinga ze-factorization ukuqinisekisa ukuphepha kwazo. Kodwa-ke, i-algorithm kaShor ibuza ukuthi ukusebenza kwazo kwesikhathi eside kungabazeka. Ngakho-ke, abacwaningi bathuthukisa ezinye izindlela ezifana ne -post-quantum cryptography , esekelwe ezinkingeni zezibalo ezimelana nokuhlaselwa kwe-quantum.
Njengoba kunikezwe lezi zingozi ezingaba khona, kubalulekile ukuthi izikhungo zezezimali, zikahulumeni kanye nezobuchwepheshe zicabangele ukushintshela ezinhlelweni eziqinile ezingabhekana nosongo lwe-quantum.
Naphezu kwezinselele zamanje, inqubekelaphambili ku-quantum computing ibonisa ukuthi i-algorithm ye-Shor ingaba nezinhlelo zokusebenza ezingokoqobo phakathi namashumi ambalwa eminyaka alandelayo. Izinkampani nezikhungo zitshala izinsiza ezibalulekile ekuthuthukisweni kobuchwepheshe be-quantum, okungagcini nje ngokusheshisa ukuqaliswa kwe-algorithm, kodwa futhi kuvula umnyango wezinto ezintsha nezinhlelo zokusebenza.
Ngaphandle komthelela wayo ekubhalweni kwemfihlo nokuvikeleka kwekhompuyutha, i-algorithm ye-Shor ibonisa amandla ekhompuyutha ye-quantum ukubhekana nezinkinga ngaphambilini ebezibonakala zingenakuxazululeka. Imele isinyathelo esikhulu sekusasa lobuchwepheshe, kodwa futhi isikhumbuza ukuthi ngentuthuko enkulu iza nemithwalo yemfanelo emikhulu.
