2 ms·
Isn't this what quantum computing wanted to achieve? What's next? Amoeba-resistant encryption algorithms?
by xyproto 8y ago
Isn't this what quantum computing wanted to achieve?
What's next? Amoeba-resistant encryption algorithms?
- QML 8y agoNot really: NP-hard problems are a set of a decision problems "does a route shorter than x exist?" while in quantum computing, we know an answer exists but the question is obtaining it. E.g. the factors of a number always exist.