News for hackers. Stuff that matters.
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by Gladdyu on Wednesday July 22, 2015 @07:20AM (#9928900)
In essence, if this algorithm is correct, for quantum computers it holds that P = NP, which means that every problem for which the answer can be checked in polynomial time, you can also compute the answer in polynomial time.
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by marcosdumay on Wednesday July 22, 2015 @09:09AM (#9929356)
Polynomial time in a quantum computer is called QP. (The same way that polynomial time in a non deterministic computer is called NP.)
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by jflatow on Wednesday July 22, 2015 @11:50AM (#9930318)
Isn't it actually only showing that BQP contains NP, not P = NP?