{"id":42530,"date":"2025-11-18T13:18:08","date_gmt":"2025-11-18T13:18:08","guid":{"rendered":"https:\/\/www.europesays.com\/lt\/42530\/"},"modified":"2025-11-18T13:18:08","modified_gmt":"2025-11-18T13:18:08","slug":"pirmasis-gedimams-atsparus-kvantinis-procesorius-ibm-pristate-viska-keicianti-loon-modeli","status":"publish","type":"post","link":"https:\/\/www.europesays.com\/lt\/42530\/","title":{"rendered":"Pirmasis gedimams atsparus kvantinis procesorius: IBM pristat\u0117 visk\u0105 kei\u010diant\u012f \u201eLoon\u201c model\u012f"},"content":{"rendered":"<p>Iki 2029 m. IBM planuoja pristatyti \u201eStarling\u201c \u2013 pirm\u0105j\u012f komercin\u012f gedimams atspar\u0173 kvantin\u012f kompiuter\u012f, pagr\u012fst\u0105 nauja architekt\u016bra ir pa\u017eangesniu qLDPC klaid\u0173 taisymo algoritmu.\u00a0<\/p>\n<p>Pirmasis \u0161i\u0173 plan\u0173 \u012fgyvendinimo variantas yra eksperimentinis kvantinis procesorius \u201eLoon\u201c, kur\u012f IBM apib\u016bdina kaip pirm\u0105j\u012f sprendim\u0105, apimant\u012f visus pagrindinius komponentus, b\u016btinus gedimams atspariam kvantiniam skai\u010diavimui.<\/p>\n<p>IBM \u201eLoon\u201c procesorius pad\u0117s i\u0161bandyti nauj\u0105 architekt\u016br\u0105 b\u016bsimoms didelio masto kvantinio skai\u010diavimo platformoms ir pritaikyti komponentus, b\u016btinus praktiniam ir labai efektyviam kvantini\u0173 klaid\u0173 taisymui.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" style=\"aspect-ratio:632\/356;\" src=\"https:\/\/bilis.lt\/assets\/nuotraukos\/_tekstuose\/991980\/cuples.avif?transformId=367269\" width=\"632\" height=\"356\" alt=\"\"\/><\/p>\n<p>IBM anks\u010diau pademonstravo kai kurias revoliucines funkcijas, kurias, anot jos, \u012fdiegs \u0161iame procesoriuje, pvz., keli\u0173, auk\u0161tos kokyb\u0117s, ma\u017eo nuostolio mar\u0161rutizavimo sluoksni\u0173 \u012fdiegim\u0105, kad b\u016bt\u0173 galima sukurti ilgesnius lust\u0173 sujungimus (arba C ry\u0161ius), kurie t\u0119siasi u\u017e artimiausi\u0173 kaimyn\u0173 jung\u010di\u0173 rib\u0173 ir fizi\u0161kai sujungia nuotolinius kubitus tame pa\u010diame luste, taip pat kubit\u0173 atstatymo technologijas tarp skai\u010diavim\u0173.<\/p>\n<p>Per\u0117jimas nuo artimiausio kaimyno kubit\u0173 jung\u010di\u0173 prie nuotolini\u0173, be kita ko, palengvins pavir\u0161utini\u0161k\u0173 klaid\u0173 taisymo kod\u0173 atsisakym\u0105 kvantin\u0117ms sistemoms, pirmenyb\u0119 teikiant kvantiniam ma\u017eo tankio pariteto patikrinimui (qLDPC). \u201eTeigiama, kad naudojant \u0161i\u0105 schem\u0105 vietoj pavir\u0161utini\u0161ko algoritmo, fizini\u0173 kubit\u0173, reikaling\u0173 vienam loginiam kubitui \u012fgyvendinti, skai\u010dius suma\u017e\u0117s ma\u017edaug eil\u0117s dyd\u017eiu.\u201c Tai yra rezervas, kuris gal\u0117t\u0173 suteikti IBM prana\u0161um\u0105 siekiant taip giriamo kvantinio prana\u0161umo.<\/p>\n<p>\u201eLoon\u201c architekt\u016bros galimybi\u0173 sujungimas su klasikini\u0173 kompiuteri\u0173 kvantiniu klaid\u0173 taisymu bus \u017eingsnis, kuris grei\u010diausiai priartins IBM superlaid\u017eias kvantines platformas prie praktin\u0117s vert\u0117s. Beje, IBM taip pat \u012frod\u0117, kad klasikin\u0117 skai\u010diavimo \u012franga gali b\u016bti naudojama tiksliai dekoduoti klaidas realiuoju laiku naudojant qLDPC kodus (per ma\u017eiau nei 480 ns). Ir \u0161is techninis prover\u017eis buvo pasiektas metais anks\u010diau nei planuota.<\/p>\n<p><img loading=\"lazy\" decoding=\"async\" style=\"aspect-ratio:632\/356;\" src=\"https:\/\/bilis.lt\/assets\/nuotraukos\/_tekstuose\/991982\/ibm_300.avif?transformId=367268\" width=\"632\" height=\"356\" alt=\"\"\/><\/p>\n<p>Nor\u0117dama i\u0161leisti lustus su \u201eLoon QPU\u201c architekt\u016bra, bendrov\u0117 prad\u0117jo naudoti 300 mm gamybos linijas Albany NanoTech gamykloje Niujorke. \u0160i gamykla ka\u017ekada buvo prakti\u0161kai pa\u010dios IBM, ta\u010diau nuo 2000-\u0173j\u0173 vidurio verslo optimizavimas privert\u0117 bendrov\u0119 atsisakyti \u0161io na\u0161ta apkrauto turto. Tuo pa\u010diu metu IBM i\u0161lieka pagrindine centro kliente ir dabar perk\u0117l\u0117 ten savo kvantini\u0173 procesori\u0173 k\u016brim\u0105.<\/p>\n<p>Centro pa\u017eangiausia puslaidininki\u0173 \u012franga ir nepertraukiamo veikimo galimyb\u0117s jau paspartino darbuotoj\u0173 mokym\u0105, tobulinim\u0105 ir IBM kvantini\u0173 procesori\u0173 galimybi\u0173 pl\u0117tr\u0105, leisdamos bendrovei padidinti prijungt\u0173 kubit\u0173 skai\u010di\u0173, j\u0173 tank\u012f ir na\u0161um\u0105.<\/p>\n<p>Iki \u0161iol IBM padvigubino savo tyrim\u0173 ir pl\u0117tros greit\u012f, bent perpus suma\u017eindama kiekvieno naujo procesoriaus suk\u016brimo laik\u0105; de\u0161imteriopai padidino kvantini\u0173 lust\u0173 fizin\u012f sud\u0117tingum\u0105 ir \u012fgijo galimyb\u0119 vienu metu tirti ir studijuoti kelis projektus. \u201eKozodoy\u201c ir \u201eGagara\u201c procesoriai tapo realybe daugiausia d\u0117l per\u0117jimo prie 300 mm plok\u0161teli\u0173 gamybos, kuri suteiks IBM dar vien\u0105 prana\u0161um\u0105 lenktyn\u0117se d\u0117l kvantin\u0117s vir\u0161enyb\u0117s.<\/p>\n","protected":false},"excerpt":{"rendered":"Iki 2029 m. IBM planuoja pristatyti \u201eStarling\u201c \u2013 pirm\u0105j\u012f komercin\u012f gedimams atspar\u0173 kvantin\u012f kompiuter\u012f, pagr\u012fst\u0105 nauja architekt\u016bra ir&hellip;\n","protected":false},"author":2,"featured_media":42531,"comment_status":"","ping_status":"","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[17],"tags":[11116,11112,81,11115,11114,11113,37,39,36,38,40,10004,801,923,275,46,1361],"class_list":{"0":"post-42530","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-verslas","8":"tag-loon","9":"tag-atsparus","10":"tag-business","11":"tag-gedimams","12":"tag-keicianti","13":"tag-kvantinis","14":"tag-lietuva","15":"tag-lietuviu","16":"tag-lithuania","17":"tag-lithuanian","18":"tag-lt","19":"tag-modeli","20":"tag-pirmasis","21":"tag-pristate","22":"tag-procesorius","23":"tag-verslas","24":"tag-viska"},"share_on_mastodon":{"url":"https:\/\/pubeurope.com\/@lt\/115570901253768165","error":""},"_links":{"self":[{"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/posts\/42530","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/comments?post=42530"}],"version-history":[{"count":0,"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/posts\/42530\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/media\/42531"}],"wp:attachment":[{"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/media?parent=42530"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/categories?post=42530"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.europesays.com\/lt\/wp-json\/wp\/v2\/tags?post=42530"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}