Why am I not suprised.
It's like hoping a quantum computer will make understanding quantum mechanics easier. Not gonna happen LOL!
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.
Thursday, June 3, 2010
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment