▁in ▁which ▁they ▁developed ▁a ▁new ▁ 5 3 - qu bit ▁processor , ▁named ▁“ S yc am ore ”, ▁that ▁is ▁made ▁of ▁fast , ▁high - f idel ity ▁quantum ▁logic ▁gates , ▁in ▁order ▁to ▁perform ▁the ▁benchmark ▁testing . ▁Google ▁claims ▁that ▁their ▁machine ▁performed ▁the ▁target ▁computation ▁in ▁ 2 0 0 ▁seconds , ▁and ▁estimated ▁that ▁their ▁classical ▁algorithm ▁would ▁take ▁ 1 0 , 0 0 0 ▁years ▁in ▁the ▁world ’ s ▁fast est ▁super comput er ▁to ▁solve ▁the ▁same ▁problem . ▁IBM ▁disput ed ▁this ▁claim , ▁saying ▁that ▁an ▁improved ▁classical ▁algorithm ▁should ▁be ▁able ▁to ▁solve ▁that ▁problem ▁in ▁two ▁and ▁a ▁half ▁days ▁in ▁that ▁same ▁super comput er . ▁ ▁S ke ptic ism ▁Quant um ▁computers ▁are ▁much ▁more ▁sus cept ible ▁to ▁errors ▁than ▁classical ▁computers ▁due ▁to ▁de co her ence ▁and ▁noise . ▁The ▁threshold ▁theorem ▁states ▁that ▁a ▁no isy ▁quantum ▁computer ▁can ▁use ▁quantum ▁error - correct ing ▁codes ▁to ▁simulate ▁a ▁no is eless ▁quantum ▁computer ▁assuming ▁the ▁error ▁introduced ▁in ▁each ▁computer ▁cycle ▁is ▁less ▁than ▁some ▁number . ▁N umer ical ▁simulations ▁suggest ▁that ▁that ▁number ▁may ▁be ▁as ▁high ▁as ▁ 3 %. ▁However , ▁it ▁is ▁not ▁known ▁how ▁the ▁resources ▁needed ▁for ▁error ▁correction ▁will ▁scale ▁with ▁the ▁number ▁of ▁qu bits . ▁S ke pt ics ▁point ▁to ▁the ▁unknown ▁behavior ▁of ▁noise ▁in ▁scale d - up ▁quantum ▁systems ▁as ▁a ▁potential ▁road block