Re:Quantum computing device hints at powerful future
by gjm11 on Tuesday March 22, 2011 @06:24AM
(#2353747)
Quantum computers are not known to be able to solve NP-complete problems in polynomial time. (Assuming for the sake of argument that we can actually build them.)
There are problems -- factorization, as others have already said, is the commonest example -- that (1) are not known to be solvable classically in a reasonable amount of time and (2) are known to be solvable by a quantum computer in a reasonable amount of time. But they aren't NP-complete problems.
Re:Quantum computing device hints at powerful future
by vmind on Tuesday March 22, 2011 @07:01AM
(#2353809)
Quantum Computers are able to solve problems of complexity BQP in polynomial time. BQP is suspected to cover all problems in P, some in NP (but not NP-complete), and some outside of NP but in PSPACE. (http://en.wikipedia.org/wiki/BQP)
Take the 3-sat problem, for example. It takes a very long time for conventional algorithms to produce a correct answer; but, given a potential solution, it takes very little time to check for correctness. It's this area that quantum computers could shine in. Get a potential answer from the machine and check its accuracy very quickly. If wrong, try again.
[edit: if I misunderstand quantum computers, forgive me. This is just what I thought their allure was]