Skip to main content

Home/ Coders/ Group items tagged quantum computing

Rss Feed Group items tagged

Fabien Cadet

Shtetl-Optimized » Blog Archive » Fighting Hype with Hype - 2 views

  • In the end, they conclude that NP-complete problems are just as hard on an adiabatic quantum computer as on a classical computer. And, since earlier work showed the equivalence between different variants of quantum computers, that pretty much shuts down the possibility of any quantum computer helping with NP-complete problems.
  •  
    [...] quantum computers don't help with NP-complete problems ?
1 - 2 of 2
Showing 20 items per page