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."

15 of 141 comments (clear)

  1. It Still Doesn't Mean Much... by tibit · · Score: 3, Interesting

    Yeah, quantum effects are directly noticeable in the way it operates. Yeah, yeah, whatever. The whole deal isn't about that. It's about whether those quantum effects are actually useful for something. Like, um, making it usefully faster than classical computers. I would be very happy even if they had shown "just" polynomial running time improvements, say executing an O(N^3) algorithm in O(N^2) time. Even that would be a big deal. Somehow, I'm very skeptical that anything of the sort will ever be shown for this particular architecture. I would so like to be wrong on that.

    --
    A successful API design takes a mixture of software design and pedagogy.
    1. Re:It Still Doesn't Mean Much... by tibit · · Score: 3, Informative

      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.
    2. Re:It Still Doesn't Mean Much... by firewrought · · Score: 4, Informative

      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
    3. Re:It Still Doesn't Mean Much... by __aaltlg1547 · · Score: 3, Insightful

      No it hasn't.

    4. Re:It Still Doesn't Mean Much... by Anonymous Coward · · Score: 3, Informative

      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).

  2. Great Scott! by Anonymous Coward · · Score: 5, Funny

    Great... now the NSA can record everything we do *and* everything we don't do in all possible parallel universes... Welp, the analog world was nice while it lasted I guess.

    -- stoops

  3. What about maintenance? by jennatalia · · Score: 5, Funny

    Are we going to need quantum mechanics to work on these chips and computers?

  4. Re:The question is by MightyYar · · Score: 4, Informative

    Wrong kind of quantum computer. This does quantum annealing.

    --
    W..w..W - Willy Waterloo washes Warren Wiggins who is washing Waldo Woo.
  5. Re:The question is by WaywardGeek · · Score: 4, Interesting

    Not too surprisingly, when a large US military contractor became a major purchaser of D-Wave equipment, all the company claims about being able to factor large integers vanished. D-Wave was going to have a blog series on it. I looked at it's architecture carefully, and yes, if the D-Wave machine has low enough noise, then a 512-qbit D-Wave machine should be able to factor integers close to 500 bits long. The next bigger machine could tackle 2,000 bit integers. The machine seems almost perfectly suited to this problem. The trick is dealing with noise. No one at D-Wave claims that their machine is perfectly coherent all the time during the annealing process. If 1 of the 512 bits suddenly drops out of quantum coherence, it will still act like a normal simulated annealing element until it re-enters coherence. Is noise like that enough to throw off detection of that one minimum solution? I don't know. I do feel that quantum effects will have a positive impact up to some temperature, after which it will just act like a normal annealing machine. I think there will be a phase change at some temperature where instead of qbits occasionally dropping out of coherence, just adding some noise to the solution, there will be so many out of quantum coherence that they will not be able to function at a chip-wide quantum level, and there will be no chance of finding that minimum energy solution.

    --
    Celebrate failure, and then learn from it - Nolan Bushnell
  6. Re:Was anyone really surprised by this? by timeOday · · Score: 4, Informative

    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.

  7. Re:2 Standard Questions to Evaluate any tech by guruevi · · Score: 4, Funny

    1) Yes
    2) No
    --next calculation--
    1) No
    2) Yes

    --
    Custom electronics and digital signage for your business: www.evcircuits.com
  8. Re:The question is by WaywardGeek · · Score: 3, Interesting

    I just went googling for my old posts about how to do integer factorization with D-Wave. Guess what? GONE! I thought I'd posted it in enough hard to scrub places... Anyway, all this machine is does is minimize an energy equation. I found somebody who had integer factorization coded as an energy equation as the sum of squared terms, but with the D-Wave machine, it does that naturally, and you don't need to square anything. I've got a lot going on at work, my mother is being sued, and I'm doing some genetics stuff. Do I really need to go back and recreate the integer factoring equation?

    --
    Celebrate failure, and then learn from it - Nolan Bushnell
  9. Re:The question is by BradleyUffner · · Score: 5, Funny

    I just went googling for my old posts about how to do integer factorization with D-Wave. Guess what? GONE!

    That's what you get for observing them.

  10. Re:Was anyone really surprised by this? by the+gnat · · Score: 4, Interesting

    No, I mean the 439 benchmark just recently that absolutely destroyed classic computers. Mere seconds compared to over half an hour quicker.

    That was a terrible benchmark. They measured performance against possibly the most inefficient algorithm possible (using a third-party implementation) - not even remotely doing the same type of computations. That was where the "3600-fold" improvement came from. Some other computer scientists spent a bit of time optimizing an algorithm (also annealing, I think) for conventional computers in response, with the eventual result that their implementation was faster than the D-Wave. Which makes the entire effort sound like $10 million to avoid writing better software in the first place.

    It vaguely reminds me of all of the GPU benchmarks I've seen where single-precision floating-point performance on the GPU is compared to double-precision performance on the CPU. Except orders of magnitude worse.

  11. Re:I don't get it. by the+gnat · · Score: 4, Informative

    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.)