4 ms·
The article neglects to mention the strange behavior of quantum computers that allow them to seek ALL possible keys simultaneously.
by douglaswlance 9y ago
The article neglects to mention the strange behavior of quantum computers that allow them to seek ALL possible keys simultaneously.
- throwanem 9y agoVouched so I can ask what you're talking about - what sources can you cite that suggest any such capability exists?
- ifdefdebug 9y ago"If you take just one piece of information from this blog: Quantum computers would not solve hard search problems instantaneously by simply trying all the possible solutions at once." - Scott Aaronson https://www.scottaaronson.com/blog/ https://www.scottaaronson.com/blog/
- Y_Y 9y agoClassical searches are O(N). Grover's (quantum) algorithm can perform such searches in O(N^(1/2)) and is optimal, so what you're talking about can't be faster than that (without nonlocal variables or some nonsense like that).