In essence, if this algorithm is correct, for quantum computers it holds that P ... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		Gladdyu on July 22, 2015 \| parent \| context \| favorite \| on: A Polynomial Time Bounded-Error Quantum Algorithm ... 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.

marcosdumay on July 22, 2015 | [–]

Polynomial time in a quantum computer is called QP. (The same way that polynomial time in a non deterministic computer is called NP.)

jflatow on July 22, 2015 | [–]

Isn't it actually only showing that BQP contains NP, not P = NP?

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact