Slashdot Mirror


D-Wave Quantum Computing Solution Raises More Questions

benonemusic writes "The commercially available D-Wave computer has demonstrated its ability to perform increasingly complex tasks. But is it a real quantum computer? A new round of research continues the debate over how much its calculations owe to exotic quantum-physics phenomena. 'One side argues there is too much noise in the D-Wave system, which prevents consistent entanglement. But in an adiabatic device, certain types of entanglement are not as vital as they are in the traditional model of a quantum computer. Some researchers are attempting to solve this conundrum by proving the presence or absence of entanglement. If they show entanglement is absent, that would be the end of the discussion. On the other hand, even if some of D-Wave's qubits are entangled, this doesn't mean the device is taking advantage of it. Another way to prove D-Wave's quantumness would be to confirm it is indeed performing quantum, and not classical, annealing. Lidar has published work to this effect, but that triggered opposition, and then a counter-point. The debate continues.'"

20 of 143 comments (clear)

  1. entangled entanglement by aleator · · Score: 5, Insightful

    how do you show the presence of entanglement without disturbing it?

    1. Re:entangled entanglement by Frosty+Piss · · Score: 4, Funny

      how do you show the presence of entanglement without disturbing it?

      You ask Schrodinger's cat. He has the answer...

      --
      If you want news from today, you have to come back tomorrow.
    2. Re:entangled entanglement by edelbrp · · Score: 4, Informative

      You can do what Alain Aspect did which was to show that statistically a system can show the repeatable statistical measurements (using Bell's Theorem) that indicate that entanglement is happening. Then let the system/computer do it's thing with some confidence that entanglement is in play.

    3. Re:entangled entanglement by drolli · · Score: 4, Informative

      Experimentally entanglement is shown most strongly in the form of Bell violations:

      http://en.wikipedia.org/wiki/Bell's_theorem

      as e.g.

      http://www.nature.com/nature/journal/v461/n7263/abs/nature08363.html

      did.

  2. Sounds like a scam, quite frankly by Impy+the+Impiuos+Imp · · Score: 3, Interesting

    Can someone explain to me how this chip could be calculating anything unless the quantum part was working?

    Isn't it like a car that has an electric motor or a gas one, but not both? How can they be confused which engine is running? Who builds a backup normal processor then what, it fills in if the quantum one doesn't work right, and they have no way to tell if this backup kicked in?

    --
    (-1: Post disagrees with my already-settled worldview) is not a valid mod option.
    1. Re:Sounds like a scam, quite frankly by InfiniteLoopCounter · · Score: 5, Informative

      Can someone explain to me how this chip could be calculating anything unless the quantum part was working?

      D-wave is very secretive about how their machine operates and do not respond to academics who want to know exactly how it works -- this is the source of much of the speculation. On top of that you need to specially code your instructions for it, because it can only do a subset of what a general quantum computer could in theory do.

    2. Re:Sounds like a scam, quite frankly by HuguesT · · Score: 5, Informative

      The D-Wave engine can indeed solve some specific optimisation problems by a method called adiabatic annealing. Essentially this done by encoding the problem to be solved in some initial state of the physical components of the engine, and letting it evolve without exchanging energy with the outside world (this is what adiabatic means). The evolution is done in such a way that the solution to the optimisation problem eventually appears (this is the annealing part) with some probability.

      The engine definitely works, this is not disputed. However there is some debate whether the way the engine works is essentially classical or essentially quantum. At the moment the engine is not especially powerful and it is very noisy, so there is no easy way to tell. In the 3 papers cited in the Fine Article, one says this is definitely quantum because the way the system evolves does not match the way classical annealing is simulated (simulated annealing (SA) is a very popular way to solve some complex classical optimisation problems). The second paper says that it is still possible to achieve the signature observed in the first paper by purely classical means, so this is not so clear. The third papers says that this is correct, but that there is more to the signature than was reported in the first paper, and that *this* is more likely to be quantum than not.

      Feel free to contradict me. At any rate, and this is not disputed, the D-Wave engine does not work in the way quantum computers are expected to work in the literature about this topic. It would not be useful to solve factorisation problems as in the Shor algorithm. Rather, it would be useful to solve some optimisation problems in a faster way than with classical or traditional CPUs or GPU. This is still very useful, although at the moment the D-Wave computer's inner working are mostly secret, not hugely fast, and noisy. So D-Wave's qbits are a bit of a misnomer. They should be called something different so as not to engender confusion, perhaps obits (optimisation bits)?

      I hope this make sense to you.

    3. Re:Sounds like a scam, quite frankly by Garridan · · Score: 3, Insightful

      Yeah... I watched a talk by a D-Wave guy. This is a summary of his talk: "So, you have an NP-Complete problem. We have a quantum solver that works on a large graph with a special structure. If you can find a homomorphism from your problem into our graph structure, and you can figure out how slowly to evolve the adiabatic process, then we can solve your problem!"

      Okay, that's great. But finding that graph homomorphism? Probably NP-Complete itself. Figuring out how slowly to evolve the system? I have no idea, but the guy said "it's hard", which means the physicists don't have any idea. Maybe also NP-Complete or worse? Who knows. Tell ya one thing, D-Wave sure doesn't.

    4. Re:Sounds like a scam, quite frankly by quax · · Score: 3, Informative

      You are a bit behind the times. This was true as long as D-Wave was in stealth mode.

      At this point they are quite open and have published several papers in Nature.

    5. Re:Sounds like a scam, quite frankly by quax · · Score: 3, Informative

      I recently visited D-Wave looked at their chips and deep freeze containment. Shot a snapshot of Geordie Rose standing in one of the open boxes.

      You may think they are misguided, but their tech is for real. Even Scott Aaronson doesn't deny that.

      There is no classical computer hidden inside, but there is still reasonable doubt as to exactly how quantum the device is, and if it will ever deliver clear cut quantum speed-up.

    6. Re:Sounds like a scam, quite frankly by HuguesT · · Score: 3, Interesting

      Theoretical Quantum computer using entanglement to perform their calculations make no claim to solve NP-hard problems. They can only solve some very specific class of problems, that are well identified but are still interesting. Integer factorisation is one of them, but factorisation is not thought to be in NP-complete, although we are not certain at this stage.

      There is an old article in PNAS that says that adiabatic quantum computers are theoretically no better than classical computers at solving NP-hard problems. So even if D-Wave had a truly working adiabatic quantum computer, it is not clear that it would perform orders of magnitudes better than what we have now.

      Anyway all of this is very interesting to watch, but the fact that D-Wave is so secretive is not very compatible with progress in the field.

  3. Just do it. by CanEHdian · · Score: 4, Interesting

    There should be plenty of problems a quantum computer could solve in polynomial time that would take classic computers eons to solve. Start solving those problems and it's a quantum computer. Simple as that.

    --
    When the copyright term is "forever minus a day", live every day like it's the last.
  4. DWave itself is in an indeterminate quatum state by Required+Snark · · Score: 3, Interesting
    Consider the hypothesis that the DWave machine is a superposition of classical and quantum computing. By some observations it is classical, by others quantum. As some point a measurement will be preformed on the machine, and it's state will resolve into either a classical physics computing device or a quantum physics computing device.

    This situation is completely reasonable give the current state of the art in quantum computing.

    Making accusations of "marketing hype" and unethical behavior are irrelevant. Whatever it's doing, it's not digital computing. Even if it turns out to be classical physics, it is still advancing the state of the art in non-digital computing.

    No matter how DWave does in the future, quantum computing is still going to happen in the near term. Dwave is not going to change that under any circumstances.

    Getting bent out of shape over this is a waste of effort. Even the experts are not in agreement. This is how progress occurs at the cutting edge.

    --
    Why is Snark Required?
  5. Re:Hasn't the benchmarks put it above anything? by the+gnat · · Score: 3, Informative

    Hasn't the benchmarks already placed it above pretty much any computer in the tasks it can do within its full size?

    My understanding was that the benchmarks - at least the one that was quoted as showing a "3600x speedup" - weren't even comparing the same thing: the D-Wave computer was running the quantum adiabatic annealing method, which is the only way it can be programmed, while the conventional CPU was running an exact solver. The latter is expected to be vastly less efficient (but more precise). When a group of computer scientists came up with an annealing method to solve the same problem on a conventional CPU, they ended up with something just as fast as the D-Wave system.

  6. Question: How Quantum Is It? by Dialecticus · · Score: 5, Funny

    Answer: It's *SO* quantum that even the issue of whether or not it's quantum exists in a superposition of states!

  7. Correlation by Roger+W+Moore · · Score: 3

    Measure correlations between the two systems. If you have entangled, oppositely polarized photons and you simultaneously pass them through aligned polarizers then one will always pass through the filter and one will always fail. It is impossible to recreate this in any classical system without communication between the photons.

    If you can perform the same type of measurement with entangled qbits in a manner where it is physically impossible for them to communicate (e.g. make the two measurements simultaneously) you can confirm their quantum nature.

  8. When I recently sat down with D-Wave's CTO ... by quax · · Score: 3, Informative

    ... I got the impression that he is not overtly concerned about this ongoing controversy, although he did mention he prepared another paper to demonstrate entanglement on the chip.

    But his focus is clearly on tackling hard tasks with immediate applicability (for instance in deep learning).

     

  9. Why Develop This? by Dialecticus · · Score: 3, Insightful

    Because *IF* it can be developed, someone will eventually develop it, and probably sooner rather than later. Technological advances depend less on creative genius and more on previous technological advances. It's like how radar was developed simultaneously by about a half-dozen different nations, but they were all trying to keep this supposed strategic advantage secret from one another. It's not that it was a coincidence, but rather that the time was right, and the pieces were all in place.

    Isn't it better to develop a quantum computer first, so that you know to stop using vulnerable forms of cryptography? Anything else is just sticking your head in the sand. Failing to develop it yourself will not stop the other guy from doing it.

  10. Re:Hasn't the benchmarks put it above anything? by quax · · Score: 3, Interesting

    The benchmark did indeed not demonstrate a quantum speed-up, but it in fairness to D-Wave this was a test designed based on the customers requirements i.e. for them acing this benchmark was good enough to justify investing in this technology.

    My understanding is that the algorithm that was comparatively fast on a classical computer was hand optimized by a graduate student, it was not a generic annealing algorithm solver.

    But the paper on this effort of 'beating' D-Wave on a classical machine is yet to be published, so this is all from blog hearsay.

  11. Re:Hasn't the benchmarks put it above anything? by amaurea · · Score: 3, Interesting

    Could you elaborate a bit on this? I had the impression that D-Wave's users had to map their problem to fit what D-Wave computes, not the other way around. That would make comparisons with a specialized software solver appropriate, wouldn't it?

    The blog post in question also includes a link to the source code of the specialized solver (Prog-QAP), and others have confirmed that it produces the same results as CPLEX, the general solver that D-Wave beat.

    CPLEX is indeed slower than D-Wave, though newer versions have brought the factor down from 3600x to 14x. But again, CPLEX is a general solver, while D-wave is specialized hardware. The specialized software solver Prog-QAP is *much* faster than CPLEX, and gets a 12000x speedup over D-Wave when running on a single core.

    But all of that is a bit old, and it may be that D-Wave has produced more impressive results after that. I hope D-Wave's approach results in something able to beat classical computers, even if it doesn't lead to a general quantum computer. But I really dislike all the secrecy they employed - that is not how science is supposed to work. The fraud speculations they have had to endure are entierly self-inflicted due to this secrecy.