Re:Scott’s Supreme Quantum Supremacy FAQ
by dcposch on Monday September 23, 2019 @09:11PM
(#21055477)
The claim here is that they're about to demonstrate QC on a specific hard sampling problem , where one small quantum computer will produce a result in minutes that takes a months on a big cluster of classical computers.
That is still clearly quantum supremacy, even if Shor's algorithm is not yet implementable.
That is still clearly quantum supremacy, even if Shor's algorithm is not yet implementable.