Quantum computers just beat classical ones — Exponentially and unconditionally

A probe squad has achieved the beatified grail of quantum computing: an exponential speedup that’s unconditional. By utilizing clever mistake correction and IBM’s almighty 127-qubit processors, they tackled a saltation of Simon’s problem, showing quantum machines are present breaking escaped from classical limitations, for real.