Re:Factoring may be easier than we think (2016)
by daveFNbuck on Sunday June 30, 2019 @08:46PM
(#20321574)
So we shouldn't take research into things that don't exist yet seriously?
[ Parent
| on HN ]
Re:Factoring may be easier than we think (2016)
by scottlocklin on Monday July 01, 2019 @09:49AM
(#20325195)
Designing algorithms for a computer architecture that assumes matter behaves in a fairly trivially unphysical way sure seems like a glass bead game to me. Especially considering the hype and baloney around this particular one. There are zero actual quantum computer designs (aka error corrected and capable of factoring large or even small integers into primes) under construction: but everyone runs around like chicken little declaring the sky is falling.
I went to a Gordon conference on this subject in the 1990s; as far as I can tell, there has been zero progress in the topic since then. Sure are a lot of press releases though!
Re:Factoring may be easier than we think (2016)
by doubleunplussed on Monday July 01, 2019 @02:07PM
(#20328065)
At what odds would you bet that we won't see a quantum computer outperforming a classical computer on any problems in the next, say, 20 years?