If I understand correctly, a quantum computer might solve problems in
NP in polynomial time, which is assumed not to be possible for
deterministic computers.

No! Moreover, there is a hypothesis that the only problems quantum computer can solve in polynomial time are those that the usual computer can.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe

Reply via email to