Slashdot Mirror


Google Finds D-Wave Machine To Be 10^8 Times Faster Than Simulated Annealing (blogspot.ca)

An anonymous reader sends this report form the Google Research blog on the effectiveness of D-Wave's 2X quantum computer: We found that for problem instances involving nearly 1000 binary variables, quantum annealing significantly outperforms its classical counterpart, simulated annealing. It is more than 10^8 times faster than simulated annealing running on a single core. We also compared the quantum hardware to another algorithm called Quantum Monte Carlo. This is a method designed to emulate the behavior of quantum systems, but it runs on conventional processors. While the scaling with size between these two methods is comparable, they are again separated by a large factor sometimes as high as 10^8. A more detailed paper is available at the arXiv.

157 comments

  1. Great. Just what Google needs by Anonymous Coward · · Score: 3, Insightful

    Just what Google needs: more computer power with which to monetize the details of your private life.

    1. Re: Great. Just what Google needs by Anonymous Coward · · Score: 0

      Well said.

      It would be nice to have hyper intelligent semantic Web search though!

  2. Help me put the speed of this into perspective. by Anonymous Coward · · Score: 5, Funny

    I'm having trouble visualizing just how fast one of these computers would be.

    If I were to buy one of these computers, would it be fast enough to run Firefox at a reasonable speed?

    1. Re:Help me put the speed of this into perspective. by ClickOnThis · · Score: 5, Funny

      I'm having trouble visualizing just how fast one of these computers would be.

      If I were to buy one of these computers, would it be fast enough to run Firefox at a reasonable speed?

      Given that it's a quantum processor ... yes and no.

      Wait, you said Firefox? Then no.

      --
      If it weren't for deadlines, nothing would be late.
    2. Re:Help me put the speed of this into perspective. by Garridan · · Score: 5, Interesting

      As somebody who has used a DWave computer... you're asking the wrong question. They cannot run Firefox at any speed. They're analog computers purpose-built to solve extremely specialized optimization problems. But they don't necessarily "solve" problems -- they're likely to find good near-solutions. If you write an LLVM extension for which bitwise operations are computed as a solutions to an Ising spin glass problem, then it'd be waaay faster to run your Firefox port on DWave hardware backend than it would use a simulated annealing backend.

      And that would simply be awful.

    3. Re:Help me put the speed of this into perspective. by cfalcon · · Score: 5, Funny

      Sorry, four or more tabs on Firefox is NP Complete. The quantum speed up is only square root of N- not enough for something like that.

    4. Re:Help me put the speed of this into perspective. by gweihir · · Score: 0

      No. These computers cannot be used for general purpose computing. They can only do simulated annealing. Pretty much useless and not even real quantum computers.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    5. Re:Help me put the speed of this into perspective. by daenris · · Score: 4, Interesting

      You might want to read the article (or even the summary). Google is saying that their results suggest that these computers are NOT just doing simulated annealing, but rather true quantum annealing.

    6. Re:Help me put the speed of this into perspective. by invictusvoyd · · Score: 1

      They can only do simulated annealing. Pretty much useless and not even real

      That smells like Windows 10

    7. Re:Help me put the speed of this into perspective. by TechyImmigrant · · Score: 2

      You might want to read the article (or even the summary). Google is saying that their results suggest that these computers are NOT just doing simulated annealing, but rather true quantum annealing.

      I can do real annealing with complexity class O(1), with a metal rod, a blow torch, a hammer and a bucket of water.
       

      --
      I should use this sig to advertise my book ISBN-13 : 978-1501515132.
    8. Re:Help me put the speed of this into perspective. by quax · · Score: 1

      If you can do quantum annealing with the same set up I see a Nobel price coming your way :-)

      The q word actually means something.

    9. Re:Help me put the speed of this into perspective. by nikkipolya · · Score: 1

      The q word actually means something.

      It also means nothing at the same time.

    10. Re:Help me put the speed of this into perspective. by quax · · Score: 1

      At this point I don't know of many serious researchers who doubt the accumulated evidence that D-Wave actually manages to implement quantum annealing.

      How useful that actually is remains to be seen.

    11. Re:Help me put the speed of this into perspective. by thegarbz · · Score: 5, Funny

      But they don't necessarily "solve" problems -- they're likely to find good near-solutions.

      So the result would render webpages differently with each browser you visit? Situation normal then!

    12. Re:Help me put the speed of this into perspective. by serviscope_minor · · Score: 1

      I can do real annealing with complexity class O(1), with a metal rod, a blow torch, a hammer and a bucket of water.

      If you're using the bucket of water, then if you're using iron then you're quenching, not annealing. Not sure why you need the hammer though. Bash the dislocations out of the crystal structure!
       

      --
      SJW n. One who posts facts.
    13. Re:Help me put the speed of this into perspective. by Anonymous Coward · · Score: 0

      Can DWave computers detect humour?

    14. Re:Help me put the speed of this into perspective. by geowar · · Score: 1

      Yes, but only in a parallel universe where you're blind ;-)

    15. Re:Help me put the speed of this into perspective. by dfsmith · · Score: 1

      This was posted on Slashdot. The bucket of water is to put out the flames when the poster dropped the blow torch on his Transformer slippers, Googled "foot burn", discovered that keyboards are also flammable, and ran out of the basement. It pays to think ahead and learn from the mistakes of others.

    16. Re:Help me put the speed of this into perspective. by ConceptJunkie · · Score: 1

      Firefox might run faster, but you might also get webpages from an alternate reality. Of course, that could be good, too, because you might find a better Firefox.

      --
      You are in a maze of twisty little passages, all alike.
  3. Proof that D-Wave is actually a Quantum Processor? by Anonymous Coward · · Score: 1

    So is this finally proof that D-Wave has actually produced a real working quantum processor and isn't just pulling the wool over everyone's eyes? Every other story I've heard of D-Wave is that nobody is allowed to see inside the black box and that nobody can actually get any significant speedup out of using the black box, which of course D-Wave attributed to "poor optimization".

  4. In other news by Anonymous Coward · · Score: 3, Funny

    Light bulb found to light up a room over 99% closer to the speed of light as a simulated lightbulb took to run a simulation of the same on our desktop computer.

    1. Re:In other news by Anonymous Coward · · Score: 0

      Very well said.

      It is expected a device to be faster than its simulation on a digital computer. That is what the Google paper says!

      For example, a processor simulator program may simulate a processor at 20 cycles per second, but the actual processor may run at 2GHz. That is 100M times speedup.

      But if the D-Wave device *is* a computer, other than a simulator of itself, then please state the problem it computed and the time it took to compute it, and let the games begin.

  5. Two questions by Anonymous Coward · · Score: 1

    1) Simulated annealing? I guess it's the most direct comparison but that is a terribly inefficient optimizer. I'm not sure what to make of this news in that regard, but it is definitely impressive in any case. Why not run some more advanced particle swarm algorithms in a direct head-to-head on a well-understood problem?

    2) How accurate are these results for practical application? I can give you answers REALLY fast, but good luck verifying their accuracy.

    1. Re:Two questions by Anonymous Coward · · Score: 0

      *Sorry, instead of accurate/accuracy I rather should have said "optimal"/"optimality", but the question remains.

    2. Re:Two questions by Anonymous Coward · · Score: 0

      This is more real than simulated annealing. That piece of hardware looks specifically tuned for the job, and it actually anneals.

    3. Re:Two questions by Rockoon · · Score: 3, Informative

      Simulated annealing? I guess it's the most direct comparison but that is a terribly inefficient optimizer.

      Do you know of any algorithms that are more efficient while still offering the same finite-time guarantee (of finding the optimal solution) that simulated annealing does?

      This is one of the key points. More efficient methods are frequently more efficient because they wont search the entire space no matter how long you let them run. While simulated annealing wont search the entire space in practice, the operator has control over how much of the space gets sampled by altering the rate of convergence (the "cooling" rate)

      The "more efficient method" that you mentioned, particle swarms, is only more efficient when such a finite-time guarantee is left behind. The finite-time guaranteed version of particle swarms is not more efficient, instead being equally as efficient.

      --
      "His name was James Damore."
    4. Re:Two questions by Anonymous Coward · · Score: 0

      Honestly I had never considered it from that angle and I appreciate your detailed response. Thank you for presenting technical details that most coverage seems ill-equipped to mention.

    5. Re:Two questions by gweihir · · Score: 1

      This thing can only do simulated annealing. It is not a quantum computer that can run different algorithms.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    6. Re:Two questions by quax · · Score: 1

      It's called "quantum annealing". Look it up.

    7. Re:Two questions by sexconker · · Score: 0

      It's called "annealing", look it up. It has to do with heating and cooling materials to relieve stressed points.

      "Quantum annealing" is related to "simulated annealing" which in turn is in no fucking way related to actual annealing. Some clown simply decided to refer to the time component as temperature for no fucking reason and whipped himself up into a fervent state of tumescence by conflating local maxima/minima in a discrete, finite search space with stressed points in a material.

      Annealing is a physical process which alters an object such as a metal beam, a glass rod, or a band of rubber. "Simulated annealing" is a time-constrained search algorithm which produces a non-deterministic result (relying on PRNG) without altering the finite, discrete set over which it operates.

      You better learn your fucking shit before you come stepping, boy, lest you trip like a little bitch.

    8. Re:Two questions by serviscope_minor · · Score: 1

      Do you know of any algorithms that are more efficient while still offering the same finite-time guarantee (of finding the optimal solution) that simulated annealing does?

      Simulated annealing requires that 1/T be grown logarithmically. In other words, the finite time guarantees are exponential time, just like direct search (i.e. trying every configuration).

      I like simulated annealing, it's simple, easy to implement and easy to apply to a lot of problems. The finite time guarantees are not useful in practice however.

      --
      SJW n. One who posts facts.
    9. Re:Two questions by dave420 · · Score: 1

      English is a descriptive language. Get over it. Get over yourself, too, while you're getting over stuff.

    10. Re:Two questions by quax · · Score: 1

      I see you looked it up. Well done.

    11. Re:Two questions by Anonymous Coward · · Score: 0

      *cough* simulated annealing doesn't find the optimal solution at all.

    12. Re:Two questions by Anonymous Coward · · Score: 0

      I sure hope you didn't type that on a 'key'-board or use a 'mouse' to move a 'cursor' around your 'monitor'.
      It's almost as if words can have more than one meaning, and those meanings can change over time!

      By the way, 'anneal', in Old English, meant 'to set on fire' - a rather different meaning than your physical process of changing the hardness of an object, isn't it?

      Now get back on your knees and start sucking, little bitch. If you do a good job, I'll let you stand up again tomorrow.

  6. Re: Proof that D-Wave is actually a Quantum Proces by Anonymous Coward · · Score: 1

    1) D-Wave is a specialized quantum computing device which even in theory isn't as powerful as the devices usually hypothesized. It can only run a subset of quantum algorithms. This is what the post is referring to when discussing the interconnectedness of the qubits. 2) The first D-Wave computers had a much smaller number of qubits, and even the 2X doesn't have that many.

    Thus, especially with the first generation even the theoretical performance of the D-Wave wasn't much greater than a modern classical CPU. So it was difficult to provide skeptics results which reflected actual quantum computing performance. It looks like the 2X is powerful enough to provide some empirical results to address the skeptics.

  7. Note careful terminology by Google by l2718 · · Score: 4, Informative

    Despite being a computing device that relies on quantum effects, D-Wave's machine is not a "quantum computer" as that term is defined by computer scientists.

    Commendably, Google's blog post calls the device a "quantum annealer", rejecting D-Wave's self-label of "quantum computer" which is a misleading marketing ploy. Perhaps if D-Wave's device had come before theoretical CS researcher defined their computational model, the term "quantum computer" would have taken a different meaning, but as things stand the meaning of "quantum computer" was fixed well before D-Wave was founded.

    1. Re:Note careful terminology by Google by Anonymous Coward · · Score: 1

      This D-Wave thing looks pretty far from a general-purpose computer. I don't claim that I know how it works, but from the description at the corporation's website and the paper draft, it indeed looks like a big chunk of magnet (picturing the Ising model) with programmable coupling among dipolar cells, and a programmable background field. Building that thing may yield many engineering insights and should be lauded as such, but speaking of a computer (or a glorified analog calculator), it probably can't run things other than optimizing a potential function, and just recently it began to run that thing well.

    2. Re:Note careful terminology by Google by quax · · Score: 1

      So analog computers then weren't computers either, since they didn't follow Turing's definition?

      It computes with qubits. I think it is perfectly reasonable to call it a special purpose quantum computer.

    3. Re:Note careful terminology by Google by gweihir · · Score: 1

      It would be far more honest to call is a "limited usefulness single-purpose quantum computing device".

      Incidentally, the Turing definition definition does not apply for analog computers. But a real quantum computer (not this D-Wave con device) _is_ a non-analog computer that can solve discrete problems like factoring numbers.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    4. Re:Note careful terminology by Google by quax · · Score: 1, Insightful

      Look I am quite aware what the gate model quantum computer is and can do, but it is disingenuous to pretend that it is the only game in town, and the only such machine that is allowed to be called a quantum computer.

      Two competing models have been shown to be computationally equivalent, namely quantum cellular automatons and adiabatic quantum computing. The latter you get if the machine can implement an arbitrary Hamiltonian. The D-Wave machine is restricted in that it can only implement spin-glass like Hamiltonians. But it computes with qubits. It is a special purpose adiabatic quantum computer. Deal with it.

    5. Re:Note careful terminology by Google by quax · · Score: 1

      Yes, it only can optimizing a potential function, but that gives you a lot of mileage, because a huge amount of real world problems can be mapped onto a graph that can be embedded into the Ising spin model.

    6. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      Word play, but really there is enough info on DWave to understand its basically a magnetic analogue computer.

      The qbits are coils, the equation is defined as a circuit in the chip (presumably it manipulates *voltages* with circuits to do adds, multiple via amplifiers etc., a max and min limit circuit to implement constraints, with those voltages driving electrons to make the magnetic fields). Multiple coils in a qubit must balance, so these define your equality conditions. So you configure the equation by configuring the circuit out of these blocks. They cool the chip down to get the electrons superconducting and it settles to some state as the magnetic fields settle to fit the constraints defined by that circuit.

      Really nothing to do with 'quantum superimposition' or 'spooky distance effects' or any of that.

      The phrase "quantum computer" specifically references Feyman and has a specific meaning, which the marketing men at DWave took advantage of but this chip does not.

      I assume the 'annealing' part is the cooling, as the system is cooled closer to zero the noise is less and less so the magnetic fields stabilize to a 'solution', but testers have found it doesn't always settle to the best solution, which is what you'd expect from an analogue computer (or indeed simulated annealing done in a digital computer).

    7. Re:Note careful terminology by Google by quax · · Score: 1

      There's a world of difference between a classical system like you describe and quantum annealing.

      At any rate, entanglement on the chip has been demonstrated, and outside experts comparing different models to characterize the chip, also came to the conclusion that it indeed performs quantum annealing.

      At this point this question can be regarded as settled.

      The only open, remaining question is how useful quantum annealing will be in practice.

      As to Feynman, his original proposal of a quantum simulator is much closer to adiabatic quantum computing, i.e. D-Wave, then the gate model that took hold after Deutsch's seminal paper.

    8. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      From your own link:

      " Figure 1(c) shows the circuit schematic of a pair of flux qubits with the magnetic flux controls xqi and xccjj. The annealing parameter s is controlled with the global bias xccjj(t) (see Appendix A for the mapping between s and xccjj and a description of how xqi is provided for each qubit). The strength and sign of the inductive coupling between pairs of qubits is controlled with magnetic flux xco,ij that is provided by an individual on-chip digital-to-analog converter for each coupler [8]. "

      i.e. Amplifiers driving the voltage of coupled coils, a magnetic analogue computer as I described. It seems the 'annealing' is an amplifier gain control. So this is an analogue computer made of paired coils coupled by a circuit that reaches a balance.

      Their claim of entanglement relies on this:

      "While observation of an avoided crossing is evidence for the presence of an entangled ground state [35], we can make this observation more quantitative with entanglement measures and witnesses"

      i.e. if Paper ref 35 is true and we fail to measure the zero state then we have evidence for 35. Which is false of course, because they can simply fail to measure the zero state by not measuring it. It also assumes the theory in article 35 is correct and matches their circuit.

      Of course you would never have a zero flux above absolute zero Kelvin, because electrons must be flowing simply due to the available energy. So they cannot make that claim, that failure to measure the zero is proof of entanglement.

    9. Re:Note careful terminology by Google by l2718 · · Score: 1

      Analog computers are computers, of course -- they just aren't Turing machines. In TCS, "computer" is not the name of any model of computation -- unlike "Turing machine", "register machine", "pushdown automaton" and "quantum computer". So the word "computer" retains its everyday meaning.

      On the other hand, you wouldn't call a device with a stack a "pushdown automaton" unless it actually was a pushdown automaton, right? Similarly, I wouldn't call something a "quantum computer" unless it really corresponds to that model of computation. I agree that this creates a void in the terminology, but this is where things stand now.

    10. Re:Note careful terminology by Google by profke · · Score: 1

      Sorry, non-native english speaker here. I looked up the word "annealer", which seems to mean "To subject (glass or metal) to a process of heating and slow cooling in order to toughen and reduce brittleness". I do not understand the concept of the D-Wave machine by any means, but does this describe the way in which the device zeros in onto the right answer? Is that the meaning of the word in this context?

    11. Re:Note careful terminology by Google by quax · · Score: 1

      Don't forget to write a note to the Physical Review X journal, they apparently have abysmal peer review.

      Any particular reason why you ignore the other paper I linked?

    12. Re:Note careful terminology by Google by quax · · Score: 1

      No, quantum annealing only shares conceptual similarities to this macroscopic physical process.

      https://www.youtube.com/watch?...

    13. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      Indeed, since the test could never be false above zero kelvin, even the vague "evidence of" wording (rather than 'Proof of' or even your claim of 'demonstrates that') is disingenuous.

      "Any particular reason why you ignore the other paper I linked?"

      It doesn't apply to DWave.

    14. Re:Note careful terminology by Google by Anonymous Coward · · Score: 1

      I understand it this way:

      Throw a load of balls onto a sheet of rubber that's full of valleys and peaks and the balls will roll down to the lowest points - but not always, since a ball can get stuck in a valley... but with a deeper valley a small distance away. It just can't get back out of the current valley it's in. It's going to get stuck in the local optimum and you'd have to try this many times to make sure you'd found the truly lowest valley.

      The quantum version of this, the balls can tunnel through the side of the valley they are in to a nearby deeper valley... finding the true lowest energy state much more quickly.

      So... if you can take your maths problem and express it as a map of valleys and peaks, where the solution is the lowest energy state... then you can use the DWave to speed up finding the solution dramatically.

      Make sense, or am I completely on the wrong track?

    15. Re:Note careful terminology by Google by quax · · Score: 1

      You must have missed this clue in the abstract:

      "Here, we present results from tests on a 108 qubit D-Wave One device based on superconducting flux qubits."

      This paper was instrumental in settling the question if D-Wave performs quantum annealing.

    16. Re:Note careful terminology by Google by quax · · Score: 1

      Pretty good picture of the process.

      One thing to add though, in addition to quantum tunneling true quantum annealing should also be able to tap into another resource: Entanglement. If qubits are entangled they are described by the same wavefunction, i.e. they are essentially a non-localized smeared out unity, and will experience the valleys in more than one place. Entanglement is very short lived on the D-Wave machine, and very sensitive to temperature increase.

      The fact that the chip's performance is extremely dependant on the temperature indicates that it plays a crucial role, despite having at best very short lived uncontrolled entanglement on the chip.

      (It also means that HTSC technology will not do, this approach to quantum computing has to be very close to absolute zero).

    17. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      "Here, we present results from tests on a 108 qubit D-Wave One device based on superconducting flux qubits."

      Ahh, not the Feyman link you referenced, rather the speed test. I only have access to the summary:

      "Here, we present results from tests on a 108 qubit D-Wave One device based on superconducting flux qubits. By studying correlations we find that the device performance is inconsistent with classical annealing or that it is governed by classical spin dynamics. In contrast, we find that the device correlates well with simulated quantum annealing.....To assess the computational power of the device we compare it against optimized classical algorithms."

      Why would an analogue computer doing an optimization problem correlate with a digital computer running a classical annealing algorithm in performance? A bird flies slower than a jet plane, our Magnum 44 is inconsistent with the speed of a bird and correlates quite well with a jet plane speed so it must be a jet plane.

      " We find further evidence for quantum annealing in the form of small-gap avoided level crossings characterizing the hard problems. "

      A repeat of the p35 claim.

      Really, this is the logic of a belief system. But feel free to provide the full paper and make the counter claim.

    18. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      Nothing in that wikipedia article disqualifies the dwave as a quantum computer.

    19. Re:Note careful terminology by Google by thoromyr · · Score: 1

      you've been posting a lot and seem intent on an assertion that the D-Wave is a "quantum computer" rather than an "analog computer utilizing quantum effect". The thing is, you don't really have anything to back your assertion. You admit that it is very limited and narrowly focused, but seem to believe that those facts are irrelevant because it utilizes a quantum effect.

      Do you accept a flashlight as being a digital computer? It uses an on-off (digital) switch. Is any circuit board a digital computer by virtue of utilizing digital components?

    20. Re:Note careful terminology by Google by quax · · Score: 1

      I believe in the descriptiveness of language. Does it compute? Yes, in the case of the D-Wave. No, in case of the flash light.

      Does it utilize qubits as basic information processing unite? Yes, again in case of the D-Wave.

      Hence, it is justified to call it a quantum computer. Albeit, it should be qualified as a restricted adiabatic quantum computer, or quantum annealer.

      Until we know what kind of quantum computing architecture will win, it is ludicrous to pretend that there is just one way to do quantum computing. Adiabatic, gate based or the underdog quantum cellular automaton are all viable architectures.

      It just happens that the first commercially available is of the adiabatic variety. Theoretical CS folks may hate this and try to police the language, but frankly this is a bit silly.

      And yes, I post a lot on this subject, because I've been following this soap opera for many years on my blog.

    21. Re:Note careful terminology by Google by david_thornley · · Score: 1

      Simulated annealing is an optimization process for a computer, and I've always been a bit dubious of the "annealing". Take your input variables, and your function from those variables that determines how good the result is. Picture your input variables as making an N-dimensional space. Pick a spot in that space randomly. Make a random displacement. Compare the goodness function values there. If the new spot has a better value, go there. Otherwise, go there with a probability determined by a "temperature" function, such as when the "temperature" goes down the likelihood of going downhill decreases. (I don't offhand remember what the temperature function is.) If you use a temperature that decreases slowly enough, you are guaranteed to wind up with the optimum solution. Since that rate of decrease is the equivalent of having your algorithm take exponential time, the temperature is lowered faster, so there's no guarantee of optimality.

      The advantage of this is that, given the ability to evaluate the goodness function at any point, it can find what is usually a pretty good solution. It doesn't depend on what the function is, so it can be used with functions that are really hard to analyze.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    22. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      Any computer that use quantum mechanics to achieve a computation IS technically a quantum computer, however limited the application. Saying it's not a quantum computer just because it cannot solve ALL types of problems doesn't make scientific sense, and sounds like just snobbery.

    23. Re:Note careful terminology by Google by Anonymous Coward · · Score: 0

      I don't think that's correct, you can have a quantum computer that is analog or digital in nature. Example of analog quantum computers are those based on Adiabatic Quantum Computing, example of digital is based on Gate-based quantum computing.

      Also, any computer that use quantum mechanics to achieve a computation IS technically a quantum computer, however limited the application. Saying it's not a quantum computer just because it cannot solve ALL types of problems doesn't make scientific sense, and sounds like just snobbery.

    24. Re:Note careful terminology by Google by gweihir · · Score: 1

      The problem is that this gets misunderstood. The "Quantum Computer" is the magic machine that can break encryption, compute everything massively faster, etc. The D-Wave is not that machine.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    25. Re:Note careful terminology by Google by gweihir · · Score: 1

      Sorry, but the flashlight does compute. Its function is an approximation of "battery not empty" AND "lightbulb not broken" AND "switch on" THEN "shine light".

      This should amply demonstrate that your definition of "computer" is so broad it is completely meaningless and hence useless.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    26. Re:Note careful terminology by Google by quax · · Score: 1

      Please ask a any first grader if this amounts to the kind of complexity that is meant when people use the word "compute".

    27. Re:Note careful terminology by Google by quax · · Score: 1

      I regard this as an opportunity to educate the masses that Quantum Computers are not magical machines, and that the qubits aren't fairy dust. I.e. you can have a machine like D-Wave that utilizes them, yet is still fundamentally limited in what it can do.

    28. Re:Note careful terminology by Google by gweihir · · Score: 1

      It is not. That is my whole point. But even more so, it is not the amount of universality and flexibility expected.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  8. Re:Proof that D-Wave is actually a Quantum Process by l2718 · · Score: 5, Informative

    So is this finally proof that D-Wave has actually produced a real working quantum processor and isn't just pulling the wool over everyone's eyes?

    This finally proves that, in some applications, D-Wave's machine offers considerable speedup over alternatives. It also confirms that D-Wave's machine uses quantum effects to speed up computation, but this point was never in dispute.

    However, the term "quantum computer" has a very specific meaning (just like "Turing machine" has a specific meaning), and D-Wave's machine isn't a quantum computer. They use that label, pretending that they mean the literal reading but hoping you get confused and think of the technical one.

  9. Any analog computer would be faster by Anonymous Coward · · Score: 0

    The trick was getting them stable, something D-Wave seems to have achieved

    1. Re:Any analog computer would be faster by Megol · · Score: 1

      No that's not the trick. The trick is making the qbits coherent with each other so that one can use the machine for quantum computation, just replicating a number of qbits on a chip is trivial in comparison. Now D-wave says that coherency isn't that important and that the minor quantum effects that they get is good enough (=increases performance somehow). That there are quantum effects in the machine have been shown but AFAIK not that those effects are beneficial.

      While running very cold for a "quantum computer" D-Wave is running hot, reducing coherency time. So nope D-wave have very unstable qbits in comparison with the state of art.

  10. Note by Anonymous Coward · · Score: 0, Interesting

    Note, this is a single SINGLE core doing ONLY quantum annealing simulation and NOT running a CPU optimized algorithm to get the desired answer AND they ignored a "bug" in the D-Wave "quantum annealing machine" because otherwise it wouldn't be "Fair".

  11. Re:Proof that D-Wave is actually a Quantum Process by Anonymous Coward · · Score: 0

    Still seems to be a lot of conditions for it to be so fast. A couple of which I can't even decipher, we could start with the single-core comparision. I have a hard time believing a single core process is the next best choice. Of course the article actually admits to better alternate processes too.

  12. Re:Proof that D-Wave is actually a Quantum Process by godrik · · Score: 1

    They use that label, pretending that they mean the literal reading but hoping you get confused and think of the technical one.

    Thought to be fair, anyone that wants a quantum computer will certainly know that D-Wave's machine is not one upon reading its description.

  13. Imagine a beowulf cluster.... by Anonymous Coward · · Score: 0

    ... of these things

    1. Re:Imagine a beowulf cluster.... by ClickOnThis · · Score: 1

      According to the many-worlds interpretation of quantum mechanics, reality is a Beowulf cluster. Sort of.

      --
      If it weren't for deadlines, nothing would be late.
  14. More info by steveha · · Score: 1

    I didn't realize that quantum computers were commercially sold now. I wondered about the price; I wasn't able to find out how much this new computer costs. But per Wikipedia, the first model of this computer sold for about $10 million; and I presume that this new and more powerful version costs more. (The press releases say that this thing computes at extremely low temperatures, so it must include an expensive cooling system.)

    Interestingly, the Wikipedia article says that a lot of famous people were dubious about whether these quantum computers would work. A professor from UC Berkeley predicted that the quantum computer would be about as powerful as a cell phone. This result reported by Google would seem to disprove the criticism.

    https://en.wikipedia.org/wiki/D-Wave_Systems#Reception

    --
    lf(1): it's like ls(1) but sorts filenames by extension, tersely
    1. Re:More info by Anonymous Coward · · Score: 0

      Actually, not really. Simulated annealing isn't a particularly fast or effective optimizer. If you were to run simulated annealing on a cell phone, then yes, you'd get a much better faster result from the D-WAVE. But, if you wrote the program using modern multiobjective evolutionary techniques much faster and more versatile than simulated annealing, you would probably have a lot more luck with the cell phone. Never mind a desktop or server with SLI CUDA set up. I am still waiting to see a practical benchmark.

    2. Re:More info by Anonymous Coward · · Score: 0

      In very specific cases yes, it still doesn't make D-Wave an actual quantum computer.

    3. Re:More info by Tablizer · · Score: 1

      I didn't realize quantum computers were commercially sold now.

      Only if you observe them being sold.

    4. Re:More info by quax · · Score: 1

      They sold the D-Wave One for about $10M to Lockheed. Figure that'll still get you a current model.

    5. Re:More info by Anonymous Coward · · Score: 0

      Lockheed was required to spend about this amount of money for something from Canada. They knew it was BS, but had to buy it anyway.

    6. Re:More info by quax · · Score: 1

      Why didn't they get Maple syrup instead?

      And who forced NASA and Google to get their machine?

  15. lean stochastic local search techniques by Anonymous Coward · · Score: 0

    Way better than fatty stochastic local searching, I can tell you.

  16. Re:Proof that D-Wave is actually a Quantum Process by Rockoon · · Score: 0

    I have a hard time believing a single core process is the next best choice.

    On 10 cores its still at worst 10^7 times faster, on 100 cores its still at worst 10^6 times faster.

    You do not seem to be very bright.

    --
    "His name was James Damore."
  17. Re:Proof that D-Wave is actually a Quantum Process by Arkh89 · · Score: 2

    Provided by the objective function is parallelization yes. Because SA is not.

  18. Set it on fire? by chill · · Score: 1

    Annealing? I RTFS and am envisioning repeatedly setting the D-Wave on fire and letting it cool slowly.

    After reading the summary on the Google Research Blog...I still get that picture. Not really my field. :-(

    --
    Learning HOW to think is more important than learning WHAT to think.
    1. Re: Set it on fire? by Anonymous Coward · · Score: 0

      Almost like it, but for a very peculiar definition of "fire"!

    2. Re:Set it on fire? by Jeremi · · Score: 1

      Annealing? I RTFS and am envisioning repeatedly setting the D-Wave on fire and letting it cool slowly.

      As I recall, the Pentium 4 chip worked along those same lines.

      --


      I don't care if it's 90,000 hectares. That lake was not my doing.
  19. Re:Proof that D-Wave is actually a Quantum Process by MMC+Monster · · Score: 1

    So is this finally proof that D-Wave has actually produced a real working quantum processor and isn't just pulling the wool over everyone's eyes?

    Before we say it's proof, can we at least say that it's faster than traditional processors at solving a particular problem (with the understanding the quantum computers will require different algorithms than linear computers to solve the same problem)?

    --
    Help! I'm a slashdot refugee.
  20. Re: Proof that D-Wave is actually a Quantum Proces by Anonymous Coward · · Score: 0

    And provided you deliberately use a suboptimal classical algorithm (read the paper, where they acknowledge this)

  21. Cold Fusion? by Anonymous Coward · · Score: 0

    Smells a lot like that big promise. In the backroom is link to Watson...

  22. Re:Proof that D-Wave is actually a Quantum Process by An+Ominous+Coward · · Score: 1

    Shifting goalposts. D-Wave's critics indeed spent years claiming that the machines were hoaxes and offered no quantum effects. Understandable, as extraordinary claims require extraordinary evidence and D-Wave was found wanting for some time. Other critics claimed the entire field of quantum computing was fraudulent--this was a hobby horse of cranks and conspiracy theorists, but unfortunately CS attracts a fair number of those. Google's validation of D-Wave's current technology shuts down both those camps of critics.

  23. Re:Proof that D-Wave is actually a Quantum Process by quax · · Score: 3, Informative

    It also confirms that D-Wave's machine uses quantum effects to speed up computation, but this point was never in dispute.

    Boy, are you wrong on that count.

    As to the term quantum computer. It computes with qubits, it's not universal, but in that it resembles some of the analog computers of yore.

  24. Re:Proof that D-Wave is actually a Quantum Process by gweihir · · Score: 1

    No proof at all. This may well just be highly parallelized classical analog computing, the speed-up factor is a bit on the low side. And even if it uses quantum effects, the D-Wave is not a real quantum computer, it is a 1-trick pony and can only do simulated annealing.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  25. Re: Proof that D-Wave is actually a Quantum Proces by gweihir · · Score: 2

    Actually, it is not. For specialized things, analog computers have always been vastly faster than digital ones. This thing may still turn out to not even be a specialized quantum computer.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  26. Re:Proof that D-Wave is actually a Quantum Process by gweihir · · Score: 1

    We can say that. We can also remember that the same is true for a host of other computing devices, for example graphics cards, signal processors, specialized analog computers, etc.

    This thing is not special, despite what many people believe. It does also not demonstrate that quantum computers are possible.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  27. Re:Proof that D-Wave is actually a Quantum Process by gweihir · · Score: 2

    It does not shut anybody down that actually understand the subject matter. (You do not.) This thing is not a quantum computer. It is a special-purpose analog computer that happens to use some quantum effects. And (again) it looks like they have made the comparison as unfair, and hence as meaningless, as possible.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  28. Re:Proof that D-Wave is actually a Quantum Process by quax · · Score: 4, Informative

    D-Wave has published about chip architecture for quite some time now. You must be frequenting the wrong science sites.

    Google for instance is following their overall approach but throw in hardware error correction. The latter has to be implemented via software on the D-Wave chip, which in essence is nothing more than a bunch of coupled josephson junctions (I heinously oversimplify of course, but there are now dozens of publication like this since D-Wave left the stealth mode).

  29. Re:Proof that D-Wave is actually a Quantum Process by quax · · Score: 1

    Wait, are you telling me that nobody is going to put $10M down just to see if they can play their favorite MMOG faster?

    Damn, there goes D-Wave's business model ...

  30. Who are "they"? by Anonymous Coward · · Score: 0

    You mean, D-Wave, or Google?

    They are separate companies, you know, except that the bigger one is a client (and wanna-be competitor) of/to a smaller one.

    P.

  31. nomtrue Scotsman falacy by Anonymous Coward · · Score: 0

    You claim that it's not a real quantum computer, but your definition of a real quantum computer is a mythical device.

    1. Re:nomtrue Scotsman falacy by Anonymous Coward · · Score: 0

      Theoretical device. A mythical device would be one that previously existed in legends of times of yore.

  32. Re: Proof that D-Wave is actually a Quantum Proces by Anonymous Coward · · Score: 0

    Interesting that it took Google over a year to write a program for this thing, even just a simple one to test its performance.

  33. Re: Proof that D-Wave is actually a Quantum Proces by quax · · Score: 1

    Google ran the same test on the previous chip, before they committed to buying the machine. This test is for the new ~1K qubit chip.

    Other than that, coding for this machine is certainly not straightforward, and it is more an experimental device at this time. Certainly not something that'll give you a price performance advantage over conventional hardware, but as they keep doubling their qubit density every 15 months this may change in the not too distant future.

  34. "They" being... by Anonymous Coward · · Score: 0

    Google, or D-Wave?

    Separate companies, you know...

    1. Re:"They" being... by gweihir · · Score: 1

      In this case whoever made the press release and indicated any real-world speedup. Not a direct lie, but gross misdirection.

      The paper is actually honest and admits that they are not faster than a classical computer AT ALL: "Based on the results presented here, one cannot claim a quantum speedup for D-Wave 2X, as this would require that the quantum processor in question outperforms the best known classical algorithm."

      The thing is, the D-Wave is only faster than a simulation of the Quantum Algorithm on a classical computer. Running the same problem with the best known classical computer, the D-Wave has its ass handed to it by a moderately powerful laptop, which is something like 1000x cheaper.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  35. No, proof that it is NOT by Anonymous Coward · · Score: 0

    No, simulated annealing and Monte Carlo are both basically brute force algos for finding a maximum of a function.

    So a computer simulation of brute force is slower than a computer designed to do brute force in hardware.

    DWave is an analogue computer, if it was a quantum computer (as per Feyman) then the solution would be found effectively instantly and it would always be the best solution since the atoms go through all possible quantum states simultaneously.

    It does not always find the best solution, and its faster than a digital computer, but shows no quantum speedup. So no.

    Most likely hiding inside is sources of Johnson–Nyquist noise and a configurable circuit for the equation, which would make it an analogue computer.

    1. Re:No, proof that it is NOT by quax · · Score: 2

      "the solution would be found effectively instantly ....since the atoms go through all possible quantum states simultaneously."

      This is not the way a Quantum Computer works. You invoke the quantum parallel fallacy that that Scott Aaranson devotes an entire book to.

      NP complete problems can be encoded in a quantum hamiltonian, but that does not mean at all that an adiabatic quantum computer could find the minima instantaneously.

      Generally quantum computer are not expected to find solutions to NP complete problems in poly-linear time.

       

  36. An analogue magnetic machine by Anonymous Coward · · Score: 0

    Keep in mind you wouldn't use simulated annealing to find maxima usually anyway, its basically brute force with a cut off that reduces over time to narrow down the threshold till you hone in on a solution (which may be sub-optimal). Monte-Carlo has a similar issue.

    There are better techniques for optimization on digital computers, one was covered quite recently on Slashdot:
    http://science.slashdot.org/story/15/10/24/2059238/new-algorithm-provides-huge-speedups-for-optimization-problems

    ---

    As to whether its a quantum computer, no, but their marketing men claim it is:

    So marketing:

    "Rather than store information as 0s or 1s as conventional computers do, a quantum computer uses qubits – which can be a 1 or a 0 or both at the same time. This “quantum superposition”, along with the quantum effects of entanglement and quantum tunnelling, enable quantum computers to consider and manipulate all combinations of bits simultaneously, making quantum computation powerful and fast. "

    If you actually read their paper, you are configuring a circuit which is magnetic in nature:
    http://www.dwavesys.com/sites/default/files/Map%20Coloring%20WP2.pdf

    It's cooled till it super-conducts, then it's warmed up till the superconductivity collapses, and the circuit settles to a state which must fit the configured constraints defined by the circuit.

    It's not always an optimal one though, sometimes its a local maxima.

    1. Re:An analogue magnetic machine by Anonymous Coward · · Score: 0

      It's cooled till it super-conducts, then it's warmed up till the superconductivity collapses, and the circuit settles to a state which must fit the configured constraints defined by the circuit.

      It's not always an optimal one though, sometimes its a local maxima.

      That sounds a lot like a way of solving the 'Travelling Salesman Problem' that somebody explained to me many years ago. (Let's see if I remember it.) The problem is finding the shortest route that takes you to each of a bunch of cities. If you made a map of the whole region and put nails where the cities would be, then immersed the whole thing in soapy water and lifted it out again, presumably the soap would form a sort of bubble over the nails in a way that would give the minimal route. Not a very practical way of solving the problem is it?

    2. Re:An analogue magnetic machine by quax · · Score: 2

      Balderdash. There is no heating up involved to collapse the superconductivity. Rather the flux is read-out/measured via SQUID and as with any measurement it collapses the quantum mechanical superposition - in this case spin up and down magnetic fluxes in the same Josephson junction.

      Never took QM 101, did you?

    3. Re:An analogue magnetic machine by bluefoxlucid · · Score: 1

      I'm not even sure if this is real language. "Collapse the superconductivity"? Wouldn't you collapse the waveform?

    4. Re:An analogue magnetic machine by quax · · Score: 1

      Agreed. The wavefunction is what collapses, although I guess you could call the phase transition out of superconductivity a collapse if so inclined. Just an odd way of putting it, what really collapses at that time is the Cooper-pair superpositions of the electrons. At any rate rather unusual verbiage.

  37. Re:Great. Just what Google needs by Anonymous Coward · · Score: 1

    Except your privates don't have much of a life at all.

  38. Re:Great. Just what Google needs by Anonymous Coward · · Score: 0

    Great, just what MS/Apple needs: another paid shill that repeats the same BS ad nauseam.

  39. Re: Proof that D-Wave is actually a Quantum Proces by Anonymous Coward · · Score: 0

    I never said it was proof, I said "empirical results to address the skeptics".

    For the skeptics, there will never be proof because they'll never buy one and disassemble it themselves. And because quantum annealing is fundamentally incapable of achieving the more amazing feats that a universal quantum computer can, there'll always be room for doubt and for moving the goal posts.

    But if it's a scam, it's an incredible scam. They're up front about the limitations. Nothing about the claims conflict with known physics or even engineering capability. It's not like the device is an untouchable black box like the Fusion Catalyzer. Even if you can't crack open the tiny component with the qubits, a skilled electrical engineer should be able to satisfy himself that the relevant results are being generated in that one tiny component. If they could squeeze the power of several top-of-the-line Intel Xeons into something that small, that would seem to me more problematic.

    The D-Wave people seem to be pragmatic. They asked themselves, "given the current state of the art, what can we achieve?" The result appears to be the D-Wave.
    It's limited, of course. But outside some NSA skunkworks team, they've become the most experienced engineers on the planet at building commercial quantum devices. This experience will likely be priceless down the road, and I'm pretty sure that was part of their plan--to have a running start when universal quantum computing becomes practical.

  40. Re:Great. Just what Google needs by Khashishi · · Score: 2

    Sounds like something a Luddite would say.

  41. Yawn. by Anonymous Coward · · Score: 0

    The actual true competition would be a custom FPGA/ASIC. Oh, wait, that's all D-Wave is anyway!

  42. Re: Proof that D-Wave is actually a Quantum Proces by quax · · Score: 1

    They idea that this is a scam is indeed laughable. Let's forget for a moment that in comparison to the chip they are running a classical chip would have a very different heat signature. The company would also have gone to incredible length to produce niobium lithographic processes to produce fake chips like the one on display in their reception area. And then they would have produced several peer reviewed articles on a technology that doesn't exist.

    Then again I know people who believe the Boston marathon bombing was a hoax. The ability of the human mind for self-delusion is apparently limitless.

     

  43. Why not use Field Programmable Mixed Signal? by Anonymous Coward · · Score: 0

    I have never understood why they don't use the plethora of mixed signal processors that are out there instead of insanely expensive machines. I know they have issues with noise, but I've heard the D-wave needs to do loads of passes on a computation and then use stats to get the "correct" answer.

    May as well design a "processor" for each problem and then use it to compute.

    I mean, I get that this is how you might eventually get a really really fast "quantum" computer, but there are a lot of alternative approaches that are the definition of quantum computers that should probably get more attention... Fair enough, they're not out of the lab, or even working, but this D-wave really does look a bit flimsy. It has taken ?5? years to find an algorithm that it can process faster...

    Please let me know how I'm wrong, this was a post out of curiosity and an attempt to learn.

    1. Re:Why not use Field Programmable Mixed Signal? by quax · · Score: 1

      Every quantum computer is a probabilistic machine. It's baked into the cake.

      The quantum superposition collapses when you measure. Just one measurement will not necessarily give you the right answer (this also holds for gate based quantum computers e.g. Shor's factorization algorithm).

      But just like Probabilistic Turing machines can outperform their deterministic brethren, quantum computers can do more than Turing machines with only a classical random number source, because quantum probabilities follow non-classical, non-localized rules.

    2. Re:Why not use Field Programmable Mixed Signal? by retchdog · · Score: 1

      actually, it is now widely conjectured that P=BPP, or that any efficient probabilistic algorithm can be efficiently simulated by a polynomial-time deterministic TM.

      --
      "They were pure niggers." – Noam Chomsky
    3. Re:Why not use Field Programmable Mixed Signal? by quax · · Score: 1

      Interesting, wasn't aware of that, especially since in practice randomized algorithm often outperform the next best deterministic ones.

      What informs this conjecture?

    4. Re:Why not use Field Programmable Mixed Signal? by retchdog · · Score: 1

      i'd imagine that it's because people keep finding ways to replace the randomness in specific algorithms with deterministic chaos that's "good enough". maybe that's not the best basis for believing it, but imho it's better than the reason people think P!=NP. i mean, even in reality, those randomized algorithms (usually) work just fine with a PRNG instead of "truly random" numbers.

      otoh, i agree that it is a bit weird. maybe we can think of the randomization as being a shitty oracle? i mean, imagine taking an execution trace of a random algorithm A taking input X, and write down the random choices it makes, call them R. there's now an obvious deterministic algorithm which will mimick that execution trace, it just needs to be given X and R instead of just X. in this sense, randomization is just an unreliable oracle, and so it isn't surprising that it doesn't help too much. on the other hand, (pseudo-)randomization is extremely effective at certain practical problems. i couldn't imagine life without MCMC algorithms for example.

      --
      "They were pure niggers." – Noam Chomsky
  44. D-Wave's problem space is limited, but... by billstewart · · Score: 2

    No, "Quantum Computer" isn't a really well-defined term - it's basically "Sufficiently Advanced Technology Using Handwavium". It's usually used to mean "Quantum Computer that can execute Shor's Algorithm", which can solve a few problems like factoring which would make it extremely disruptive to cryptography. D-Wave has been upfront for a long time about how their computer doesn't do that - it does something much more specialized and handwavy, and this is the first article I've seen that indicates that there's a problem it can actually solve that is significantly faster than conventional computer technology.

    And no, a single-core process isn't the fastest way to solve something that's reasonably parallelizable - you can pile up lots of cores and get a proportional speedup (if you don't have dependencies or too much communication overhead.) But if this is 10**8 times as fast as a single core, and the biggest computers out there are around 10**4-10**5 cores and frightfully expensive, that says there's a problem space for which it might be worth some organization's money to actually buy one to use, instead of buying for speculative research.

    --

    Bill Stewart
    New Fast-Compression-only CPR http://preview.tinyurl.com/dy575ks
    1. Re:D-Wave's problem space is limited, but... by Anonymous Coward · · Score: 0

      For FPGA design there is a long process that takes several hours called place&route. This is an optimisation algorithm based close to the traveling salesman problem; finding the best position of logic blocks so that the route between these logic blocks is short enough that the electrons will reach their destination within a clock period.

      I could imagine that this place&route could be executed on a DWave machine of Xilinx & Altera.

      In fact I read that there are already some plans to put a DWave machine on the cloud, so you can feed it enough problems to keep it busy.

    2. Re:D-Wave's problem space is limited, but... by bluefoxlucid · · Score: 2

      Quantum computers are, specifically, computers which use quantum state to probabilistically enter all output states at the same time and then collapse the waveform into all valid states. It's a very specific type of operation, same as how an optical processor would use light beams to transfer data internally.

    3. Re:D-Wave's problem space is limited, but... by guruevi · · Score: 1

      From what I've read, this computer can't "solve" the traveling salesman problem at all (not faster, not slower, simply not at all). It is not an actual (hypothesized) universal quantum processor and thus your workloads are limited and so are your problem sets. It allows you to do quantum annealing for (128?) qubits and that's pretty much it.

      --
      Custom electronics and digital signage for your business: www.evcircuits.com
  45. Re:Proof that D-Wave is actually a Quantum Process by Anonymous Coward · · Score: 0

    If it is annealing through quantum effects, then it is quantum annealing. It is not simulated annealing.

    Because it is actual annealing through quantum effects, like actual annealing with cooling metals.

  46. Re:Proof that D-Wave is actually a Quantum Process by serviscope_minor · · Score: 3, Interesting

    You didn't read the GP's post properly. He said that the critics claimed it never showed any quantum effects. Whether it's a full Turing complete computer is immaterial to that. It's a special purpose computational element which does, despite the critics' claims to actually use quantum effects for a very substantial speed up.

    It's not a full quantum computer by any stretch of the imagination. I don't entirely understand it, but from my understanding it's not even especially useful unless your cost function fits a -very- specific form.

    Nonetheless, it appears that if you have a real thing for ising models the D-Wave can now find a good minima somewhat faster than classical systems.

    So yay. That's pretty cool if true. An actual problem solved with quantum computing based techniques faster than classical solutions. It's a start and an interesting step forwards, since so far they've not been able to beat a simulation of their system running on a PC and now they can. If it's really 10^8 times faster, it would even be faster than a custom classical annealing ASIC built on the same area of silicon.

    That makes the result interesting, because it's the first time classical computation has ever been beaten, and that's with vast resources invested in it.

    --
    SJW n. One who posts facts.
  47. Snake Oil by Martin+S. · · Score: 1

    However a few million dollar is very cheap as insurance for Google.

    There is absolutely no firm scientific evidence that anything is actually being computed by so called quantum computers, hence Google hedging its language.

  48. Re: Proof that D-Wave is actually a Quantum Proces by makomk · · Score: 1

    If I remember correctly, their test results for the previous chip were later demonstrated to be rather misleading. The previous chip was indeed faster at solving the particular problem class it was hardwired for than a particular general-purpose solver running on a conventional computer, but someone managed to come up with an optimised solver that was faster than D-Wave at solving the exact problem class D-Wave was made to solve, on a normal general-purpose PC. It's not clear if the same applies to the new chip.

  49. Re:Proof that D-Wave is actually a Quantum Process by makomk · · Score: 2

    No, this proves that in some applications, D-Wave's machine offers considerable speedup over intentionally de-optimized alternatives. From the blog post:

    We should note that there are algorithms, such as techniques based on cluster finding, that can exploit the sparse qubit connectivity in the current generation of D-Wave processors and still solve our proof-of-principle problems faster than the current quantum hardware.

    In other words, the current D-Wave machine requires that problems have a particular, very restricted structure and they're only 10^8 times faster when competing with poorly-optimised solvers that don't take advantage of that special structure. if you use a properly optimised conventional solver, the D-Wave machine is actually slower. Google are hoping that future, more densely connected versions that don't exist yet will somehow retain the same speed while conventional code will get bogged down, but those don't exist and may never meet the performance promises that Google are hoping for.

  50. Wow by Big+Hairy+Ian · · Score: 1

    Real hardware runs faster than emulated hardware who'd have guessed?

    --

    Build a Man a Fire, and He'll Be Warm for a Day. Set a Man on Fire, and He'll Be Warm for the Rest of His Life.

  51. Re: Proof that D-Wave is actually a Quantum Proces by quax · · Score: 1

    It wasn't so much the test results that were misleading, then the way it was presented. The same applies to this test i.e. this is not comparing to an optimized solver.

  52. Is it time to start shorting Bitcoins yet? by CrtxReavr · · Score: 1

    Or am I way off base? Isn't the eventual path of quantum computing to almost simultaneously discover all remaining Bitcoins and render digital encryption useless?

    --
    "So is the BSD licence even more 'free' (than GPLv2)? Yes. Unquestionably." --Linus Torvalds (TinyURL.com/2vugzl)
    1. Re:Is it time to start shorting Bitcoins yet? by dfsmith · · Score: 1

      Haven't you seen the documentary that discusses this at length (or at least a few setup scenes)? http://www.imdb.com/title/tt01... B-)

  53. Re: Proof that D-Wave is actually a Quantum Proces by thoromyr · · Score: 1

    so what you are saying is that it is misleading. How else, other than presentation, would you expect something to be misleading?

  54. Re:Great. Just what Google needs by Anonymous Coward · · Score: 0

    Adorbs? Are you fucking serious? Jesus christ, go kill yourself you idiot.

  55. Re: Proof that D-Wave is actually a Quantum Proces by quax · · Score: 1

    The underlying scientific paper could already be misleading. But in both cases, as far as I can tell, this wasn't the case.

    As to the presentation, it's the kind of typical marketing spin that you get anywhere in the IT industry.

    If you want the truth and look at the papers, the truth you'll get.

  56. Re: Proof that D-Wave is actually a Quantum Proces by cciechad · · Score: 1

    Also remember they got funding from the CIA's tech front company. https://en.wikipedia.org/wiki/... I don't think you scam those guys and get away with it.

    --
    https://www.fsf.org/associate/support_freedom
  57. Re: Proof that D-Wave is actually a Quantum Proces by quax · · Score: 1

    Good point :-)

  58. Shetl by mcswell · · Score: 1

    I am no expert in any of this, but it seems to me that the author of the Shetl-Optimized blog understands this quite well, and explains it as well: http://www.scottaaronson.com/b....

  59. Re:Proof that D-Wave is actually a Quantum Process by Anonymous Coward · · Score: 0

    Some in the scientific community considers a quantum computer "real" only if it can solve ALL types of problem. That's hogwash and not very scientific. Any computer that use quantum mechanics to achieve a computation IS a real quantum computer, however limited. By this technical definition, D-Wave is a REAL quantum computer.

  60. Re:Proof that D-Wave is actually a Quantum Process by Anonymous Coward · · Score: 0

    There's strong evidence that D-Wave is using quantum mechanics to achieve computation and it's not just an analog computer. The goal-post is now it should have a "speedup" over regular computers as the ultimate proof that it is quantum. But is speed-up a good benchmark for a quantum computer? I think a quantum computer doesn't need speed-up (due to noise/imperfections) to have an advantage over ordinary computers.

  61. Re:Proof that D-Wave is actually a Quantum Process by gweihir · · Score: 1

    I have. There are different critics out there that say different things.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  62. Re:Great. Just what Google needs by RockDoctor · · Score: 1

    And there is something wrong with being a Luddite?

    --
    Birds are not dinosaur descendants;birds are dinosaurs, for all useful meanings of "birds", "are" and "dinosaurs"
  63. Re:Great. Just what Google needs by Khashishi · · Score: 1

    The thing is, it doesn't matter if it gets developed for computing bomb trajectories or for computing consumer spending habits. Technology is fucking awesome and can be re-purposed to make our lives better. Even the atomic bomb gave us insight into construction of a nuclear reactor.

  64. Re:Proof that D-Wave is actually a Quantum Process by quax · · Score: 1

    I think you exactly identified the disconnect between the scientists and the business crowd. Scientifically it would be quite significant to see true quantum speed-up, as it'll confirm what theory predicts, i.e. that quantum resources can be harnessed to perform better than any Turing machine or classical computer could.

    For the business crowd any practical speed up will do - quantum be damned.

  65. Traveling Salesman vs. Quantum Computers by billstewart · · Score: 1

    Traveling Salesman Problem is NP-complete, so not only is this machine not going to solve it exactly, neither is Shor's model, even though that one does solve factoring, trashing most of the public-key crypto systems.

    But there are lots of heuristics for approximate solutions to TSP, and many of them are "create some complete tour of the network, then randomly perturb it a bunch of times to see if you can get any better results", i.e., simulated annealing, so a quantum annealing machine might turn out to be quite helpful. Until about 5 years ago, Christofides's algorithm, which guarantees a solution that's no worse than 50% longer than the optimum (and usually does better than that) was about the best polynomial-time heuristic there was, so you'd start with that and anneal the results until you were bored.

    --

    Bill Stewart
    New Fast-Compression-only CPR http://preview.tinyurl.com/dy575ks
  66. Re:Great. Just what Google needs by RockDoctor · · Score: 1
    There is a cart and horse orientation type of error there. The construction and operation of nuclear reactors (starting at a sport ground in Chicago) allowed the collection of the detailed information (neutron capture cross-sections, neutron yield per fission) needed to design a nuclear weapon. Then other nuclear reactors had to be designed to produce the materials needed for the bomb.

    Have you ever worked in industry. There is a huge amount of "you can't do this until you've done that, that, that, the other, some of this, and then moved those out of the way. You don't do that while learning a technology, you do it after learning the technology.

    How long does it take from negotiating for land purchases to the first chips coming out of your fab? 5 years? 8 years?

    --
    Birds are not dinosaur descendants;birds are dinosaurs, for all useful meanings of "birds", "are" and "dinosaurs"
  67. The press is stupid by gweihir · · Score: 1

    This is a comparison of the D-Wave with a simulation of the Quantum Algorithm on a classical computer.

    This is nonsense! You really have to compare the best known algorithms for each machine in order to get any meaningful results. Turns out that that the classical algorithm still wipes the floor with the D-Wave on a moderately powerful single core PC when the comparison is fair.

    This factor is not even a strong proof that the D-Wave is using quantum effects, just that it simulates them very well.

    The truly pathetic thing here is the press, which has not caught on to this misdirection, despite this being the second or third time they have done such worthless comparisons and this being stated clearly in the paper.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    1. Re:The press is stupid by gweihir · · Score: 1

      Update: Here is a really good summary of what is going on:

      http://www.scottaaronson.com/b...

      tl;dr: Nice research, no practical speed-ups, unclear whether the D-WAVE can even achieve any real speed-up.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  68. Quantum computers. by jondeanmack · · Score: 0

    Ah quantum computers, the definition of quantum computers being: the psychiatrists trying to understand their own brain, and in the process killing themselves.