Slashdot Mirror
D-Wave Large-Scale Quantum Chip Validated, Says USC Team
An anonymous reader writes "A team of scientists says it has verified that quantum effects are indeed at work in the D-Wave processor, the first commercial quantum optimization computer processor. The team demonstrated that the D-Wave processor behaves in a manner that indicates that quantum mechanics has a functional role in the way it works. The demonstration involved a small subset of the chip's 128 qubits, but in other words, the device appears to be operating as a quantum processor."
Wrong kind of quantum computer. This does quantum annealing.
W..w..W - Willy Waterloo washes Warren Wiggins who is washing Waldo Woo.
Well, I can tell you that no amount of computation will help for a one-time pad. That would be essentially the same as decrypting an empty sheet of paper. There is no information in either half of an OTP duo; only in the differences between the halves.
You can't fight an exponential or even polynomial complexity merely by reducing constant factors. It doesn't matter what the constant factor is. All it takes is bumping, say, RSA from 4096 to 16384 bits. That's all you need to beat any conceivable reduction in the constant factor. Just think about it.
A successful API design takes a mixture of software design and pedagogy.
Why would a quantum computer would reduce the O notation?
Because it's running in multiple worlds simultaneously? It's not just using 1's and 0's but superpositions of the two that are effectively in both states at once. Heh... I'm really don't understand this stuff, but the big deal about quantum computing is that it will make some previously intractable (e.g., non-polynomial) problems accessible to us. All problems in complexity class BQP become, essentially, polynomial on a quantum computer. If you've got enough qbits, among other things.
-1, Too Many Layers Of Abstraction
I am pretty sure that this 7-month-old arXiv preprint corresponds to the Nature Communications paper. The titles and author lists are identical, but the abstract deviates, so who knows what changes it went through in revision (I don't have access to the official paper either, even at the university where I work). But presumably it covers the same ground, and it looks like all of the figures from the official are in the preprint.
(Yo, fuck Nature Publishing Group.)
Pedantic nitpick: Quantum computers cannot break public key (RSA) encryption in O(1) time; for a modulus N the time complexity is O(Log(n)^3).