▁in ▁time ▁ ▁for ▁a ▁system ▁with ▁n ▁phot ons ▁and ▁m ▁output ▁modes . ▁Bos on Sam pling ▁is ▁an ▁open - source ▁implementation ▁in ▁R . ▁The ▁algorithm ▁leads ▁to ▁an ▁estimate ▁of ▁ 5 0 ▁phot ons ▁required ▁to ▁demonstrate ▁quantum ▁supre m acy ▁with ▁bos on ▁sampling . ▁ ▁Sam pling ▁the ▁output ▁distribution ▁of ▁random ▁quantum ▁circ uits ▁ ▁The ▁best ▁known ▁algorithm ▁for ▁sim ulating ▁an ▁arbitrary ▁random ▁quantum ▁circuit ▁requires ▁an ▁amount ▁of ▁time ▁that ▁scales ▁expon entially ▁with ▁the ▁number ▁of ▁qu bits , ▁leading ▁one ▁group ▁to ▁estimate ▁that ▁around ▁ 5 0 ▁qu bits ▁could ▁be ▁enough ▁to ▁demonstrate ▁quantum ▁supre m acy . ▁Google ▁had ▁announced ▁its ▁intention ▁to ▁demonstrate ▁quantum ▁supre m acy ▁by ▁the ▁end ▁of ▁ 2 0 1 7 ▁by ▁construct ing ▁and ▁running ▁a ▁ 4 9 - qu bit ▁chip ▁that ▁will ▁be ▁able ▁to ▁sample ▁distributions ▁in access ible ▁to ▁any ▁current ▁classical ▁computers ▁in ▁a ▁reasonable ▁amount ▁of ▁time . ▁But ▁the ▁largest ▁quantum ▁circuit ▁simulation ▁completed ▁successfully ▁on ▁a ▁super comput er ▁now ▁contains ▁ 5 6 ▁qu bits . ▁This ▁may ▁require ▁increasing ▁the ▁number ▁of ▁qu bits ▁to ▁demonstrate ▁quantum ▁supre m acy . ▁On ▁October ▁ 2 3 , ▁ 2 0 1 9 , ▁Google ▁published ▁ ▁the ▁results ▁of ▁this ▁quantum ▁supre m acy ▁experiment ▁in ▁the ▁Nature ▁article , ▁“ Quant um ▁Sup rem acy ▁Using ▁a ▁Program m able ▁Super con duct ing ▁Process or ”