![]() The number of bits of answer you can get out of a quantum computer depends on the precision to which you can measure its output - does this hit Heisenberg limits? 10**47 is only ~140 bits. The biggest quantum computer made so far was able to factor 15 into 5 x 3. They're not off the shelf, and won't be any time soon. It's not clear that it will work, but it's the only thing so far that doesn't hit the "well, if you build a keycracking computer the size of the planet and run it for the remaining age of the solar system, I can add three more key bits and make you take over some more planets" wall. The interesting thing about quantum computing is that it's the one technology that, if it's actually possible to develop usable machines with it, might offer the possibility of getting beyond the exponential-difficulty traps in factoring and other current techniques of public-key math. There may be deterministic algorithms a bit faster than NFS (it's got lots of relatives), but they're mostly in the same general range. ![]() With problems like factorization, it's fast and trivial to determine whether an answer was correct or incorrect, but not obvious what to do about an incorrect one. ![]() ![]() Quantum computers aren't deterministic - the techniques that have been discussed have non-trivial chances of getting incorrect answers. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |