Freiza Grandmaster Cheater
Reputation: 22
Joined: 28 Jun 2010 Posts: 662
|
Posted: Thu May 03, 2012 2:25 pm Post subject: Quantum Computers Vs Np-Hard Solutions |
|
|
I often hear Michio Kaku stating that Quantum Computer are too powerful and can decrypt any RSA algorithm in acceptable time.
Hence the world is struggling hard for next generation of computing. But what I feel is instead of turning a normal computer to a super computer. We should focus more on Np-Complete problems and its solution.
What do you think?
Quantum computer vs Np-Hard Solutions.
I vote for NP-hard solutions. Because I think (infact I know) the solution to np-hard will turn a ordinary calculator into a supercomputer and will be more powerful than galaxy of Distributed Quantum Computers.
What is your opinion?
_________________
|
|