▁of ▁quantum ▁computing . ▁ ▁Ex amples ▁of ▁propos als ▁to ▁demonstrate ▁quantum ▁supre m acy ▁include ▁the ▁bos on ▁sampling ▁proposal ▁of ▁A ar ons on ▁and ▁Ark hip ov , ▁D - W ave ' s ▁special ized ▁fr ustr ated ▁cluster ▁loop ▁problems , ▁and ▁sampling ▁the ▁output ▁of ▁random ▁quantum ▁circ uits . ▁ ▁Like ▁factor ing ▁integers , ▁sampling ▁the ▁output ▁distributions ▁of ▁random ▁quantum ▁circ uits ▁is ▁believed ▁to ▁be ▁hard ▁for ▁classical ▁computers ▁based ▁on ▁reasonable ▁complexity ▁assumptions . ▁Google ▁previously ▁announced ▁plans ▁to ▁demonstrate ▁quantum ▁supre m acy ▁before ▁the ▁end ▁of ▁ 2 0 1 7 ▁by ▁solving ▁this ▁problem ▁with ▁an ▁array ▁of ▁ 4 9 ▁super con duct ing ▁qu bits . ▁In ▁early ▁January ▁ 2 0 1 8 , ▁Intel ▁announced ▁a ▁similar ▁hardware ▁program . ▁ ▁In ▁October ▁ 2 0 1 7 , ▁IBM ▁demonstrated ▁the ▁simulation ▁of ▁ 5 6 ▁qu bits ▁on ▁a ▁conventional ▁super comput er , ▁increasing ▁the ▁number ▁of ▁qu bits ▁needed ▁for ▁quantum ▁supre m acy . ▁In ▁November ▁ 2 0 1 8 , ▁Google ▁announced ▁a ▁partners hip ▁with ▁NASA ▁that ▁would ▁“ analy ze ▁results ▁from ▁quantum ▁circ uits ▁run ▁on ▁Google ▁quantum ▁process ors , ▁and ... ▁provide ▁compar isons ▁with ▁classical ▁simulation ▁to ▁both ▁support ▁Google ▁in ▁valid ating ▁its ▁hardware ▁and ▁establish ▁a ▁bas eline ▁for ▁quantum ▁supre m acy .” ▁The oret ical ▁work ▁published ▁in ▁ 2 0 1 8 ▁suggests ▁that ▁quantum ▁supre