- I-algorithm ye-Shor ivumela izinombolo ezinkulu ukuthi zicutshungulwe, izinhlelo zamanje zokubethela ezisongelayo.
- I-Grover isheshisa ukusesha kudathabhethi engahlelekile isebenzisa ukukhulisa ububanzi.
- I-Ideal qubits ithembisa ukuxazulula izinkinga ezinzima ze-NP ezifana nomthengisi ohambayo ukuze aguqule ukusebenza kahle.
Eminyakeni eyishumi edlule, ama-algorithm e-quantum ashintshe kakhulu insimu yokubala, enikeza izixazululo ezazibonakala zingenakutholakala ngamakhompyutha akudala . Lawa ma-algorithms asebenzisa izakhiwo ezihlukile zama-qubits, njenge -superposition kanye ne -entanglement , ukuze enze izibalo eziyinkimbinkimbi ngempumelelo kakhulu kunezindlela zendabuko.
Kulesi sihloko, sizohlola imiqondo eyinhloko , izinhlelo zokusebenza, kanye nezinselele ezihlobene nama -algorithm e-quantum . Kusukela ku -algorithm edumile kaShor kuya ekuthuthukisweni kwamuva njengokusebenzisa i-qubit eyodwa ukuxazulula izinkinga eziyinkimbinkimbi kanye ne -algorithm ye-Quantum Echoes kaGoogle , sizohlola ukuthi la mathuluzi aguqula kanjani izindawo ezifana ne -cryptography , ukwenza ngcono , kanye nesayensi yedatha.
I-algorithm ye-Shor kanye nomthelela wayo ku-cryptography
I-algorithm kaShor mhlawumbe ingenye yama - algorithm e-quantum aziwa kakhulu ngenxa yekhono layo lokulinganisa izinombolo ezinkulu ngesikhathi se-polynomial. Lokhu kube yingozi enkulu ezinhlelweni zokubethela zamanje, njenge -RSA , ezithembele ebunzimeni bokulinganisa izinombolo ezinkulu ze-prime. Nakuba ikhompyutha yakudala ingathatha iminyaka ukuxazulula le nkinga, ikhompyutha ye-quantum esebenzisa i-algorithm kaShor ingakwenza ngemizuzwana embalwa.
Le algorithm isekelwe ezigabeni ezimbili eziyinhloko: isigaba sakudala sokunciphisa inkinga ye-factorization kuya ekutholeni isikhathi , kanye nesigaba se-quantum lapho kusetshenziswa khona ukuguqulwa kwe-quantum Fourier . Lesi sinyathelo sokugcina sibalulekile, njengoba sivumela ukuthola isikhathi somsebenzi ngesikhathi esisebenzayo . Kodwa-ke, ukusetshenziswa ngokomzimba kwe-algorithm kudinga ama-qubit azinzile kakhulu futhi anembile, into izinhlelo zamanje ze-quantum ezisasebenza kahle futhi yiziphi amaphrojekthi afana ne -QnodeOS asebenza kuzo.
Intuthuko yakamuva: Izinto eziyinhloko kanye nama-qubits afanelekile
Naphezu kwentuthuko yemfundiso ye-algorithm kaShor, ukusetshenziswa kwayo okusebenzayo kuye kwaba kulinganiselwe. Inani elikhulu kakhulu elifakwe le algorithm kukhompyutha ye-quantum kuze kube manje lingu -21 , ngenxa yemikhawulo yamanje yezobuchwepheshe. Kodwa-ke, lezi zinselele kulindeleke ukuthi zinqotshwe njengoba ama-qubit ethola ikhwalithi enkulu nokuzinza.
Izinkinga ezihlobene ne-algorithm ye-Shor
- Umkhawulo kumasistimu wakudala: Nakuba i-algorithm ye-Shor iguquguqukayo amakhompyutha we-quantum, izindlela ezifana I-Quadratic Sieve sebenza kahle kakhulu kumakhompuyutha endabuko.
- Izinselelo zobuchwepheshe: Ukuqaliswa kudinga qubits of ukuthembeka okuphezulu kanye nezinhlelo ezikwazi ukwenza izinguquko ezihlangene ngokunemba ngokweqile.
I-algorithm kaGrover kanye nokusesha kudathabhethi engahlelekile
Enye insika yokubala i-quantum yi -algorithm kaGrover , eyenzelwe ukusheshisa usesho kuma-database angahlelekile. Ngenkathi ikhompyutha yakudala ingadinga isikhathi esilingana nenani lokufakwa ku -database, uGrover uyakwazi ukunciphisa lokhu kube yimpande yesikwele yenani eliphelele lokufakwa, okumelela inzuzo enkulu.
Le algorithm isebenzisa amasu e-quantum njengokukhulisa i-amplitude ukwandisa amathuba okuthola umphumela ofiselekayo. Isibonelo, ukuthola ukhiye owodwa ofanele kwezinketho eziyi-100 kungadinga imizamo eyi-10 kuphela ngokwesilinganiso, uma kuqhathaniswa nemizamo efinyelela kweyi-100 ohlelweni lwakudala.
Ukusetshenziswa okusebenzayo kwale algorithm
- Ukuthuthukisa izinkinga eziphelele ze-NP ngokusesha okuphelele.
- Ukulungiswa okusheshayo izinkinga zokushayisana ezinhlelweni ze-cryptographic.
- Ukufinyelela okusebenzayo kumthamo omkhulu wedatha.
Naphezu kwezinzuzo zayo , i-algorithm kaGrover ayithathi indawo yezindlela zakudala kuzo zonke izinkambu, kodwa iyahambisana nemisebenzi ethile esebenzisa ikhono layo lokuphatha idatha eyinkimbinkimbi.
Ukuxazulula izinkinga ze-NP-hard nge-qubits
Indawo ethembisayo yokubala i-quantum ixazulula izinkinga ze-NP-hard njengenkinga yokuthengisa ehambayo (i-TSP) , efuna indlela emfushane phakathi kweqoqo lamadolobha. Endleleni yakamuva, abacwaningi bakhombisile ukuthi i-qubit efanelekile ingayisebenzisa kanjani le algorithm isebenzisa ukuzungeza ku-Bloch sphere, emelela amadolobha njengamaphuzu kuleyo sphere.
Nakuba ukulingisa kokuqala kubonise imiphumela ethembisayo emadolobheni afinyelela kwayisishiyagalolunye , izinselele zobuchwepheshe zamanje zikhawulela ukuqaliswa kwazo ezinkingeni ezinkulu. Ukulingana kwe-quantum okuhlobene nalezi zixazululo kungaguqula ukwenziwa ngcono kwezibalo kanye nokuthutha esikhathini esizayo esiseduze.
Ikusasa lama-algorithms we-quantum
I-Quantum computing isesigabeni sayo sokuqala, kodwa ukuthuthukiswa okuqhubekayo kwama -algorithms afana ne-Shor's ne-Grover's, kanye nezinhlelo zokusebenza ezintsha ezindaweni ezifana nobuhlakani bokwenziwa , i-computational biology , kanye ne- quantum internet , kukhomba ikusasa eliqhakazile. Isihluthulelo kuzoba ukunqoba imikhawulo yamanje yezobuchwepheshe, njengekhwalithi nokuzinza kwama-qubits, kanye nokuklama ihadiwe ekwazi ukusekela izidingo zala ma-algorithms athuthukile.
Kusukela ekubhaleni i-cryptography kuya ekwenzeni ngcono , lokho okwakubonakala kungenakwenzeka manje sekuseduze nathi ngenxa yentuthuko kuma -algorithms e-quantum . Nakuba kusenendlela ende okufanele siyihambe, akungabazeki ukuthi sibona ushintsho lwezobuchwepheshe oluzophawula ukuguquka emikhakheni eminingi yesayensi nezobuchwepheshe.
