Slashdot Mirror


Lockheed Martin Purchases First Commercial Quantum Computer

Panaflex writes "D-Wave systems announced general availability for its 128 qubit adiabatic quantum machine just two weeks ago, and reports of its first sale to Lockheed Martin have come out." The D-Wave Systems site has a rather informative collection of quantum computing papers.

16 of 189 comments (clear)

  1. I want one... by Anonymous Coward · · Score: 3, Funny

    ...but I'm uncertain if I'll buy one. Maybe I should check with my cat.

    1. Re:I want one... by Anonymous Coward · · Score: 4, Funny

      ...but I'm uncertain if I'll buy one. Maybe I should check with my cat.

      Oh NOW you remember to check the cat. It's been locked in that box for a week now. It's dead.
      or is it?

  2. So, how long has the NSA had one? by pestie · · Score: 3, Interesting

    So, can this thing crack all non-quantum encryption, then? I seem to remember reading about how that would only require 32 qubits or so. And whether it can or can't, if commercial offerings have come this far, how long has the NSA had a version that can crack all encryption?

    1. Re:So, how long has the NSA had one? by stevelinton · · Score: 4, Informative

      An Adiabatic Quantum Computer is quite a different beast from a quantum computer in the usual sense, and even if it can solve the same class of problems in polynomial time (not at all obvious at this stage) it isn't at all clear that 1 qubit in this machine does the same work as 1 traditional qubit.

      They are, to be honest, being a little bit naughty calling this a quantum computer at all, although it does compute and has quanta, but so does my phone.

    2. Re:So, how long has the NSA had one? by Anonymous Coward · · Score: 3, Informative

      Adiabatic quantum computing != "classic" quantum computing.

      It does NOT runs the Shor algorithm.

      You can use SSL to download your porn safely tonight.

    3. Re:So, how long has the NSA had one? by MaskedSlacker · · Score: 3, Interesting

      I really should have specified "all encryption based on multiplying two large primes," since that's the vast majority of commercially-significant encryption

      No it isn't. It's public/private key encryption. Symmetric key ciphers (which are far more significant) rely on a variety of algorithms. The main use of public/private key is for exchanging symmetric keys.

      In short, RSA (and similar) would be useless, but AES (and similar) would remain secure. The real problem would become one of securely exchanging symmetric keys.

  3. Wiki by squidflakes · · Score: 3, Insightful

    I attempted to get a basic understand of quantum computing from Wikipedia, and maybe find out how a quibit measured up to a traditional bit, and what adibatic meant.

    Whelp...

    I will never make fun of another old person who is unable to grasp the concepts of computing and computer interface that I use every day.

    1. Re:Wiki by retchdog · · Score: 3, Insightful

      the knowledge will be modularized and commercialized fairly quickly. in the 50s and 60s linear algebra was really hard because it hadn't been parsed out into an easy form - the useful stuff was all tied up with operator theory and the sort of understanding that geniuses have. fast-forward to now, and computing a matrix svd is a fairly standard task (even if you don't really have what a mathematician would call 'understanding').

      similarly, quantum programming will most likely condense into a hierarchy of professional modules and life will go on. the structure of IT and computer engineering is almost totally is socioeconomic phenomenon and not a technical one...

      --
      "They were pure niggers." – Noam Chomsky
  4. Re:Grammar by jd · · Score: 4, Informative

    Spellcheckers don't usually help with grammar.

    --
    It's a small world and it smells funny; I'd buy another if it wasn't for the money; Take back what I paid (SoM)
  5. Bad Translation by sprior · · Score: 4, Funny

    I found the D-Wave white papers very hard to understand, but I'm sure it's because of a poor translation from the original Vulcan to (sortof) English.

  6. Re:Did some wiki-browsing... by stevelinton · · Score: 3, Insightful

    A traditional digital computer is pretty hellish to program too if you take away all the props -- you have to find a set of bit values for the memory such this immense consrtructrion of hundreds of millions of gates, clocks, latches, etc. will evolve to give your answer in a reasonably ti,me.

  7. Re:Hold the freaking phone by blueg3 · · Score: 3, Interesting

    Adiabatic quantum computing is somewhat different from "regular" quantum computing. Also, places like Slashdot don't get every minor update to the state of the art. Might have something to do with all the people who say, "wake me up when there's a commercially-available version of this." Well, here's your commercially-available version of this.

  8. Re:My Feelings by wagonlips · · Score: 4, Funny

    I'm simultaneously for and against this.

    Schrödinger? Is that you?

  9. Re:Did some wiki-browsing... by pushing-robot · · Score: 3, Funny

    The basic idea is to enter "42" and see what happens.

    --
    How can I believe you when you tell me what I don't want to hear?
  10. Re:Did some wiki-browsing... by retchdog · · Score: 5, Informative

    think instead, that solving the hamiltonian is equivalent to (or potentially "harder than") solving the original problem, so that you can translate the original problem into a hamiltonian problem. it doesn't mean that you know the answer of either, but you do know that the solution of the hamiltonian will match up to a solution of the original problem. this is the spirit of it: http://en.wikipedia.org/wiki/Reduction_(complexity)

    very, very roughly, think of it like rewriting java, for example, as c. you may not know what the particular code actually DOES in an overall sense, or what it will output, but you can nevertheless rewrite it sort of mechanically (like a compiler would) if you know both languages. furthermore, it's feasible that translating the code is easier than devising the algorithm from scratch. this is basically a reduction. if you can "easily" rewrite any java code as c code, that means java is "reducible" to c. the theory of computation essentially deals with reductions, not of code, but of entire problem classes, which is where P, NP and all that come from.

    --
    "They were pure niggers." – Noam Chomsky
  11. Re:iQubit by Jeremi · · Score: 4, Funny

    I guess I am just have to wait for the Apple Quantum Computer User Experience

    Me too -- in particular I'm looking forward to the quantum MWI version of FaceTime, which connects you to various alternate-universe versions of yourself, so you can compare notes and see who made the better decisions.

    --


    I don't care if it's 90,000 hectares. That lake was not my doing.