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 PreskillEvidence Quote
“some brilliant student may come along tomorrow and come up with factoring algorithm, that's possible”
Created: 6/13/2026, 12:07:35 AM
Your notes
Loading notes...