factual

Hardness of factoring and simulation is empirical not proven

We cannot prove from first principles that factoring or quantum simulation problems are classically hard—factoring is not even known to be NP-hard; our confidence rests on the empirical fact that very smart people have tried for decades to find better classical algorithms and failed, which means a brilliant student could in principle discover an efficient classical algorithm tomorrow.

factualpending

Speaker

John Preskill

Evidence Quote

“some brilliant student may come along tomorrow and come up with factoring algorithm, that's possible”

Source

153 | John Preskill on Quantum Computers and What They're Good For— Sean Carroll's Mindscape
Created: 6/13/2026, 12:07:35 AM

Your notes

Loading notes...