Quantum computers are not known to be able to solve NP-complete problems in polynomial time,
and can be simulated classically with exponential slowdown.
This entry was posted
on Sunday, January 20th, 2013 at 1:45 pm and is filed under .
You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.
