When Can Quantum Annealing Win?

Discussion in 'HardForum Tech News' started by HardOCP News, Dec 9, 2015.

  1. HardOCP News

    HardOCP News [H] News

    Messages:
    0
    Joined:
    Dec 31, 1969
    The big brains at Google announced a breakthrough in the field of quantum computing yesterday. According to this blog post, the search giant thinks it has discovered a quantum algorithm that is one hundred million times faster than conventional processes. :eek:


    We found that for problem instances involving nearly 1000 binary variables, quantum annealing significantly outperforms its classical counterpart, simulated annealing. It is more than 108 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 108.
     
  2. Tuxon86

    Tuxon86 Limp Gawd

    Messages:
    198
    Joined:
    Oct 19, 2012
    I, for one, welcome our new quantum annealing overlords :D
     
  3. evilsofa

    evilsofa [H]ardForum Junkie

    Messages:
    10,078
    Joined:
    Jan 1, 2007
    "The problems were designed to demonstrate that quantum annealing can offer runtime advantages for hard optimization problems characterized by rugged energy landscapes."

    It's faster at doing what?
     
  4. jardows

    jardows [H]ard|Gawd

    Messages:
    1,704
    Joined:
    Jun 10, 2015
    When are we going to stop talking about quantum computing and start seeing it in commercial products? This technology has been the promised land, right around the corner, revolution in computing, for the last 15+ years. Let's get it out of the lab and into production already please.
     
  5. gamerk2

    gamerk2 [H]ard|Gawd

    Messages:
    1,626
    Joined:
    Jul 9, 2012
    DWAVE already has; that's the machine google is using. There's been questions whether DWAVES machine is actually a quantum machine or not, but googles results indicates it likely is.

    Which is amazing, given no one else can get a single qbit stable, where DWAVE has a 64-qbit machine available that appears to work.
     
  6. defaultluser

    defaultluser [H]ardForum Junkie

    Messages:
    12,538
    Joined:
    Jan 14, 2006
    It's already WINNING like Sheen :D

    Because it won't help you in any general computing task. Sorry, the problem range that quantum computers are good at is very limited.

    Also, according to this post on Ars by Statistical, even the worries about quantum computers breaking crypto are unfounded:

     
  7. wgm3446

    wgm3446 Gawd

    Messages:
    858
    Joined:
    May 8, 2007
  8. B00nie

    B00nie [H]ardness Supreme

    Messages:
    7,951
    Joined:
    Nov 1, 2012
    Uhh 108 times... SMALL error in scale there.
     
  9. aerosmith

    aerosmith Limp Gawd

    Messages:
    226
    Joined:
    Aug 13, 2002


    Think dude... 108... Ten to the eighth... Read the article, the 8 is properly superscripted there.
     
  10. Dawill

    Dawill Limp Gawd

    Messages:
    397
    Joined:
    Mar 26, 2006
    It's called a logarithmic scale. Lots of things use it. Each tick as you go up vertically is 10x the previous tick. So go up 8 ticks and you are at 100,000,000 times .

    See https://en.wikipedia.org/wiki/Logarithmic_scale if you want to know more.
     
  11. Revdarian

    Revdarian 2[H]4U

    Messages:
    2,429
    Joined:
    Aug 16, 2010
    For those wondering, these D-Wave "Quantum Processors" are so alien that to produce this algorithm that seems to show a more than significant enough speed up vs modified algorithms in regular processors, has taken the NASA- Google - D-Wave team a bit over 2 years studying how does the actual processor works in order to design it.

    Kinda mind blowing.
     
  12. CaptNumbNutz

    CaptNumbNutz Bulls[H]it Master

    Messages:
    20,170
    Joined:
    Apr 11, 2007
    This all sounds facinating, but can someone explain to me what Quantum Annealing is like I'm 5?

    I am aware of the bare basics of quantum physics...schrodinger's cat, something exists in multiple states at once until observed, etc.
     
  13. Kalabalana

    Kalabalana [H]ard|Gawd

    Messages:
    1,295
    Joined:
    Aug 18, 2005
    Reverse engineering something to figure it out is like opening a treasure chest, especially if it is a technology you stumbled upon.
     
  14. DeathFromBelow

    DeathFromBelow [H]ardness Supreme

    Messages:
    7,249
    Joined:
    Jul 15, 2005
    Here's an explanation from D-Wave:

     
  15. Parja

    Parja [H]ardForum Junkie

    Messages:
    11,685
    Joined:
    Oct 4, 2002
    And at the same time, appears NOT to work. Amirite?! :D

    So it's like if...no, wait.
    It's kind of like...no, that's not it.
    Take, for example...nah, that's not gonna work.

    To answer your question, no.
     
  16. evilsofa

    evilsofa [H]ardForum Junkie

    Messages:
    10,078
    Joined:
    Jan 1, 2007
    It's Portal with shotguns.
     
  17. CaptNumbNutz

    CaptNumbNutz Bulls[H]it Master

    Messages:
    20,170
    Joined:
    Apr 11, 2007
    Thanks, that helps

    lol. Ok, maybe not like I'm 5. That's a tall order when it comes to quantum physics. :D
     
  18. LMT MFA

    LMT MFA Limp Gawd

    Messages:
    237
    Joined:
    Jun 11, 2014
    "We are optimistic that the significant runtime gains we have found will carry over to commercially relevant problems as they occur in tasks relevant to machine intelligence."

    Oh dear.
     
  19. pxc

    pxc [H]ard as it Gets

    Messages:
    33,064
    Joined:
    Oct 22, 2000
    The class of problems they're using it for are useful for a particular type of discrete optimization. Commercially relevant problems include search, scheduling, routing and other very scary things. :p The problems are currently being solved less efficiently, but they're still being solved.
     
  20. LMT MFA

    LMT MFA Limp Gawd

    Messages:
    237
    Joined:
    Jun 11, 2014
    I should have highlighted machine intelligence ;)
     
  21. pxc

    pxc [H]ard as it Gets

    Messages:
    33,064
    Joined:
    Oct 22, 2000
    Machine intelligence is a broad category which includes what I listed.
     
  22. Red Falcon

    Red Falcon [H]ardForum Junkie

    Messages:
    9,974
    Joined:
    May 7, 2007
    Wow, this is really amazing technology.
    I've never even heard of this before, thanks for sharing.
     
  23. Dirty Butler

    Dirty Butler Limp Gawd

    Messages:
    293
    Joined:
    Sep 3, 2011
    Time to get that home liquid-helium cooling kit ready!
     
  24. Protoform-X

    Protoform-X [H]ard|Gawd

    Messages:
    1,203
    Joined:
    Jan 30, 2002
    I highly recommend watching YouTube vids on the DWAVE. It's some nerdtastic stuff. The hardware is mind-blowing.
     
  25. damicatz

    damicatz 2[H]4U

    Messages:
    2,708
    Joined:
    Aug 22, 2004
    DWave is using Quantum Annealing. The computers you are most likely thinking of are Quantum Gate Computers. Quantum Annealing is of limited usefulness and is restricted to a very specific set of optimization problems whereas quantum gate computing is much more general purpose.

    Quantum annealing uses low-energy state qubits which are less prone to having troubles with decoherence.
     
  26. DarkStar02

    DarkStar02 2[H]4U

    Messages:
    2,109
    Joined:
    Mar 1, 2006
    Does that mean this could not be used in theory to crack passwords and password hashes?

    I wonder what kind of impact quantum computing will have on the cyber security industry.
     
  27. B00nie

    B00nie [H]ardness Supreme

    Messages:
    7,951
    Joined:
    Nov 1, 2012
    108 is NOT how you write 10 to 8th power. I was commenting on the H article.
     
  28. LanceDiamond

    LanceDiamond Limp Gawd

    Messages:
    361
    Joined:
    Oct 11, 2005
    Best first reply ever! :D

    So...how does this topic have barely two pages of replies while the 'OMG Microsoft is stealing my cat pictures' thread have 4 pages already?

    I read the Google blog post - which itself required some research on what the hell quantum annealing even is. It seems to me, as compared to where the "computer" (PC, laptop, Mac, cell phone, iPod, iPad, game console, etc, etc.) we all know and love is on it's own timeline, quantum computing is someplace before 1975 BUT as quantum makes progress it isn't going to take an actual 40 years to catch up because of the nature of quantum computing. There may be human constraints to the software - but some of that 40 years of progress on standard architecture can be applied directly to quantum with regard to software development methodologies. It's also possible the human constraints get sorted out in the process of advancing quantum. :eek:

    IOW, take the current state of quantum and advance from where our current PCs were in 1975 to today - because that's apparently happening now. It won't be 40 years and might be a LOT less - if AI is possible and gets advancing like that...did I mention welcome to our new quantum computing overlords. I follow specific directions well, I'm easily entertained digitally and require minimal upkeep. :D
     
  29. damicatz

    damicatz 2[H]4U

    Messages:
    2,708
    Joined:
    Aug 22, 2004
    That is correct. The D-Wave cannot run Shor's algorithm. The D-Wave limited to a very specific set of problems. In addition, the fact that the quantum annealing requires the chip to be cooled to near absolute zero (using liquid helium) pretty much limits it to big institutions (i.e. you are unlikely to see a phone using a D-Wave chip).

    True quantum computing would necessitate quantum cryptography
     
  30. LanceDiamond

    LanceDiamond Limp Gawd

    Messages:
    361
    Joined:
    Oct 11, 2005
    Not disputing that the D-Wave can't run Shor's (thanks for clarification on that in fact!) but stuff is happening...

    https://www.nsa.gov/ia/programs/suiteb_cryptography/index.shtml

    "For those partners and vendors that have not yet made the transition to Suite B elliptic curve algorithms, we recommend not making a significant expenditure to do so at this point but instead to prepare for the upcoming quantum resistant algorithm transition."
    (From August of 2015)