- 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.
Kule minyaka eyishumi edlule, i- ama-algorithms we-quantum Bawuguqule umkhakha wekhompyutha, banikeza izixazululo ebezibonakala zingafinyeleleki ngaphambilini amakhompyutha classical. Lawa ma-algorithms asebenzisa izici ezihlukile ze-qubits, njenge- bhangqa futhi i ukubanjwa, ukwenza izibalo eziyinkimbinkimbi ngendlela ephumelela kakhulu. ephumelelayo kunezindlela zendabuko.
Kulesi sihloko sizohlola imiqondo esemqoka, izinhlelo zokusebenza nezinselele ezihlobene ne ama-algorithms we-quantum. Kusuka kwabadumile I-algorithm ye-Shor up Intuthuko yakamuva njengokusebenzisa i-qubit eyodwa ukuxazulula izinkinga eziyinkimbinkimbi kanye I-algorithm ye-Quantum Echoes kaGoogleSizohlola ukuthi la mathuluzi aguqula kanjani izindawo ezifana nokuthi i-cryptography, lo nokwenza kahle futhi i isayensi yedatha.
I-algorithm ye-Shor kanye nomthelela wayo ku-cryptography
El I-algorithm ye-Shor mhlawumbe enye ye ama-algorithms we-quantum baziwa kakhulu ngekhono labo lokuqonda izinto ama-grand amakhulu ngesikhathi se-polynomial. Lokhu kuxhaphaza kudale izinsongo ezinkulu ezinhlelweni zamanje zokubethela, njenge RSA, okuncike ebunzimeni bokufaka izinombolo ezinkulu eziyinhloko. Ngenkathi a ikhompyutha yakudala Kungathatha iminyaka ukuxazulula le nkinga, ikhompyutha ye-quantum Ngokusebenzisa i-algorithm kaShor, ungakufeza lokhu ngemizuzwana embalwa.
Le algorithm isekelwe ezigabeni ezimbili eziyinhloko: isigaba sakudala sokunciphisa inkinga ye-factoring ekufuneni a inkathi kanye nesiteji se-quantum lapho i ukuguqulwa kwe-quantum Fourier. Lesi sinyathelo sokugcina sibalulekile, njengoba sisivumela ukuthi sithole isikhathi somsebenzi ngesikhathi. ephumelelayo. Kodwa-ke, ukuqaliswa ngokomzimba kwe-algorithm kudinga ama-qubits amancane kakhulu. esitebeleni futhi kunembile, into izinhlelo zamanje ze-quantum ezisayenza ibe ngcono futhi lapho amaphrojekthi afana I-QnodeOS Ziyasebenza.
Intuthuko yakamuva: Izinto eziyinhloko kanye nama-qubits afanelekile
Ngaphandle kwe- intuthuko yethiyori ye-algorithm ye-Shor, ukusetshenziswa kwayo okungokoqobo kunqunyelwe. Inombolo enkulu kakhulu eyenziwe kusetshenziswa le-algorithm ku-a ikhompyutha yequantum kuze kube manje 21, ngenxa yemikhawulo yamanje yezobuchwepheshe. Kodwa-ke, lezi zinselelo kulindeleke ukuthi zinqotshwe njengoba ama-qubits ephumelela kakhulu ikhwalithi ephezulu kanye 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 ye i-quantum computing yiyona I-algorithm kaGrover, eklanyelwe ukusheshisa ukusesha kumininingwane engahlelekile. Ngenkathi ikhompuyutha yakudala ingadinga isikhathi esilingana nenani le amathikithi Kusizindalwazi, u-Grover uyakwazi ukuyehlisela kumpande wesikwele yenani eliphelele lokufakiwe, elimele inzuzo ebalulekile.
Le algorithm isebenzisa amasu e-quantum njenge ukukhulisa i-amplitude ukwandisa i izingqinamba ukuthola umphumela oyifunayo. Isibonelo, ukuthola ukhiye owodwa olungile phakathi kwezinketho eziyi-100 kuzodinga ukuzama kuphela Izikhathi ze-10 ngokwesilinganiso, uma kuqhathaniswa nemizamo efika 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.
Ngaphandle kwakhe inzuzoI-algorithm kaGrover ayithathi indawo yezindlela zakudala kuyo yonke imikhakha, kodwa ihambisana nemisebenzi ethile esebenzisa ngokunenzuzo ikhono layo lokusingatha idatha eyinkimbinkimbi.
Ukuxazulula izinkinga ze-NP-hard nge-qubits
Indawo ethembisayo ye- i-quantum computing isixazululo sezinkinga ze-NP-hard ezifana Inkinga yomthengisi ohambayo (TSP), ethola indlela emfushane phakathi kweqoqo lamadolobha. Ngendlela yakamuva, abacwaningi babonise ukuthi i-qubit ekahle ingayisebenzisa kanjani le-algorithm ngokuthi ukuzungeza ku-Bloch sphere, emele amadolobha njengamaphuzu kumkhakha oshiwo.
Ngenkathi ukulingisa kokuqala kubonise imiphumela ethembisayo kuze kube Imizi ye-9, the izinselele zobuchwepheshe Izindlela zamanje zikhawulela ukusetshenziswa kwazo ezinkingeni ezinkulu. Yena i-quantum parallelism okuhlotshaniswa nalezi zixazululo kungaguqula ukusebenza kahle izibalo kanye ne-logistics esikhathini esizayo esiseduze.
Ikusasa lama-algorithms we-quantum
La i-quantum computing isezigabeni zayo zokuqala, kodwa ukuqhubeka nokuthuthuka kwe ubuchule obuphezulu njengeShor kanye neGrover's, kanye nezicelo ezintsha ezindaweni ezifana ukuhlakanipha okufakelwayo, lo biology yekhompyutha futhi i i-inthanethi ye-quantum, khomba ikusasa eliqhakazile. Ukhiye kuzoba ukunqoba imikhawulo yamanje yezobuchwepheshe, njengekhwalithi nokuzinza kwama-qubits, kanye nokuklama izingxenyekazi zekhompuyutha ezikwazi ukusekela izimfuno zalawa ma-algorithms athuthukile.
Kusuka ku i-cryptography kuze kube nokwenza kahle, okwake kwabonakala kungenakwenzeka manje sesingakwazi ukubonga ngenxa yentuthuko ama-algorithms we-quantum. Nakuba luselude ukhalo okufanele luhanjwe, akungabazeki ukuthi sibhekene noguquko lwezobuchwepheshe oluzophawula ngaphambi nangemuva emikhakheni eminingi yesayensi nezobuchwepheshe.
