When we talk about quantum computing versus traditional systems, there are lots of examples we can give where a quantum computer provides an advantage. But it's hard to find an example of a problem that a quantum computer can solve, and a traditional computer can't, even if it takes a long time.
Until now.
Given two pseudo-random number generators, can you tell if they really are separate and independently producing numbers? Or, is one simply a function, somehow, of the other?
Turns out, you can get a quantum computer to answer this question, while a traditional computer never can.
(And it even has security implications, since "randomness" is so important to cryptography, and cryptography is so important to so many other security controls ...)
(Now, if we could only get some quantum computers up and running ...)
............
Other posts: https://community.isc2.org/t5/forums/recentpostspage/user-id/1324864413
This message may or may not be governed by the terms of
http://www.noticebored.com/html/cisspforumfaq.html#Friday or
https://blogs.securiteam.com/index.php/archives/1468
