Kwamfutocin ƙididdiga da ƙididdigar ƙididdiga - sababbi , wanda aka ƙara zuwa sararin bayanan mu tare da , da sauran sharuddan fasahar zamani. A lokaci guda, na kasa samun wani abu a Intanet wanda zai hada wuyar warwarewa a cikin kaina da ake kira "yadda kwamfutoci masu yawa ke aiki". Ee, akwai kyawawan ayyuka da yawa, gami da kan Habr (duba. ), maganganun da, kamar yadda ya saba, sun fi ba da labari da amfani, amma hoton da ke cikin kaina, kamar yadda suke faɗa, bai ƙara ba.
Kuma kwanan nan abokan aikina sun zo wurina suka tambaye ni, “Shin, kun fahimci yadda kwamfutar ƙididdiga ke aiki? Za ka iya gaya mana?” Kuma sai na gane cewa ba ni kaɗai ke da matsala wajen haɗa hoto mai daidaituwa a cikin kaina ba.
Sakamakon haka, an yi ƙoƙari na tattara bayanai game da kwamfutoci masu ƙima zuwa daidaitaccen da'irar dabaru a cikinta matakin asali, ba tare da nutsewa mai zurfi a cikin ilimin lissafi ba da kuma tsarin kididdigar duniya, an bayyana mene ne kwamfuta ta quantum, waɗanne ƙa’idodin da take aiki da su, da irin matsalolin da masana kimiyya ke fuskanta wajen ƙirƙira da sarrafa ta.
Abubuwan da ke ciki
Disclaimer
Marubucin ba ƙwararre ba ne a lissafin ƙididdiga, kuma Masu sauraren labarin mutanen IT iri ɗaya ne, ba ƙwararrun ƙididdiga ba, wadanda kuma suke son hada hoto a kawunansu mai suna “How Quantum computers”. Saboda wannan, yawancin ra'ayoyi a cikin labarin an sauƙaƙa da gangan don ƙarin fahimtar fasahar ƙididdiga a matakin "na asali", amma ba tare da .
Labarin a wasu wurare yana amfani da kayan aiki daga wasu tushe, . Duk inda zai yiwu, ana shigar da hanyoyin haɗin kai kai tsaye da alamun rubutu na ainihi, tebur ko adadi. Idan na manta wani abu (ko wani) a wani wuri, rubuta kuma zan gyara shi.
Gabatarwar
A cikin wannan babi, za mu yi dubi a taqaice yadda zamanin quantum ya fara, ko mene ne dalilin da ya sa aka fara tunanin na’urar kwamfuta, wanda (waɗanne ƙasashe da kamfanoni ne) a halin yanzu su ne kan gaba a cikin wannan fanni, sannan kuma a taƙaice magana. game da manyan hanyoyin ci gaba na ƙididdigar ƙididdiga.
Yadda aka fara
An yi la'akari da farkon lokacin ƙididdigewa a matsayin 1900, lokacin da M. Planck ya fara gabatarwa. Ana fitar da makamashin kuma ba a ci gaba da sha ba, amma a cikin adadi daban-daban. Masana kimiyya da yawa na wancan lokacin ne suka ɗauko wannan ra'ayin - Bohr, Einstein, Heisenberg, Schrödinger, wanda a ƙarshe ya haifar da ƙirƙira da haɓaka irin wannan kimiyyar kamar. . Akwai abubuwa masu kyau da yawa akan Intanet game da samuwar kididdigar kimiyyar lissafi a matsayin kimiyya, a cikin wannan labarin ba za mu yi magana a kan wannan dalla-dalla ba, amma ya zama dole mu nuna ranar da muka shiga sabon zamanin jimla.
Ilimin lissafi na Quantum ya kawo ƙirƙira da fasaha da yawa a cikin rayuwarmu ta yau da kullun, wanda idan ba tare da wanda yanzu yana da wahala a iya tunanin duniyar da ke kewaye da mu. Misali, Laser, wanda yanzu ana amfani da shi a ko'ina, daga kayan aikin gida (matakin Laser, da sauransu) zuwa tsarin fasaha na zamani (laser don gyaran hangen nesa, hello). ). Zai zama ma'ana a ɗauka cewa ba dade ko ba dade wani zai zo da ra'ayin cewa me yasa ba a yi amfani da tsarin ƙididdiga don ƙididdigewa ba. Sannan a 1980 abin ya faru.
Wikipedia ya nuna cewa an bayyana ra'ayin farko na ƙididdigar ƙididdiga a cikin 1980 ta masanin kimiyyar mu Yuri Manin. Amma da gaske sun fara magana game da shi a cikin 1981, lokacin da sanannen R. Feynman , ya lura cewa ba shi yiwuwa a kwaikwayi juyin halittar tsarin ƙididdigewa akan kwamfuta ta gargajiya ta hanya mai inganci. Ya ba da shawarar ƙirar farko , wanda zai iya aiwatar da irin wannan samfurin.
Akwai a , a ciki ana la'akari da shi fiye da ilimi kuma daki-daki, amma za mu ci gaba a taƙaice:
Manyan cibiyoyi a cikin tarihin ƙirƙirar kwamfutoci masu yawa:
- [1994]. P. Gabar Wanda ya tsara
- [1998]. Ƙirƙiri
- [2001]. IBM ya gabatar da kisa don fadada lamba 15
- [2007-2016]. ƙirƙira da haɓaka kwamfuta mai nauyin 128-2000 qubits
- [2012]. An aiwatar da shi a Jami'ar California
- [2016]. Google a kan kwamfuta 9-qubit
- [2017] (Uku atom)
- [2019] . 20-qubit kwamfuta a cikin gajimare
- [2019] . 53 qubit kwamfuta. ?
Kamar yadda kuke gani, shekaru 17 suka shude (daga 1981 zuwa 1998) tun daga lokacin da aka fara wannan ra'ayi zuwa farkon fara aiwatar da ita a cikin kwamfutar da ke da qubits 2, da shekaru 21 (daga 1998 zuwa 2019) har sai da adadin qubits ya karu zuwa 53. An dauki shekaru 11 (daga 2001 zuwa 2012) don inganta sakamakon Shor's algorithm (za mu duba shi dalla-dalla kadan daga baya) daga lamba 15 zuwa 21. Har ila yau, shekaru uku da suka wuce mun zo ga ma'anar aiwatar da abin da Feynman ya yi magana akai, da kuma koyi yin samfuri mafi sauƙi na tsarin jiki.
Ci gaban ƙididdigar ƙididdiga yana jinkirin. Masana kimiyya da injiniyoyi suna fuskantar ayyuka masu wuyar gaske, jihohin ƙididdiga suna da ɗan gajeren lokaci kuma ba su da ƙarfi, kuma don kiyaye su tsawon lokacin da za su iya yin lissafi, dole ne su gina sarcophagi na dubban miliyoyin daloli, wanda ake kiyaye yanayin zafi. kawai sama da cikakken sifili, kuma waɗanda aka fi kiyaye su daga tasirin waje. Na gaba za mu yi magana game da waɗannan ayyuka da matsaloli daki-daki.
Manyan Yan wasa
An ɗauko nunin faifai na wannan sashe daga labarin , daga mai bincike Alexei Fedorov. Bari in ba ku maganganun kai tsaye:
Duk ƙasashe masu cin nasara a fasaha a halin yanzu suna haɓaka fasahar ƙima. Ana kashe kudade masu yawa a cikin wannan bincike, kuma ana ƙirƙirar shirye-shirye na musamman don tallafawa fasahar ƙididdiga.
Ba jihohi kadai ba, har ma da kamfanoni masu zaman kansu suna shiga cikin tseren kididdigar. Gabaɗaya, Google, IBM, Intel da Microsoft kwanan nan sun kashe kusan dala biliyan 0,5 don haɓaka kwamfutoci masu yawa tare da ƙirƙirar manyan dakunan gwaje-gwaje da cibiyoyin bincike.
Akwai labarai da yawa akan Habré da Intanet, alal misali. , и , inda aka yi nazarin yanayin da ake ciki a halin yanzu tare da haɓaka fasahar ƙima a ƙasashe daban-daban. Babban abin da ke gare mu a yanzu shi ne, dukkan manyan kasashen da suka ci gaba da fasahar kere-kere da ‘yan wasa suna zuba makudan kudade wajen gudanar da bincike ta wannan fanni, wanda ke ba da bege ga hanyar fita daga kangin fasahohin zamani.
Jagoran ci gaba
A halin yanzu (Zan iya yin kuskure, gyara ni) babban ƙoƙarin (da ƙari ko žasa da sakamako mai mahimmanci) na duk manyan 'yan wasan sun mayar da hankali a wurare biyu:
- Kwamfutoci na musamman, waɗanda ke da nufin magance takamaiman matsala ɗaya, misali, matsalar ingantawa. Misalin samfur shine kwamfutocin ƙididdiga na D-Wave.
- Kwamfutocin jimla na duniya - waɗanda ke da ikon aiwatar da tsarin ƙididdiga na ƙididdigewa (Shor, Grover, da sauransu). Ayyuka daga IBM, Google.
Sauran nau'o'in ci gaban da ilimin lissafi ke ba mu, kamar:
- a matsayin tushen
- kuma yafi
Tabbas, har ila yau yana cikin jerin wuraren bincike, amma a halin yanzu babu wani sakamako mai mahimmanci ko žasa.
Bugu da ƙari za ku iya karantawa , google "", Misali, , и .
Abubuwan asali. Ƙididdigar abu da tsarin ƙididdiga
Babban abin da za a fahimta daga wannan sashe shi ne
Kwamfuta ta Quantum (ba kamar yadda aka saba ba) ana amfani dashi azaman masu ɗaukar bayanai jimla abubuwa, kuma don aiwatar da lissafi, dole ne a haɗa abubuwa masu ƙima a ciki tsarin adadi.
Menene abin ƙididdigewa?
Ƙimar abu - wani abu na microworld (duniyar ƙididdiga) wanda ke nuna kaddarorin ƙididdiga:
- Yana da ƙayyadadden yanayi mai matakan iyaka biyu
- Yana cikin yanayin yanayinsa har zuwa lokacin aunawa
- Yana haɗa kanta da wasu abubuwa don ƙirƙirar tsarin ƙididdiga
- Yana gamsar da ka'idar rashin cloning (ba za a iya kwafi yanayin abin ba)
Bari mu kalli kowace kadara daki-daki:
Yana da ƙayyadadden yanayi mai matakan iyaka biyu (jihar ƙarshen)
Wani misali na ainihi na gaske shine tsabar kuɗi. Yana da yanayin "gefe", wanda ke ɗaukar matakan iyaka guda biyu - "kawuna" da "wutsiyoyi".
Yana cikin yanayin yanayinsa har zuwa lokacin aunawa
Suka jefar da tsabar kudi, ta tashi tana jujjuyawa. Yayin da yake jujjuyawa, ba zai yiwu a faɗi a cikin wane matakin iyaka ba yanayin "gefen" yake. Amma da zaran mun kakkabe shi muka kalli sakamakon, nan da nan babban matsayi na jihohi ya ruguje zuwa daya daga cikin jihohi biyu masu iyaka - "kawuna" da "wutsiya". Mare tsabar kuɗi a yanayinmu shine ma'auni.
Yana haɗa kanta da wasu abubuwa don ƙirƙirar tsarin ƙididdiga
Yana da wahala tare da tsabar kudi, amma bari mu gwada. A ce mun jefar da sulalla uku har su juya suna manne da juna, wannan jugling ne da tsabar kudi. A kowane lokaci, ba kawai kowannensu yana cikin babban matsayi na jihohi ba, amma waɗannan jihohin suna yin tasiri ga juna (tsabar kudi suna karo).
Yana gamsar da ka'idar rashin cloning (ba za a iya kwafi yanayin abin ba)
Yayin da tsabar kudi ke tashi da jujjuyawa, babu wata hanyar da za mu iya ƙirƙirar kwafin yanayin jujjuyawar kowane tsabar kuɗi, daban da tsarin. Tsarin yana rayuwa a cikin kansa kuma yana da kishi sosai don sakin kowane bayani ga duniyar waje.
Wasu 'yan ƙarin kalmomi game da manufar kanta "Superpositions", a kusan duk articles superposition aka bayyana a matsayin "yana cikin duk jihohi a lokaci guda", wanda, ba shakka, gaskiya ne, amma a wasu lokuta ba dole ba ne rudani. Hakanan ana iya tunanin babban matsayi na jihohi a matsayin gaskiyar cewa a kowane lokaci wani abu mai ƙididdigewa yana da akwai wasu yuwuwar rugujewa cikin kowane matakan iyakarsa, kuma gabaɗaya waɗannan yuwuwar a dabi'ance sun yi daidai da 1.. Daga baya, idan muka yi la'akari da qubit, za mu tsaya a kan wannan dalla-dalla.
Don tsabar kudi, ana iya ganin wannan - dangane da saurin farko, kusurwar jefawa, yanayin yanayin da tsabar kudin ke tashi, a kowane lokaci a cikin lokaci yiwuwar samun "kawuna" ko "wutsiya" ya bambanta. Kuma, kamar yadda aka ambata a baya, ana iya tunanin yanayin irin wannan tsabar kudin da ke tashi a matsayin "kasancewa a cikin dukkan jihohin iyakarta a lokaci guda, amma tare da yiwuwar aiwatar da su daban-daban."
Duk wani abu da abubuwan da ke sama suka gamsu da su kuma waɗanda za mu iya ƙirƙira da sarrafawa za a iya amfani da su azaman mai ɗaukar bayanai a cikin kwamfuta mai ƙididdigewa.
A ɗan gaba za mu yi magana game da halin da ake ciki a halin yanzu tare da aiwatar da jiki na qubits a matsayin abubuwa masu yawa, da kuma abin da masana kimiyya ke amfani da su a wannan matsayi.
Don haka dukiya ta uku ta bayyana cewa abubuwan ƙididdigewa za su iya shiga cikin ƙirƙira tsarin ƙididdiga. Menene tsarin ƙididdiga?
Tsarin ƙididdiga - tsarin abubuwa masu kama da juna tare da kaddarorin masu zuwa:
- Tsarin ƙididdigewa yana cikin babban matsayi na duk yuwuwar jihohi na abubuwan da ya ƙunshi
- Ba shi yiwuwa a san yanayin tsarin har sai lokacin aunawa
- A lokacin aunawa, tsarin yana aiwatar da ɗayan yuwuwar bambance-bambancen jihohin iyakarsa
(kuma, duba gaba kadan)
Ƙididdigar shirye-shiryen ƙididdiga:
- Shirin ƙididdigewa yana da yanayin tsarin da aka ba da shi a wurin shigarwa, babban matsayi a ciki, matsayi mai girma a wurin fitarwa
- A fitowar shirin bayan aunawa muna da aiwatar da yuwuwar aiwatar da ɗayan yuwuwar jihohin ƙarshe na tsarin (da yuwuwar kurakurai)
- Duk wani shirin ƙididdigewa yana da tsarin gine-ginen bututun hayaki (shigarwa -> fitarwa. Babu madaukai, ba za ku iya ganin yanayin tsarin a tsakiyar tsarin ba.)
Kwatanta kwamfyuta mai ƙididdigewa da na al'ada
Yanzu bari mu kwatanta kwamfuta ta al'ada da adadi ɗaya.
| kwamfuta na yau da kullun | Kwamfuta ta Quantum | |
|
Logic
|
0 / 1 | `a|0> + b|1>, a^2+b^2=1` |
|
Jiki
|
Semiconductor transistor | Ƙimar abu |
|
Mai ɗaukar bayanai
|
Matakan ƙarfin lantarki | Polarization, juya,… |
|
Ayyuka
|
BA, KUMA, KO, XOR fiye da raguwa | Valves: CNOT, Hadamard,… |
|
Dangantaka
|
Semiconductor guntu | Rudewa da juna |
|
Algorithms
|
Standard (duba bulala) | Musamman (Shore, Grover) |
|
Manufa
|
Digital, deterministic | Analog, mai yiwuwa |
Matsayin hankali
A cikin kwamfutar yau da kullun wannan kadan ne. Sanannen mu ta hanyar da ta dace deterministic bit. Zai iya ɗaukar ƙimar ko dai 0 ko 1. Yana jure daidai da rawar naúrar ma'ana don kwamfuta na yau da kullun, amma bai dace ba don kwatanta jihar abin ƙididdigewa, wanda, kamar yadda muka fada, a cikin daji yana cikinsuperpositions na iyakokin jihohin su.
Wannan shi ne abin da suka fito da shi . A cikin iyakokinta yana gane jihohi kama da 0 da 1 , kuma a cikin babban matsayi yana wakiltar yiwuwar rarraba kan iyakokinta |0> и |1>:
a|0> + b|1>, такое, что a^2+b^2=1a da b wakilci , kuma murabba'in na'urorin su shine ainihin yiwuwar samun daidai irin waɗannan dabi'u na jihohin iyaka. |0> и |1>, idan kun rushe qubit tare da aunawa a yanzu.
Layer na jiki
A halin yanzu matakin fasaha na ci gaba, aiwatar da jiki na ɗan ƙaramin kwamfyuta na al'ada shine semiconductor transistor, ga adadi, kamar yadda muka riga muka fada, kowane abu mai ƙididdigewa. A cikin sashe na gaba za mu yi magana game da abin da ake amfani dashi a halin yanzu azaman kafofin watsa labarai na jiki don qubits.
Matsakaici Matsakaici
Don kwamfutar yau da kullun wannan shine wutar lantarki - matakan ƙarfin lantarki, kasancewar ko rashi na yanzu, da dai sauransu, don adadi - iri ɗaya yanayin kididdigar abu (shugaban polarization, juzu'i, da sauransu), wanda zai iya kasancewa a cikin yanayin babban matsayi.
Ayyuka
Don aiwatar da da'irar dabaru akan kwamfuta ta yau da kullun, muna amfani da sanannun , don ayyuka a kan qubits ya zama dole a fito da wani tsarin aiki daban-daban, wanda ake kira . Ƙofofi na iya zama qubit guda ɗaya ko biyu-qubit, ya danganta da adadin qubits ɗin da ake juyawa.
Misalan ƙofofin ƙididdiga:
Akwai ra'ayi duniya bawul kafa, wanda ya isa ya yi kowane lissafin ƙididdiga. Misali, saitin duniya ya haɗa da ƙofar Hadamard, ƙofar canjin lokaci, ƙofar CNOT, da ƙofar π⁄8. Tare da taimakonsu, zaku iya yin kowane lissafin ƙididdigewa akan saitin qubits na sabani.
A cikin wannan labarin, ba za mu yi daki-daki ba game da tsarin ƙofofin ƙididdiga; zaku iya karanta ƙarin game da su da ayyukan ma'ana akan qubits, alal misali, . Babban abin tunawa:
- Ayyuka akan abubuwan ƙididdigewa suna buƙatar ƙirƙirar sabbin ma'aikata masu ma'ana (ƙofofin ƙididdiga)
- Ƙofofin ƙididdiga suna zuwa cikin nau'ikan qubit guda ɗaya da nau'ikan qubit biyu.
- Akwai ƙofofin duniya waɗanda za a iya amfani da su don yin kowane ƙididdige ƙididdiga
Dangantaka
Transistor guda ɗaya ba shi da amfani a gare mu gaba ɗaya; don aiwatar da lissafin muna buƙatar haɗa transistor da yawa zuwa juna, wato, ƙirƙirar guntu na semiconductor daga miliyoyin transistor waɗanda za a gina hanyoyin ma'ana a kansu. kuma, a ƙarshe, sami na'ura mai sarrafawa ta zamani a cikin sigar sa ta al'ada.
Hakanan qubit ɗaya ba shi da amfani a gare mu gaba ɗaya (da kyau, idan a cikin sharuɗɗan ilimi kawai),
don aiwatar da lissafin muna buƙatar tsarin qubits (ƙirar abubuwa)
wanda kamar yadda muka fada a baya, ana samar da su ne ta hanyar cudanya da juna ta yadda sauye-sauye a jihohinsu za su kasance cikin tsari.
Algorithms
Madaidaitan algorithms waɗanda ɗan adam suka tara har zuwa yau ba su dace da aiwatarwa akan kwamfutar ƙididdiga ba. Ee, gabaɗaya babu buƙata. Kwamfutoci masu ƙididdiga waɗanda suka dogara akan ma'anar ƙofar kan qubits suna buƙatar ƙirƙirar algorithms mabanbanta, ƙididdigar ƙididdiga. Daga cikin sanannun ƙididdiga algorithms, ana iya bambanta uku:
- (factorization)
- (bincike cikin sauri a cikin bayanan da ba a ba da oda ba)
- (amsar tambayar, aiki akai-akai ko daidaitacce)
Manufa
Kuma mafi mahimmancin bambanci shine ka'idar aiki. Don daidaitaccen kwamfuta wannan shine dijital, ƙayyadaddun ƙayyadaddun ƙa'ida, bisa ga gaskiyar cewa idan muka saita wasu yanayin farkon tsarin kuma muka wuce ta ta hanyar algorithm da aka ba, to sakamakon lissafin zai kasance iri ɗaya, komai sau nawa muke gudanar da wannan lissafin. A haƙiƙa, wannan ɗabi'a shine ainihin abin da muke tsammani daga kwamfuta.
Kwamfuta ta Quantum tana aiki analog, ka'ida mai yiwuwa. Sakamakon algorithm da aka bayar a yanayin farko da aka bayar shine samfurin daga yiwuwar rarraba aiwatarwa na ƙarshe na algorithm da kurakurai masu yiwuwa.
Wannan yanayin yuwuwar yanayin ƙidayar ƙididdiga ya samo asali ne saboda ainihin mahimmin jigon duniyar jimla. "Allah ba ya wasa da duniya.", in ji tsohon Einstein, amma duk gwaje-gwaje da lura da su ya zuwa yanzu (a cikin tsarin kimiyya na yanzu) sun tabbatar da akasin haka.
Ayyukan jiki na qubits
Kamar yadda muka fada a baya, qubit yana iya wakilta ta hanyar kididdigar abu, wato, abu na zahiri wanda ke aiwatar da abubuwan da aka bayyana a sama. Wato, a wajen magana, duk wani abu na zahiri da ke da jihohi biyu a cikinsa kuma wadannan jihohi biyu suna cikin matsayi mai girma, za a iya amfani da su don gina kwamfutoci masu yawa.
"Idan za mu iya sanya kwayar zarra zuwa matakai biyu daban-daban kuma mu sarrafa su, to kuna da qubit. Idan za mu iya yin wannan tare da ion, yana da qubit. Haka yake da halin yanzu. Idan muka gudanar da shi a kusa da agogo da na agogo a lokaci guda, kuna da qubit. "
Akwai к , wanda aka yi la'akari da nau'in aiwatar da aikin jiki na qubit a cikin ƙarin daki-daki, za mu lissafa mafi sanannun kuma na kowa:
- da sauran ra'ayoyi masu ban mamaki (anions, da dai sauransu)
Daga cikin duk wannan nau'in, mafi haɓaka shine hanyar farko ta samun qubits, dangane da . , , da sauran manyan 'yan wasa suna amfani da shi don gina tsarin su.
To, kara karantawa mai yiwuwa qubits daga .
Abubuwan asali. Yadda kwamfuta kwamfuta ke aiki
Ana ɗaukar kayan wannan sashe (aiki da hotuna) daga labarin .
Don haka, tunanin cewa muna da aiki mai zuwa:
Akwai rukuni na mutane uku: (A)ndrey, (B)olodya and (C)erezha. Akwai tasi guda biyu (0 da 1).
An kuma san cewa:
- (A)ndrey, (B)olodya abokai ne
- (A)ndrey, (C)erezha abokan gaba ne
- (B)olodya da (C)erezha abokan gaba ne
Aiki: Sanya mutane a cikin tasi don haka Max (abokai) и Min (makiya)
Rating: L = (yawan abokai) - (yawan abokan gaba) ga kowane zaɓin masauki
MUHIMMI: Zaton cewa babu ilimin aikin hajji, babu mafi kyawun mafita. A wannan yanayin, za a iya magance matsalar ta hanyar cikakken bincike na zaɓuɓɓuka.
Magani akan kwamfuta na yau da kullun
Yadda ake magance wannan matsalar akan kwamfutar (super) na yau da kullun (ko cluster) - a bayyane yake cewa kuna buƙatar yin madauki ta duk zaɓuɓɓukan da za ku iya. Idan muna da tsarin multiprocessor, to, za mu iya daidaita lissafin mafita a tsakanin masu sarrafawa da yawa sannan kuma tattara sakamakon.
Muna da zaɓuɓɓukan masauki guda 2 (taxi 0 da taxi 1) da mutane 3. Wurin warwarewa 2^3 = 8. Kuna iya ma ta hanyar zaɓuɓɓuka 8 ta amfani da kalkuleta, wannan ba matsala bane. Yanzu bari mu dagula matsalar - muna da mutane 20 da bas guda biyu, wurin mafita 2^20 = 1. Babu wani abu mai rikitarwa kuma. Bari mu ƙara yawan mutane da sau 2.5 - ɗauki mutane 50 da jiragen kasa biyu, sararin mafita yanzu shine. 2^50 = 1.12 x 10^15. Kwamfuta ta yau da kullun (super) ta riga ta fara samun manyan matsaloli. Mu kara yawan mutane da sau 2, mutum 100 za su ba mu riga 1.2 x10^30 yiwu zažužžukan.
Shi ke nan, ba za a iya ƙididdige wannan aikin ba a cikin madaidaicin lokaci.
Haɗa supercomputer
Kwamfuta mafi ƙarfi a halin yanzu ita ce lamba 1 ta , wannan , Yawan aiki 122 . Bari mu ɗauka cewa muna buƙatar ayyuka 100 don lissafin zaɓi ɗaya, sannan don magance matsalar ga mutane 100 za mu buƙaci:
(1.2 x 10^30 100) / 122×10^15 / (606024365) = 3 x 10^37 shekaru.
Kamar yadda muke gani yayin da girman bayanan farko ya karu, sararin mafita yana girma bisa ga dokar wutar lantarki, a cikin yanayin gabaɗaya, don N bits muna da zaɓuɓɓukan mafita na 2 ^ N, wanda don ƙaramin ƙaramin N (100) yana ba mu sararin bayani mara ƙididdigewa (a matakin fasaha na yanzu).
Akwai wasu hanyoyi? Kamar yadda kila kuka yi tsammani, eh, akwai.
Amma kafin mu shiga ta yaya da kuma dalilin da yasa kwamfutocin kwamfutoci za su iya magance matsalolin irin waɗannan yadda ya kamata, bari mu ɗan ɗauki lokaci don sake duba menene. yiwuwar rarraba. Kada ku firgita, wannan labarin bita ne, ba za a sami wani lissafi mai wuyar gaske a nan ba, za mu yi tare da misali na yau da kullun tare da jaka da bukukuwa.
Kaɗan ɗan haɗaka, ka'idar yuwuwar da wani bakon gwaji
Mu dauki jaka mu saka a ciki Fari 1000 da ƙwallo 1000 na baƙi. Za mu gudanar da gwaji - fitar da kwallon, rubuta launi, mayar da kwallon a cikin jaka da kuma haɗa kwallaye a cikin jakar.
An gudanar da gwajin sau 10. ya ciro bakar ƙwalla guda 10. Wataƙila? Tabbas. Shin wannan samfurin yana ba mu wani tunani mai ma'ana game da rarraba gaskiya a cikin jakar? Babu shakka a'a. Abin da ya kamata a yi - daidai, pmaimaita gwajin sau miliyan kuma ƙididdige mitoci na ƙwallo baki da fari. Mun samu, misali 49.95% baki da 50.05% fari. A wannan yanayin, tsarin tsarin rarraba daga abin da muke samfurin (ɗaukar da ball daya) ya riga ya fi ko žasa.
Babban abu shine fahimtar hakan gwajin kanta yana da dabi'a mai yiwuwa, tare da samfurin daya (ball) ba za mu san ainihin tsarin rarraba ba, muna buƙatar maimaita gwajin sau da yawa da matsakaita sakamakon.
Mu kara a cikin jakar mu 10 ja da ƙwallayen kore 10 (kurakurai). Mu maimaita gwajin sau 10. INja 5 da kore 5 ya ciro. Wataƙila? Ee. Za mu iya faɗi wani abu game da rarraba gaskiya - A'a. Abin da ya kamata a yi - da kyau, kun fahimta.
Don samun fahimtar tsarin rabe-raben yuwuwar, ya zama dole a maimaita misalta sakamakon kowane mutum daga wannan rarraba da matsakaicin sakamako.
Haɗin ka'idar tare da aiki
Yanzu maimakon ƙwallo baki da fari, bari mu ɗauki ƙwallan billiard mu saka su cikin jaka Kwallaye 1000 tare da lamba 2, 1000 tare da lamba 7 da kwallaye 10 tare da wasu lambobi. Bari mu yi tunanin wani mai gwaji wanda aka horar da shi a cikin mafi sauki ayyuka (fitar da ball, rubuta lambar, mayar da ball a cikin jaka, Mix da bukukuwa a cikin jakar) kuma ya yi haka a cikin 150 microsecond. To, irin wannan gwaji akan gudun (ba tallan magani ba !!!). Sannan a cikin dakika 150 zai iya yin gwajin mu sau miliyan 1 da kuma samar mana da matsakaicin sakamako.
Suka zaunar da mai gwajin, suka ba shi jaka, suka juya, suka jira 150 seconds suka karbi:
lamba 2 - 49.5%, lamba 7 - 49.5%, sauran lambobi a duka - 1%.
Ee haka ne, jakar mu ita ce kwamfuta mai ƙididdigewa tare da algorithm wanda ke magance matsalarmu, da kuma bukukuwa ne yiwu mafita. Tunda akwai mafita guda biyu daidai, to Kwamfuta mai ƙididdigewa za ta ba mu kowane ɗayan waɗannan yuwuwar mafita tare da yuwuwar yuwuwar daidai, da kurakurai 0.5% (10/2000)., wanda za mu yi magana game da shi nan gaba.
Don samun sakamakon kwamfuta mai ƙididdigewa, kuna buƙatar gudanar da ƙididdiga algorithm sau da yawa akan saitin bayanai iri ɗaya da matsakaicin sakamako.
Siffar girman kwamfuta
Yanzu tunanin cewa ga wani aiki da ya shafi mutane 100 (sarari mafita 2^100 mun tuna da wannan), akwai kuma kawai biyu daidai yanke shawara. Sannan idan muka dauki qubits 100 muka rubuta algorithm wanda zai lissafta aikinmu na haƙiƙa (L, duba sama) akan waɗannan qubits, to zamu sami jakar da za a sami ƙwallo 1000 tare da lambar amsar farko daidai, 1000 tare da. adadin amsar daidai ta biyu da ƙwallaye 10 tare da wasu lambobi. Kuma a cikin dakika 150 guda ƙwararren mu zai ba mu kimanta yiwuwar rarraba madaidaiciyar amsoshi.
Lokacin aiwatar da ƙididdigewa algorithm (tare da wasu zato) ana iya ɗaukar shi akai-akai O(1) dangane da girman sararin bayani (2^N).
Kuma wannan shine ainihin mallakar kwamfyuta mai ƙididdigewa - tsawon lokacin aiki dangane da ƙara ƙarfin doka rikitarwa na sararin mafita shine mabuɗin.
Qubit da duniyoyi masu kamanceceniya
Ta yaya hakan ke faruwa? Me ke ba kwamfutar kwamfuta ta ƙididdige damar yin lissafin da sauri? Yana da duka game da yanayin ƙididdigewa na qubit.
Duba, mun ce qubit kamar abu ne ya gane daya daga cikin jihohinsa biyu idan an lura, amma a cikin "dajin daji" yana cikin superpositions na jihohi, wato, yana cikin duka jihohin iyakarta lokaci guda (tare da wasu yuwuwar).
Mu dauka (A) dariya kuma ka yi tunanin yanayinta (a cikin wane abin hawa - 0 ko 1) a matsayin qubit. Sannan muna da (a cikin adadi mai yawa) duniyoyi biyu masu kama da juna, a daya (AMMA) yana zaune a cikin taksi 0, a wata duniya - a cikin taksi 1. A cikin tasi guda biyu a lokaci guda, amma tare da wasu yuwuwar gano shi a kowannen su yayin lura.
Mu dauka (B) yar mu kuma yi tunanin halinta a matsayin qubit. Wasu duniyoyi guda biyu masu kamanceceniya sun taso. Amma yanzu waɗannan nau'ikan duniyoyin (AMMA) и (AT) kada ku yi mu'amala da komai. Abin da ya kamata a yi don ƙirƙirar masu alaka tsarin? Haka ne, muna buƙatar waɗannan qubits daure (rikitarwa). Mu dauka mu dame shi (A) da (B) - muna samun tsarin ƙididdiga na qubits biyu (A, B), gane cikin kanta hudu dogara da juna duniyoyi masu daidaituwa. Ƙara (S) ya kuma muna samun tsarin qubits uku (ABC), aiwatar da takwas dogara da juna duniyoyi masu daidaituwa.
Ma'anar ƙididdiga ta ƙididdigewa (aiwatar da jerin jerin ƙofofin ƙididdiga akan tsarin haɗin qubits) shine gaskiyar cewa lissafin yana faruwa a cikin dukkanin duniyoyi masu kama da juna a lokaci guda.
Kuma ba komai nawa muke da su ba, 2^3 ko 2^100, Za a aiwatar da ƙididdigar ƙididdiga a cikin ƙayyadadden lokaci a kan duk waɗannan duniyoyi masu kama da juna kuma zai ba mu sakamako, wanda shine samfurin daga yiwuwar rarraba amsawar algorithm.
Don kyakkyawar fahimta, mutum zai iya tunanin hakan Kwamfuta mai ƙididdigewa a matakin ƙididdigewa tana gudanar da hanyoyin warware 2^N a layi daya, kowannensu yana aiki akan zaɓi ɗaya mai yiwuwa, sannan ya tattara sakamakon aikin - kuma yana ba mu amsar ta sigar maɗaukakiyar mafita (yiwuwar rarraba martani), daga abin da muke samfurin ɗaya kowane lokaci (don kowane gwaji).
Tuna lokacin da mai gwajin mu ke buƙata (150 µs) don gudanar da gwajin, wannan zai zama da amfani a gare mu kadan kadan, lokacin da muka yi magana game da manyan matsalolin kwamfyutocin kwamfyutoci da lokacin lalata.
Algorithms na Quantum
Kamar yadda aka ambata, algorithms na al'ada dangane da dabaru na binary ba su da amfani ga kwamfuta ta ƙididdige ta amfani da dabaru na ƙididdigewa (kwayoyin ƙima). A gare shi, ya zama dole ya fito da sababbi waɗanda ke yin cikakken amfani da yuwuwar da ke tattare da yanayin ƙididdiga.
Mafi sanannun algorithms a yau sune:
Ba kamar na gargajiya ba, kwamfutocin kwamfutoci ba na duniya ba ne.
An sami ƙaramin adadin algorithms na ƙididdigewa zuwa yanzu.
Спасибо don hanyar haɗi zuwa , wurin da, a cewar marubucin (), an tattara mafi kyawun wakilan duniya-algorithmic kuma an ci gaba da tattarawa.
A cikin wannan labarin, ba za mu yi nazari dalla-dalla algorithms na ƙididdiga ba; akwai abubuwa masu kyau da yawa akan Intanet don kowane matakin rikitarwa, amma har yanzu muna buƙatar yin taƙaitaccen bayani kan manyan shahararrun uku.
Algorithm na Shor.
Mafi shaharar adadin algorithm shine (wanda masanin lissafin Ingilishi ya ƙirƙira a cikin 1994 ), wanda ke da nufin magance matsalar ƙididdige lambobi zuwa manyan dalilai (matsalar factorization, discrete logarithm).
Wannan algorithm ne aka ba da misali a lokacin da suka rubuta cewa ba da daɗewa ba za a yi kutse a tsarin banki da kalmomin shiga. Idan aka yi la'akari da cewa tsawon maɓallan da ake amfani da su a yau bai wuce 2048 ragowa ba, lokacin hula bai riga ya zo ba.
Na zamani, fiye da girman kai. Mafi kyawun Sakamako Na Factoris tare da Algorithm na Shor - Lambobi и , wanda bai wuce 2048 bits ba. Ga sauran sakamakon daga tebur, daban lissafin, amma ko da mafi kyawun sakamako bisa ga wannan algorithm (291311) ya yi nisa sosai daga aikace-aikacen gaske.
Kuna iya karanta ƙarin game da Algorithm na Shor, misali,. Game da aiwatarwa mai amfani - .
Daya daga hadaddun da ƙarfin da ake buƙata don ƙididdige lambar 2048-bit ita ce kwamfuta tare da . Muna kwana lafiya.
Grover's algorithm
- warware matsalar ƙidayar, wato, nemo mafita ga lissafin F(X) = 1, ku F daga n masu canji. Wani Ba'amurke masanin lissafi ne ya gabatar da shi в .
Ana iya amfani da algorithm na Grover don nemo и jerin lamba. Bugu da ƙari, ana iya amfani dashi don warwarewa matsaloli ta hanyar bincike mai zurfi a tsakanin mafita da yawa. Wannan na iya haifar da haɓakar saurin sauri idan aka kwatanta da algorithms na gargajiya, kodayake ba tare da samar da ""gaba daya.
Kuna iya karantawa, ko ... Amma duk da haka Akwai kyakkyawan bayani game da algorithm ta amfani da misalin kwalaye da ball, amma, rashin alheri, saboda dalilai fiye da ikon kowa, wannan rukunin yanar gizon ba ya buɗe mini daga Rasha. Idan kana da Hakanan an toshe, don haka ga ɗan taƙaitaccen taƙaitaccen bayani:
Grover's algorithm. Ka yi tunanin kana da N gudan akwatunan rufaffiyar lamba. Dukkansu babu kowa sai guda daya, wanda ke dauke da kwallo. Ayyukanku: nemo lambar akwatin da ƙwallon yake cikinsa (wannan lambar da ba a sani ba galibi ana nuna ta da harafin w).
Yadda za a magance wannan matsala? Hanya mafi wauta ita ce bi da bi a buɗe akwatunan, ko ba dade ko ba dade za ku ci karo da akwati da ƙwallon ƙafa. A matsakaita, akwatuna nawa ne ake buƙata a duba kafin a sami akwati mai ball? A matsakaita, kuna buƙatar buɗe kusan rabin akwatunan N/2. Babban abu a nan shi ne, idan muka kara adadin kwalayen da sau 100, to, matsakaicin adadin akwatunan da ake bukatar budewa kafin a samu kwalin da ke da ball shima zai karu da sau 100.
Yanzu bari mu yi wani karin bayani. Kada mu bude akwatunan da hannayenmu mu bincika ko akwai ball a kowanne, amma akwai wani tsaka-tsaki, bari mu kira shi Oracle. Muna gaya wa Oracle, "duba akwatin lamba 732," kuma Oracle ya bincika kuma ya amsa da gaskiya, "babu ball a akwatin lamba 732." Yanzu, maimakon faɗin akwatuna nawa muke buƙatar buɗewa a matsakaita, sai mu ce “sau nawa akan matsakaita ya kamata mu je Oracle don nemo lambar akwatin da ke da ƙwallon”
Ya bayyana cewa idan muka fassara wannan matsala tare da kwalaye, ball da Oracle zuwa harshen ƙididdiga, muna samun sakamako mai ban mamaki: don nemo lambar akwatin da ball a tsakanin akwatunan N, muna buƙatar damun Oracle kawai game da SQRT. (N) lokaci!
Wato, rikitaccen aikin bincike ta amfani da algorithm na Grover yana raguwa ta tushen murabba'in lokaci.
Deutsch-Jozi algorithm
Deutsch-Jozsa algorithm (kuma ana kiranta da Deutsch-Jozsa algorithm) - [ƙididdigar algorithm](%D0%B0%D0%BB%D0%B3%D0%BE%D1%80%D0%B8%D1%82%D0%BC), предложенный и в , kuma ya zama ɗaya daga cikin misalan farko na algorithms da aka tsara don aiwatar da su . _
Matsalar Deutsch-Jozsi ita ce tantance ko aiki na masu canjin binary da yawa F (x1, x2, ... xn) yana dawwama (yana ɗaukar ko darajar 0 ko 1 ga kowace gardama) ko daidaitawa (don rabin yankin da yake ɗauka). darajar 0, ga sauran rabin 1). A wannan yanayin, ana la'akari da cewa an san shi a priori cewa aikin shine ko dai akai-akai ko daidaitacce.
Hakanan zaka iya karantawa . Bayani mai sauƙi:
Deutsch (Deutsch-Jozsi) Algorithm ya dogara ne akan ƙarfin hali, amma yana ba da damar yin shi da sauri fiye da yadda aka saba. Ka yi tunanin cewa akwai tsabar kuɗi a kan tebur kuma kuna buƙatar gano ko jabu ne ko a'a. Don yin wannan, kuna buƙatar duba tsabar kudin sau biyu kuma ku ƙayyade: "kawuna" da "wutsiyoyi" na gaske ne, "kawuna biyu", "wutsiyoyi" biyu na karya ne. Don haka, idan kuna amfani da Deutsch quantum algorithm, to ana iya yin wannan ƙuduri tare da kallo ɗaya - ma'auni.
Matsalolin kwamfutoci masu yawa
Lokacin zayyana da sarrafa kwamfutoci masu yawa, masana kimiyya da injiniyoyi suna fuskantar matsaloli masu yawa, waɗanda a yau an warware su tare da nasarori daban-daban. Bisa lafazin () za a iya gane jerin matsalolin masu zuwa:
- Hankali ga muhalli da mu'amala da muhalli
- Tarin kurakurai yayin lissafin
- Matsaloli tare da farawa na farko na jihohin qubit
- Matsalolin ƙirƙirar tsarin qubit mai yawa
Ina ba da shawarar karanta labarin sosai "", musamman ma comments da shi.
Bari mu tsara dukkan manyan matsalolin zuwa manyan kungiyoyi uku, mu yi dubi sosai a kan kowannensu:
Rashin daidaituwa
.
Jihohin adadi abu mai rauni sosaiqubits a cikin halin da ake ciki suna da rashin kwanciyar hankali. duk wani tasiri na waje zai iya (kuma ya aikata) lalata wannan haɗin. Canjin zafin jiki ta ƙaramin juzu'i na digiri, matsa lamba, bazuwar photon da ke tashi a kusa - duk wannan yana lalata tsarin mu.
Don magance wannan matsala, an gina sarcophagi low-zazzabi, wanda zafin jiki (-273.14 digiri Celsius) ya dan kadan sama da cikakkiyar sifili, tare da matsakaicin kadaici na ɗakin ciki tare da mai sarrafawa daga duk (yiwuwar) tasirin yanayin waje.
Matsakaicin rayuwar tsarin ƙididdigewa na qubits da yawa, wanda a lokacin yana riƙe kaddarorin ƙididdiga kuma ana iya amfani dashi don ƙididdigewa, ana kiransa lokacin decoherence.
A halin yanzu, lokacin ƙaddamarwa a cikin mafi kyawun hanyoyin jimla yana kan tsari na dubun da ɗaruruwan miktoci.
Akwai abin mamaki inda za ka duba na duk ƙirƙira ƙididdiga tsarin. Wannan labarin ya ƙunshi manyan na'urori biyu kawai a matsayin misali - daga IBM kuma daga . Kamar yadda muke iya gani, lokacin ƙaddamarwa (T2) bai wuce 200 μs ba.
Ban sami ainihin bayanai akan Sycamore ba, amma a cikin mafi yawan an ba da lambobi biyu - Lissafi miliyan 1 a cikin daƙiƙa 200, wani wuri - don 130 seconds ba tare da asarar siginar sarrafawa ba, da sauransu.. A kowane hali, wannan yana ba mu Lokacin rashin daidaituwa yana kusan 150 μs. Tuna da mu gwaji da jaka? To, ga shi nan.
| Sunan Kwamfuta | N Qubits | Max guda biyu | T2 (µs) |
| IBM Q Tsarin Daya | 20 | 6 | 70 |
| Google Sycamore | 53 | 4 | ~ 150-200 |
Menene rashin daidaituwa ke yi mana barazana?
Babban matsalar ita ce bayan 150 μs, tsarin mu na kwamfuta na N entangled qubits zai fara fitar da amo mai yuwuwa a maimakon rarraba madaidaiciyar mafita.
Wato muna bukatar:
- Fara tsarin qubit
- Yi lissafi (sarkar ayyukan gate)
- Karanta sakamakon
Kuma yi duk wannan a cikin 150 micro seconds. Ba ni da lokaci - sakamakon ya zama kabewa.
Amma ba haka kawai…
Kurakurai
Kamar yadda muka ce, Ayyukan ƙididdiga da ƙididdigar ƙididdiga masu yiwuwa ne a yanayi, Ba za mu iya zama 100% tabbatar da wani abu ba, amma kawai tare da wasu yiwuwar. Lamarin ya kara dagulewa da cewa Ƙididdigar ƙididdiga yana da saurin kuskure. Babban nau'ikan kurakurai a cikin ƙididdigar ƙididdiga sune:
- Kuskuren rashin daidaituwa suna haifar da rikitarwa na tsarin da hulɗa tare da yanayin waje
- Kurakurai na lissafin Ƙofar (saboda yawan ƙididdiga)
- Kurakurai wajen karanta yanayin ƙarshe (sakamako)
Kurakurai masu alaƙa da lalata, bayyana da zarar mun haɗa qubits mu fara yin lissafi. Da yawan qubits da muke haɗawa, mafi rikitarwa tsarin, kuma mafi sauƙi shine halakar da shi. Sarcophagi ƙananan zafin jiki, ɗakunan kariya, duk waɗannan dabaru na fasaha suna da nufin rage yawan kurakurai da kuma tsawaita lokacin lalata.
Kurakurai na lissafin Ƙofar - duk wani aiki (ƙofa) akan qubits na iya, tare da wasu yuwuwar, ƙare tare da kuskure, kuma don aiwatar da algorithm muna buƙatar yin ɗaruruwan ƙofofi, don haka tunanin abin da muke samu a ƙarshen aiwatar da algorithm ɗin mu. Amsar al'ada ga tambayar ita ce "Mene ne yiwuwar haɗuwa da dinosaur a cikin lif?" - 50x50, ko dai za ku hadu ko a'a.
Matsalar ta kara dagulawa da gaskiyar cewa daidaitattun hanyoyin gyara kuskure (kwafi na ƙididdiga da matsakaici) ba sa aiki a cikin ƙididdiga na duniya saboda ka'idar no-cloning. Domin a cikin ƙididdiga na ƙididdiga dole ne a ƙirƙira . Kusan magana, muna ɗaukar N talakawa qubits mu yi 1 daga cikinsu ma'ana qubit tare da ƙananan kuskure.
Amma a nan wata matsala ta taso - jimlar adadin qubits. Duba, bari mu ce muna da processor mai qubits 100, wanda 80 qubits ana amfani dashi don gyara kuskure, to muna da saura 20 kawai don lissafin.
Kurakurai wajen karanta sakamakon karshe - kamar yadda muke tunawa, sakamakon ƙididdigar ƙididdiga an gabatar da mu a cikin nau'i yiwuwar rarraba amsoshi. Amma karanta yanayin ƙarshe kuma na iya gazawa tare da kuskure.
Akan haka Akwai kwatancen tebur na masu sarrafawa ta matakan kuskure. Don kwatantawa, bari mu ɗauki na'urori iri ɗaya kamar yadda a cikin misalin da ya gabata - IBM и :
| Computer | 1-Kofar Qubit Aminci | 2- Ƙofar Qubit Aminci | Karanta Fidelity |
| IBM Q Tsarin Daya | 99.96% | 98.31% | - |
| Google Sycamore | 99.84% | 99.38% | 96.2% |
Yana da ma'auni ne na kamanceceniyar jihohi biyu. Girman kuskuren ana iya bayyana shi da ƙima a matsayin 1-Fidelity. Kamar yadda muke iya gani, kurakurai akan ƙofofin 2-qubit da kurakuran karantawa sune babban cikas ga aiwatar da hadaddun da dogon algorithms akan kwamfutoci masu yawa.
Hakanan zaka iya karantawa shekaru daga don magance matsalar gyara kuskure.
Tsarin gine-gine
A ka'idar muna ginawa da aiki da'irori na dozin na qubits masu ruɗewa, a gaskiya komai ya fi rikitarwa. Duk kwakwalwan kwamfuta da ake da su (masu sarrafawa) an gina su ta hanyar da za su ba da raɗaɗi cudanya da qubit daya kawai da makwabta, wanda babu fiye da shida.
Idan muna buƙatar haɗa qubit na 1, ka ce, tare da na 12, to dole ne mu gina jerin ƙarin ayyukan ƙididdiga, ya ƙunshi ƙarin qubits, da dai sauransu, wanda ke ƙara yawan matakin kuskure. Ee, kuma kar ku manta game da lokacin rashin daidaituwa, watakila da lokacin da ka gama haɗa qubits a cikin da'irar da kake buƙata, lokaci zai ƙare kuma dukan kewayawa za su juya zuwa. nice farar amo janareta.
Hakanan kar ku manta da hakan Tsarin gine-ginen duk na'urori masu sarrafa adadi ya bambanta, kuma shirin da aka rubuta a cikin emulator a cikin yanayin "duk-da-duk-da-duk" yanayin zai buƙaci "sake haɗawa" a cikin gine-ginen wani guntu na musamman. Akwai ma don yin wannan aiki.
Matsakaicin haɗin kai da matsakaicin adadin qubits don manyan kwakwalwan kwamfuta iri ɗaya:
| Sunan Kwamfuta | N Qubits | Max guda biyu | T2 (µs) |
| IBM Q Tsarin Daya | 20 | 6 | 70 |
| Google Sycamore | 53 | 4 | ~ 150-200 |
Kuma, don kwatanta, tebur tare da bayanai daga ƙarni na baya na masu sarrafawa. Kwatanta adadin qubits, lokacin daidaitawa da ƙimar kuskure tare da abin da muke da shi yanzu tare da sabon ƙarni. Duk da haka, ci gaba yana sannu a hankali, amma yana motsawa.
Saboda haka:
- A halin yanzu babu cikakken haɗin gine-gine masu> 6 qubits
- Don haɗa qubit 0 s akan ainihin processor, alal misali, qubit 15 na iya buƙatar ƙarin ayyuka dozin da yawa.
- Ƙarin ayyuka -> ƙarin kurakurai -> tasiri mai ƙarfi na rashin daidaituwa
Sakamakon
Decoherence shine gado na Procrustean na ƙididdigar ƙididdiga na zamani. Dole ne mu dace da komai cikin 150 μs:
- Farkon yanayin farko na qubits
- Yin lissafin matsala ta amfani da ƙofofin ƙididdiga
- Gyara kurakurai don samun sakamako mai ma'ana
- Karanta sakamakon
Ya zuwa yanzu sakamakon yana da ban takaici, kodayake da'awar cimma lokacin riƙe haɗin kai na 0.5s akan kwamfutar ƙididdiga bisa ga :
Muna auna lokacin haɗin qubit fiye da 0.5 s, kuma tare da garkuwar maganadisu muna tsammanin wannan zai inganta ya zama tsayi fiye da 1000 s.
Hakanan zaka iya karanta game da wannan fasaha ko misali .
Lamarin ya kara dagulewa yayin da ake yin hadaddun lissafin wajibi ne a yi amfani da da'irar gyara kuskuren adadi, wanda kuma ya cinye lokaci da kuma adadin qubits.
Kuma a ƙarshe, gine-ginen zamani ba sa ƙyale aiwatar da tsare-tsare mafi kyau fiye da 1 cikin 4 ko 1 a cikin 6 akan farashi kaɗan.
Hanyoyin magance matsaloli
Don magance matsalolin da ke sama, a halin yanzu ana amfani da hanyoyi da hanyoyi masu zuwa:
- Amfani da cryochambers tare da ƙananan zafin jiki (10 mK (-273,14 ° C))
- Amfani da na'ura mai sarrafawa waɗanda ke da mafi girman kariya daga tasirin waje
- Amfani da Tsarukan Gyara Kuskuren Quantum (Logic Qubit)
- Amfani da ingantawa lokacin da ake tsara da'irori don takamaiman mai sarrafawa
Hakanan ana gudanar da bincike da nufin haɓaka lokacin haɓakawa, neman sabbin (da haɓaka sanannun) aiwatarwa na zahiri na abubuwan ƙididdigewa, inganta da'irar gyarawa, da sauransu, da sauransu. Akwai ci gaba (duba sama a kan sifofin kwakwalwan kwamfuta na farko da na yau), amma ya zuwa yanzu yana jinkirin, da sauri sosai.
D-Wave
D-Wave 2000Q 2000-qubit kwamfuta. Source:
A cikin sanarwar Google na samun karfin juzu'i ta amfani da na'ura mai nauyin 53-qubit, и daga kamfanin D-Wave, wanda adadin qubits ke cikin dubban, yana da ɗan ruɗani. To, da gaske, idan 53 qubits sun sami damar cimma girman girman adadi, to menene kwamfutar da ke da qubits 2048? Amma ba komai yayi kyau ba...
A takaice (an ɗauko daga wiki):
Kwamfuta aiki a kan manufa (), zai iya magance ƙayyadaddun ƙayyadaddun ƙayyadaddun ƙayyadaddun matsalolin ingantawa, kuma ba su dace da aiwatar da alƙawuran ƙididdiga na al'ada da ƙofofin ƙididdiga ba.
Don ƙarin bayani za ku iya karanta, misali, , (a hankali, mai yiwuwa ba zai buɗe daga Rasha ba), ko в daga nasa . Af, Ina bayar da shawarar sosai karanta blog ɗinsa gabaɗaya, akwai abubuwa masu kyau da yawa a can
Gabaɗaya, tun farkon sanarwar, al'ummar kimiyya suna da tambayoyi game da kwamfutocin D-Wave. Alal misali, a cikin 2014, IBM ya tambayi gaskiyar cewa D-Wave Ya kai ga cewa a cikin 2015, Google, tare da NASA, sun sayi ɗaya daga cikin waɗannan kwamfutoci masu yawa kuma bayan bincike. , cewa a, kwamfutar tana aiki kuma tana ƙididdige matsalar da sauri fiye da na yau da kullun. Kuna iya karanta ƙarin game da bayanin Google kuma, misali, .
Babban abu shine cewa kwamfutocin D-Wave, tare da ɗaruruwa da dubunnan qubits, ba za a iya amfani da su ba don ƙididdigewa da gudanar da ƙididdigar ƙididdiga. Ba za ku iya gudanar da algorithm na Shor akan su ba, misali. Duk abin da za su iya yi shi ne amfani da wasu hanyoyin ƙididdigewa don warware wata matsala ta ingantawa. Zamu iya la'akari da cewa D-Wave adadi ne na ASIC don takamaiman aiki.
Kadan game da kwaikwayon kwamfutoci kaɗan
Ana iya yin koyi da ƙididdiga ta ƙididdiga akan kwamfuta ta yau da kullun. Hakika, :
- Halin qubit zai iya zama hadadden lamba, zama daga 2x32 zuwa 2x64 bits (8-16 bytes) dangane da tsarin gine-gine
- Ana iya wakilta yanayin qubits N da aka haɗa a matsayin hadadden lambobi 2^N, watau. 2^(3+N) don 32-bit architecture da 2^(4+N) don 64-bit.
- Ayyukan ƙididdiga akan N qubits ana iya wakilta ta da matrix 2^N x 2^N
Sannan:
- Don adana jahohin da aka kwaikwayi na qubits 10, ana buƙatar 8 KB
- Don adana jihohin qubits 20 kuna buƙatar 8 MB
- Don adana jihohin 30 qubits, ana buƙatar 8 GB
- Ana buƙatar terabytes 40 don adana jihohin qubits 8
- Don adana jihohin 50 qubits, ana buƙatar 8 Petabyte, da dai sauransu.
Don kwatanta, () yana ɗaukar 2.8 Petabyte na ƙwaƙwalwar ajiya kawai.
- 49 qubit wanda aka ba da shi a bara ga mafi girman kwamfutocin kasar Sin ()
Iyakar simintin kwamfyuta mai ƙididdigewa akan tsarin gargajiya ana ƙaddara ta adadin RAM ɗin da ake buƙata don adana yanayin qubits.
Ina kuma ba da shawarar karantawa . Daga can:
Ta hanyar aiki - don kwaikwayi daidaitaccen da'irar 49-qubit wanda ya ƙunshi wasu "zazzagewa" 39 (ruwan ƙofofi masu zaman kansu) 2 ^ 63 hadaddun multiplications - 4 Pflops na supercomputer na 4 hours
Kwaikwayi kwamfuta kidayar 50+ qubit akan tsarin gargajiya ana ɗaukarsa ba zai yiwu ba cikin lokaci mai ma'ana. Wannan kuma shine dalilin da ya sa Google ya yi amfani da na'ura mai nauyin 53-qubit don gwajin girman girmansa.
Ƙimar lissafin ƙididdiga.
Wikipedia yana ba mu ma'anar ƙimar ƙididdiga masu yawa:
Ƙimar girma - iyawa na'urorin magance matsalolin da kwamfutoci na gargajiya a zahiri ba za su iya magance su ba.
A haƙiƙa, samun fifikon ƙima yana nufin, alal misali, ƙididdige yawan lambobi ta amfani da Shor algorithm za a iya warware su cikin isasshen lokaci, ko kuma za a iya yin koyi da hadadden ƙwayoyin sinadarai a matakin ƙima, da sauransu. Wato sabon zamani ya zo.
Amma akwai wani madauki a cikin ma'anar ma'anar, "wanda kwamfutoci na gargajiya a zahiri ba za su iya warwarewa ba" A haƙiƙa, wannan yana nufin idan ka ƙirƙiri kwamfutar quantum mai nauyin qubits 50+ kuma ka gudanar da wani nau'i na quantum a kai, to, kamar yadda muka yi bayani a sama, ba za a iya yin koyi da sakamakon wannan da'ira akan kwamfutar yau da kullun ba. Wato kwamfutar gargajiya ba za ta iya sake haifar da sakamakon irin wannan da'ira ba.
Ko irin wannan sakamakon ya ƙunshi ainihin ƙimar ƙima ko a'a, a'a tambaya ce ta falsafa. Amma fahimtar abin da Google ya yi da abin da ya dogara da shi dole.
Bayanin Ƙimar Ƙididdigar Google
Sycamore 54-qubit processor
Don haka, a cikin Oktoba 2019, masu haɓaka Google sun buga labarin a cikin littafin kimiyya Nature "" Marubutan sun sanar da nasarar girman girman ƙima a karon farko a cikin tarihi ta amfani da na'ura mai sarrafa 54-qubit Sycamore.
Labarun Sycamore akan layi sau da yawa suna komawa zuwa ko dai mai sarrafa 54-qubit ko na'ura mai sarrafawa 53-qubit. Gaskiyar ita ce a cewar , processor a zahiri ya ƙunshi qubits 54, amma ɗaya daga cikinsu baya aiki kuma an cire shi daga sabis. Don haka, a zahiri muna da processor 53-qubit.
A kan yanar gizo dama can kayan a kan wannan batu, matakin wanda ya bambanta daga to .
Daga baya kungiyar kididdigar kididdigar ta IBM ta bayyana cewa . Kamfanin ya yi iƙirarin cewa kwamfutar ta al'ada za ta fuskanci wannan aiki a cikin mafi munin yanayi a cikin kwanaki 2,5, kuma sakamakon da aka samu zai zama daidai fiye da na kwamfutar da ke da adadi. An yi wannan ƙaddamarwa bisa sakamakon nazarin ka'idar hanyoyin ingantawa da yawa.
Kuma, ba shakka, a cikin Ba zan iya yin watsi da wannan magana ba. Nasa tare da duk hanyoyin haɗi da kamar yadda aka saba, sun cancanci kashe lokacinku akan. A kan cibiya wannan FAQ, kuma tabbatar da karanta maganganun, akwai hanyoyin haɗi zuwa takaddun farko waɗanda aka leka akan layi kafin sanarwar hukuma.
Menene ainihin Google yayi? Don cikakken fahimta, karanta Aaronson, amma a taƙaice nan:
Zan iya, ba shakka, gaya muku, amma ina jin kamar wauta. Lissafin shine kamar haka: mai gwaji yana haifar da da'irar ƙididdiga ta C (watau jerin bazuwar ƙofofin 1-qubit da 2-qubit tsakanin maƙwabta mafi kusa, tare da zurfin, misali, 20, aiki akan hanyar sadarwar 2D na n. = 50-60 qubits). Daga nan sai mai gwajin ya aika C zuwa kwamfuta mai ƙididdigewa, kuma ya nemi ta yi amfani da C zuwa yanayin farko na 0, auna sakamakon a cikin tushen {0,1}, mayar da jerin n-bit da aka lura (string), sannan a maimaita da yawa. sau dubu ko miliyoyi. A ƙarshe, ta yin amfani da iliminsa na C, mai gwajin ya yi gwajin ƙididdiga don ganin ko sakamakon ya yi daidai da abin da ake sa ran daga kwamfutar ƙididdiga.
A taqaice sosai:
- An ƙirƙiri da'ira bazuwar tsayin 20 na qubits 53 ta amfani da ƙofofi
- Da'irar tana farawa da yanayin farko [0…0] don aiwatarwa
- Fitowar da'ira shine kirtani bazuwar (samfurin)
- Rarraba sakamakon ba da gangan ba (tsangwama)
- Ana kwatanta rarraba samfuran da aka samu tare da wanda ake tsammani
- Ya Kammala Ƙimar Ƙimar Ƙidaya
Wato Google ya aiwatar da wata matsala ta roba akan na'ura mai nauyin 53 qubit, kuma ya kafa da'awarsa na samun fifikon ƙididdiga akan gaskiyar cewa ba zai yuwu a yi koyi da irin wannan na'ura akan daidaitaccen tsarin a cikin lokaci mai dacewa ba.
Don fahimta - Wannan sashe ba zai rage nasarar Google ta kowace hanya ba, injiniyoyin suna da girma sosai, kuma tambayar ko ana iya la'akari da ƙimar ƙimar ƙimar gaske ko a'a, kamar yadda aka ambata a baya, ya fi ilimin falsafa fiye da injiniyanci. Amma dole ne mu fahimci cewa kasancewar mun sami irin wannan fifikon lissafi, ba mu ci gaba da mataki ɗaya ba zuwa ikon gudanar da algorithm na Shor akan lambobi 2048-bit.
Takaitaccen
Kwamfutoci na ƙididdiga da ƙididdiga masu ƙididdigewa abu ne mai ban sha'awa, matasa sosai kuma ya zuwa yanzu ƙananan masana'antu da ake amfani da su na fasahar bayanai.
Haɓaka ƙididdigar ƙididdiga (wata rana) zai ba mu damar magance matsaloli:
- Samfuran hadadden tsarin jiki a matakin adadi
- Ba za a iya warwarewa akan kwamfuta ta yau da kullun ba saboda rikiɗar lissafi
Babban matsalolin ƙirƙira da sarrafa kwamfutocin ƙididdiga:
- Rashin daidaituwa
- Kurakurai (rashin daidaituwa da kofa)
- Tsarin gine-ginen sarrafawa (cikakken haɗin haɗin qubit)
Halin halin yanzu:
- A gaskiya - farkon farkon .
- Babu wani cin kasuwa na GASKIYA tukuna (kuma ba a san lokacin da za a yi ba)
Abin da zai iya taimakawa:
- Wani nau'in ganowar jiki wanda ke rage farashin wayoyi da na'urori masu sarrafawa
- Gano wani abu wanda zai ƙara lokacin rashin daidaituwa ta tsari mai girma da/ko rage kurakurai
A ra'ayina (zallar sirri ra'ayi), A cikin yanayin ilimin kimiyya na yanzu, ba za mu sami gagarumar nasara ba wajen haɓaka fasahar ƙididdiga, a nan muna buƙatar ci gaba mai mahimmanci a wasu fannoni na asali ko ilimin kimiyya, wanda zai ba da karfi ga sababbin ra'ayoyi da hanyoyi.
A halin yanzu, muna samun gogewa a cikin shirye-shiryen ƙididdiga, tattarawa da ƙirƙirar algorithms na ƙididdiga, gwajin ra'ayoyin, da sauransu, da sauransu. Muna jiran ci gaba.
ƙarshe
A cikin wannan makala, mun zayyana muhimman matakai wajen samar da kwamfutoci na quantum computing da kwamfutoci masu yawa, mun yi nazari kan ka’idar aikinsu, mun yi nazari kan manyan matsalolin da injiniyoyi ke fuskanta wajen ci gaba da sarrafa na’urorin sarrafa kwamfutoci, da kuma duba menene Multi-qubit. D-kwamfutoci a zahiri sune. Wave da sanarwar Google na kwanan nan na samun fifikon ƙima.
A baya bayan fage akwai tambayoyi na shirye-shiryen kwamfutoci masu yawa (harsuna, hanyoyin da za a bi, hanyoyin da sauransu) da kuma tambayoyin da suka shafi takamaiman aiwatar da na'urori masu sarrafawa, yadda ake sarrafa qubits, haɗawa, karantawa, da sauransu. Wataƙila wannan shi ne batun talifi ko talifi na gaba.
Na gode da kulawar ku, ina fata wannan labarin zai zama da amfani ga wani.
(DA)
Godiya
don tantancewa da sharhi kan rubutun tushe, da kuma labarin
don ƙarin bayani game da sharhi , kuma ba ita kaɗai ba, wanda ya taimaka mini in gano wannan wuyar warwarewa.
Zuwa ga duk marubutan labarai da wallafe-wallafe waɗanda aka yi amfani da kayan aikinsu wajen rubuta wannan labarin.
Jerin albarkatun
Labaran al'amuran yau da kullun daga [The National Academies Press]
Labarai daga Habr (a cikin bazuwar tsari)
Abubuwan da ba a rarraba (amma ba ƙasa da ban sha'awa) daga Intanet ba
Darussa da laccoci
source: www.habr.com