Re:Quantum computers no better than classical ones for NP-co...
by sanxiyn on Friday June 04, 2010 @01:38AM
(#1403599)
I don't believe this. If this were true, it would imply that the decision version of the integer factorization problem is not NP-complete. That sounds too good to be true.
[ Parent
| on HN ]
Re:Quantum computers no better than classical ones for NP-co...
by sirclueless on Friday June 04, 2010 @06:28AM
(#1403947)
As far as I can tell, D-Wave's adiabatic quantum computer has never demonstrated polynomial-time factoring either. The result mentioned in ars technica (DOI link is down, and a scholar search didn't find it) might also invalidate the use of said computer for this purpose.