I gave an online presentation on my quantum computing skepticism, and it is now
posted. Thanks to the sponsors for making this happen,
and persisting in the face of criticism from enthusiasts.
Hi Roger, thanks for posting the link to your presentation! Shor's algorithm really is OUTRAGEOUS. These charlatans have gotten away with handwaiving away an order of polynomial amount of calculation, and then calling that a PROOF. Standard factoring algorithms (GNFS, Lenstra elliptic-curve factorization, etc) run with subexponential running time complexity. Shor claims to majickally reduce that run time to polynomial run time complexity. Ok, if they want to CLAIM that they achieve that by utilizing a physical phenomenon, FINE. Then it should be required to ACTUALLY DEMONSTRATE that. It should be easy to demonstrate physical phenomena. But they have never even attempted it. Rather they say "this is an exercise for whomever" and claim their proof of the runtime of the algorithm to be complete and valid!
Hi Roger, thanks for posting the link to your presentation! Shor's algorithm really is OUTRAGEOUS. These charlatans have gotten away with handwaiving away an order of polynomial amount of calculation, and then calling that a PROOF. Standard factoring algorithms (GNFS, Lenstra elliptic-curve factorization, etc) run with subexponential running time complexity. Shor claims to majickally reduce that run time to polynomial run time complexity. Ok, if they want to CLAIM that they achieve that by utilizing a physical phenomenon, FINE. Then it should be required to ACTUALLY DEMONSTRATE that. It should be easy to demonstrate physical phenomena. But they have never even attempted it. Rather they say "this is an exercise for whomever" and claim their proof of the runtime of the algorithm to be complete and valid!
ReplyDelete