Slashdot Mirror


Currently Quantum Computers Might Be Where Rockets Were At the Time of Goddard

schwit1 writes: If quantum computing is at the Goddard level that would be a good thing for quantum computing. This means that the major fundamental breakthrough that would put them over the top was in hand and merely a lot of investment, engineering and scaling was needed. The goal of being able to solve NP-hard or NP-Complete problems with quantum computers is similar to being able to travel to the moon, mars or deeper into space with rockets. Conventional flight could not achieve those goals because of the lack of atmosphere in space. Current computing seems like they are very limited in being able to tackle NP-hard and NP Complete problems. Although clever work in advanced mathematics and approximations can give answers that are close on a case by case basis.

112 comments

  1. Might be by Anonymous Coward · · Score: 0

    You know, if we could look at them.

  2. Na, it's marketing hype. by Anonymous Coward · · Score: 3, Interesting

    Give something a fancy name and by-God it has to be a world-changing technology, right? I just don't see it. The hardware is difficult to build / maintain, doesn't scale, and so far nobody is quite sure what to even do with it.

    It's just a way to suck money out of venture capitalists and keep people busy in ivory towers. There's a reason that so many companies have the word 'quantum' in their name. It's all marketing hype.

    1. Re:Na, it's marketing hype. by Joce640k · · Score: 2

      I for one can't wait to play video games on my new Quantum computer.

      Bring it on, the graphics will be awesome!

      --
      No sig today...
    2. Re:Na, it's marketing hype. by XxtraLarGe · · Score: 1

      I for one can't wait to play video games on my new Quantum computer.

      The downside is that the games will only run when the computer is turned off.

      --
      Taking guns away from the 99% gives the 1% 100% of the power.
    3. Re:Na, it's marketing hype. by K.+S.+Kyosuke · · Score: 1

      There's the /r/outside subreddit for that.

      --
      Ezekiel 23:20
    4. Re:Na, it's marketing hype. by StikyPad · · Score: 1

      I mean, it probably *will* be world-changing technology, but "Goddard stage" is not a useful term. There are experiments, proof-of-concept products, prototypes, and production products. Quantum Computing doesn't have anything approaching a "quantum chip" where it's just a question of manufacturing details. It's just barely beyond proof-of-concept stage. There's nothing approaching a prototype of a quantum processor that can do useful work. IBM claims they have a design for a scalable processor, but you know what they say about the difference between theory and reality.

    5. Re:Na, it's marketing hype. by Anonymous Coward · · Score: 0

      Yeah, just like Quantum hard drives 20 years ago. Where are they now?

    6. Re:Na, it's marketing hype. by Anonymous Coward · · Score: 0

      I don't even know where to start with this comment. I think it's a good indicator of why Donald Trump is leading in the GOP polls though.

      Somebody in an ivory tower must have come down the ladder, entered your place of work, and slapped the Twinkie out of your hand while you were restocking the vending machine.

      LOL@vword :"Nurtured"... no, actually, fuck you and the horse you rode in on.

    7. Re:Na, it's marketing hype. by bistromath007 · · Score: 2

      You're aware that's how it works, right?

      When trains were a big deal, everything was "express." It's the whole reason we even use "express" to mean what it does today. When we first harnessed the atom, everything had to have something to do with radioactive junk, until such time as we figured out that was a bad idea. There's a reason the Fallout series is full of that stuff: the period it is supposed to be imitating did the same thing. In the jet age, we had the same deal as with trains, and that's also when various plastics got big. Plastic completely transformed our approach to industry. The weird, round, bubbly look things were given in the late 70s and early 80s was intentional, as it could only be economically done with plastic; we think of it as tacky today, but they actually wanted to show off that their stuff was made with plastic, or just invoke a "plastic" design aesthetic to give an impression of modernity.

      Society in general spends lots of time only spending money on things that are safe. This itself makes innovation less safe than it already is It's why "venture capitalist" sounds boring at best, and it's why "ivory tower" is a pejorative. Of course they're not doing anything useful. Nobody's giving them any money, so all they can do is think about all the cool shit they'd do if they had any. When those two groups start having the same goal for a little while, that's usually the prelude to a great historical leap. Because we recognize this, it can be, and often is, exploited by hucksters, obviously. But there's a reason it works: when you look at the pace things are moving, it feels like we're due.

  3. Fundamental Break through by Anonymous Coward · · Score: 1, Funny

    So what you're saying is we need Nazis.

    1. Re:Fundamental Break through by Anonymous Coward · · Score: 0

      Or at least Hugo Boss

  4. How would you know? by Anonymous Coward · · Score: 0

    If half of the people that read pop-culture science actually worked in the field, think of how much further along we would be....

  5. guys come on. by nimbius · · Score: 0

    This is Slashdot. As we all know Slashdot explanations must adhere to car comparisons. If you cant get it together and start comparing quantum computing to an old ford then I dont know what I come here for.

    --
    Good people go to bed earlier.
    1. Re:guys come on. by Anonymous Coward · · Score: 2, Insightful

      Quantum computing is like having an old Ford that's broken down, and you would like to fix it. With classical computing, you spend time troubleshooting, eventually identify the problem, order parts, install them, road test it, and you eventually have a working classic Ford again.

      With quantum computing, you have an old Ford that's broken down but not broken down at the same time. You simply ignore the broken down state and choose to use the working one. Problem solved.

    2. Re:guys come on. by Blaskowicz · · Score: 1

      With classical computing, you're in a car and stuck behind that tractor with harvesting/whatever equipment or carrying hay stacks, taking almost all the width of the road.

      With quantum computing, there's a probably the tractor will vanish or get teleported in the nearby field, which will clear the way out and allow you to escape (car can pass the second gear). There is a 1:(((10^128)^128)^128)^128) probability for that to happen, though.

  6. If my grandma is at the Goddard level ... by Anonymous Coward · · Score: 0

    ... that would be a good thing for my grandma.

  7. Or not by BitZtream · · Score: 5, Insightful

    Because rockets were actually working at that point, maybe not refined, but still useful. Quantum computer is not useful in any way at this time.

    Quantum computing is still at the mumbo jumbo stage where they make really bold claims about what it can do in 1 or 2 really specific instances that all of 8 people on the planet care about, but then never follow through with a quantum machine that out performs a classical one in any way.

    Oh, and the answer(s) may not even be right and has to be checked using classical methods anyway.

    --
    Persistent Volume manager for Kubernetes - https://github.com/dwimsey/openshift-pvmanager
    1. Re:Or not by Anonymous Coward · · Score: 0

      Indeed. During Goddard's time it was already known that big rockets were technically possible. We still do not know if we can engineer a quantum computer to do anything beyond trivialities (e.g. factorize 15) or solve problems that classical ones can solve just as efficiently.

    2. Re:Or not by Anonymous Coward · · Score: 0

      If all we want is a machine that makes educated likely guesses and then verifies them with a conventional computer... well,

      yeah, that'll probably never happen. I for one have NEVER heard of such a thing.

    3. Re:Or not by ShanghaiBill · · Score: 2

      Oh, and the answer(s) may not even be right and has to be checked using classical methods anyway.

      One of the primary characteristics of NP problems is that solutions are hard to find but easy to verify. It will take longer than the lifetime of the universe to find the best solution to a thousand city travelling salesman problem. But it takes less than a millisecond to verify that it is better than the previous best known path.

    4. Re:Or not by Anonymous Coward · · Score: 0

      Better is not best. If we don't have some strong math behind knowing how the path is the best, all we have is a quantum computer with a bug in it.

      I understand the high level concepts behind quantum computing, but the GP is right. At this point in time the quantum computers are not trustworthy to be operating correctly. That means verification using classical methods of computing.

      The real smoking gun is "how will we ever know that they are correct?" Assuming they are turned onto the problems they excel at (NP problems), it may be impossible to verify their answers are correct without a true breakthrough in mathematics.

      In many ways they remind me of "DNA computing" which (having been a Genetic Engineer and having worked with DNA a lot) promised a lot of fast solutions to otherwise NP complete problems. The promise of genetic computing was clearly a promise that could be upheld; given that you ignored some constraints. For example, many of the "best fit" matching problems required a pool of DNA that represented all possible combinations of the solution set. Such a pool of DNA is effectively impossible to build, and if the solution set is very large, the physics of the reaction would eventually place the best answer further from the query DNA molecule. This means more time to best solution. So the solution of the problem becomes a physics problem of falling to the lowest energy state. Falling to the lowest stable energy state is not assured, subject to local minima, and if there are competing low energy states, prone to taking a very long time.

      I do not know what quantum computing holds for the future; but, I do know that we run a high risk in quantum computing of influencing the outcome through our expectations and observations. Observing alters the universe, and at the quantum level, it alters it even more so than at the macro level. What safeguards are in place to prevent observer bias?

    5. Re:Or not by Anonymous Coward · · Score: 0

      Too bad you just used DNA in the same paragraph as "Quantum", thus making you a target of every internet libel artist that has ever existed.

    6. Re:Or not by ThatsDrDangerToYou · · Score: 1

      Oh, and the answer(s) may not even be right and has to be checked using classical methods anyway.

      One of the primary characteristics of NP problems is that solutions are hard to find but easy to verify. It will take longer than the lifetime of the universe to find the best solution to a thousand city travelling salesman problem. But it takes less than a millisecond to verify that it is better than the previous best known path.

      Solution: Keep N=1 and nobody gets hurt! Done! ARE YOU LISTENING TO THIS NOBEL COMMITTEE??? You can just send me the big check now please.

    7. Re:Or not by Anonymous Coward · · Score: 0

      A better example is SAT. It takes exponential time to find the right combination of variable assignments to satisfy a Boolean expression, but it is trivial to verify the solution once it is found. Since the traveling salesman problem can be reduced to SAT in polynomial time, a solution would be verifiable in polynomial time.

    8. Re:Or not by P1h3r1e3d13 · · Score: 1

      Not only were rockets working, they had been in practical use for centuries.

      Maybe this would be correct if we said “outer space rockets” specifically. The principles were pretty well understood, but we couldn't yet build one.

    9. Re:Or not by Wycliffe · · Score: 1

      The real smoking gun is "how will we ever know that they are correct?" Assuming they are turned onto the problems they excel at (NP problems), it may be impossible to verify their answers are correct without a true breakthrough in mathematics.

      To use the example you were replying to, if it can get a better answer to the "travelling salesman" problem faster than a conventional computer
      then it would still be very useful even if we can't prove that it's the optimal solution. Neural nets are in a similar state today and are quite useful
      even if we don't know exactly how the individual weights get the correct solution and even if the answers aren't perfect.

      The problem I see with quantum computers is that it seems to be all smoke and mirrors. I don't understand what they are even trying to
      accomplish. Even theoretically, how is a quantum computer suppose to be better at solving problems than a conventional computer?
      Is it because it's in parallel? Well, we have GPUs which are pretty good at that already. Is it just because it is smaller? What exactly
      does quantum computing bring to the table that we don't already have?

    10. Re:Or not by Anonymous Coward · · Score: 0

      You mean the defining characteristic of NP-complete problems are that their solutions take exponential time to find, but the solutions themselves take polynomial time to verify. With that in mind, think about the TSP problem you presented. I give you a "solution". How do you know it's the optimal one (TSP is the optimal tour, not just a tour)? I think you're confusing TSP with Hamiltonian path/cycle -- TSP is NP-hard.

      But other than the technicalities and the general opinion that quantum computers don't solve NP-complete problems in polytime, I agree with you.

    11. Re:Or not by david_thornley · · Score: 1

      Clarificaation: the traveling salesman, as usually stated, is not in NP. Unless it can be solved in polynomial time, it's not possible to verify that we've got the cheapest path in polynomial time. It's equivalent to determining if we can find a path that costs no more than X, which can easily be verified and therefore is in NP, and if we can solve one version in polynomial time we can solve the other one.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    12. Re:Or not by david_thornley · · Score: 1

      You have misunderstood what NP means. One way to put it is that, if we are given a candidate solution, we can check that it is a solution in polynomial time. If quantum computers were capable of solving NP-complete problems, we could verify on conventional computers.

      DNA computing looks a lot like genetic algorithms or simulated annealing to me: a general approximation technique that may or may not work on a given type of problem.

      There is no evidence that expectations alter quantum behavior.

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
  8. Not to be taken seriously by rjh · · Score: 4, Interesting

    Quantum computers cannot solve NP-Hard or NP-Complete problems -- at least, no faster than a classical computer. This is one of the most basic results in the field, and the author keeps on making hash of it. This article should not be taken seriously if it's rife with such basic errors.

    1. Re:Not to be taken seriously by csrster · · Score: 2

      Odd indeed, as this is stated quite explicitly at the bottom of the first slide-image he reproduces (which, incidentally, _assumes_ P != NP).

    2. Re:Not to be taken seriously by delt0r · · Score: 2

      I was about to post exactly that. In fact we have a small handful of algorithms where QC *may* be faster in practice, but none of these problems have been shown to be NP-hard/complete. And well i just don't see it really. Factorization takes a huge number of operations on the n-qbit register to factor a nbit number. Nosie etc is not a mear engineering problem. Its a fundamental problem. And even then such a computer can't help at all for a n+1 bit number.

      --
      If information wants to be free, why does my internet connection cost so much?
    3. Re:Not to be taken seriously by Anonymous Coward · · Score: 0

      Can you provide a citation for a proof of this? Is it a real "no free lunch" result or is it based around a technicality like "well you need an N-bit quantum computer to solve an N-element NP-hard problem, and that computer can't solve an N+1-element NP-hard problem, so it's not even a Turing machine"? Intuitively, quantum computers can search a large space all at once, which is what's needed to solve NP-hard problems, so it's non-obvious that they can't do that when they can solve things like factorization for which current classical algorithms are no better than current classical algorithms for NP-hard problems.

    4. Re:Not to be taken seriously by Anonymous Coward · · Score: 2, Informative

      Quantum computers cannot solve NP-Hard or NP-Complete problems -- at least, no faster than a classical computer. This is one of the most basic results in the field, and the author keeps on making hash of it.

      No, in fact the basic result in the field is that it isn't known if quantum computers can solve NP-Hard or NP-Complete problems more efficiently than a classical computer.

      From a accessible article (http://www.cs.virginia.edu/~robins/The_Limits_of_Quantum_Computers.pdf):

      "The question thus remains unanswered: Is there an efficient quantum algorithm to solve NP-complete problems? Despite much trying, no such algorithm has been found—though not surprisingly, computer scientists cannot prove that it does not exist."

    5. Re:Not to be taken seriously by K.+S.+Van+Horn · · Score: 2

      No, it has not yet been proven that quantum computers cannot efficiently solve NP-complete problems (i.e., that BQP does not contain NP). That would be a major breakthrough. It's strongly suspected that BQP does not contain NP, but so far we seem to lack the mathematical tools that would be required to prove such a thing.

    6. Re:Not to be taken seriously by AmiMoJo · · Score: 1

      I've noticed that the hacks are now trying to avoid Betterage when writing headlines too. This one could so easily have been phrased as a question. It's like they are clever enough to know that they are being mocked but not clever enough to actually avoid the thing they are being mocked for (ignorance).

      --
      const int one = 65536; (Silvermoon, Texture.cs)
      SJW, n: "Someone I don't like, and by the way I'm a fuckwit" - AC
    7. Re:Not to be taken seriously by 14erCleaner · · Score: 1
      That's because Goddard's rockets still moved at sub-light speeds. Once QC reaches the warp drive threshold, we'll be able to solve NP complete problems quickly.

      Jeez, what a stupid analogy.

      --
      Have you read my blog lately?
    8. Re:Not to be taken seriously by Anonymous Coward · · Score: 0

      You can't prove that I can't put my d*** on a plate and cover it with mustard and have it turn into an Oscar Meyer Kielbasa either.

      Now where's my grant money and professional respect?

      PS In all seriousness, it is not known if there exists any CLASSICAL algorithm to do what you suggest. Why you assume it should be any different for quantum computers I have no idea.

    9. Re:Not to be taken seriously by delt0r · · Score: 1

      Yet there are no problems in NP-hard/complete that a QC can solve in P time. So to claim they can solve NP-$WHATEVER in P time is just plain wrong.

      --
      If information wants to be free, why does my internet connection cost so much?
    10. Re:Not to be taken seriously by delt0r · · Score: 2

      You also can't prove P!=NP........

      --
      If information wants to be free, why does my internet connection cost so much?
    11. Re:Not to be taken seriously by ShanghaiBill · · Score: 2

      (which, incidentally, _assumes_ P != NP).

      That is actually a pretty good assumption, which millions of people implicitly make every day, by say, using cryptography that is only secure if P!=NP.

    12. Re:Not to be taken seriously by Anonymous Coward · · Score: 0

      There are no NP-complete problems for which we _know_ a polynomial-time quantum algorithm. Whether such an algorithm exists is an open question.

    13. Re:Not to be taken seriously by Anonymous Coward · · Score: 0

      Again, it isn't known whether you can prove P != NP or not.

    14. Re:Not to be taken seriously by Anonymous Coward · · Score: 1

      Yes, and then the article goes right on as if quantum computers could solve NP-complete problems in polynomial time.

    15. Re:Not to be taken seriously by Anonymous Coward · · Score: 0

      Intuitively, quantum computers can search a large space all at once

      That's a bad intuition. Quantum computers give you a limited form of large scale parallelism, and if you're really clever, you can use that for solving problems a little faster. They do not search general spaces all at once.

      so it's non-obvious that they can't do that when they can solve things like factorization

      Factorization is not known to be NP-hard, and it's not believed to be NP-hard either.

      Quantum computers may be able to solve NP-intermediate problems, but those problems are few and much less important than NP-hard problems. It is very unlikely at this point that quantum computers can solve NP-complete problems in polynomial time unless P=NP.

    16. Re:Not to be taken seriously by Khashishi · · Score: 1

      Is this proven? Or is it one of those things that are assumed to be true (with good reason). I thought all of the time complexity classes are still essentially open questions.

    17. Re:Not to be taken seriously by Khashishi · · Score: 1

      I'd say cryptography is still secure if the time complexity is something like n^80.

    18. Re:Not to be taken seriously by rjh · · Score: 1

      Depends on what you mean by proven. It's believed about as strongly as people believe P != NP. There's zero evidence BQP can address NP-Complete (or, for that matter, even interesting parts of NP), and a lot of good reasons to believe it can't. However, a proof has been as elusive as the P != NP proof -- another thing which pretty much every CS nerd agrees to be true, but it hasn't been rigorously proven yet.

    19. Re:Not to be taken seriously by rjh · · Score: 1

      I didn't say it was proven. I said it was a result. We don't have a formal proof that P != NP, but find me a single practitioner who thinks we'll find a proof of P = NP.

      At some level math works on the basis of consensus. Consensus determines whether we accept a proof or reject it for omitting an important step; consensus determines which axioms we accept to be true. And so far, the consensus seems to be "BQP != NP, just like P != NP."

      But yes, we're going to keep looking for the proofs. :)

    20. Re:Not to be taken seriously by Anonymous Coward · · Score: 0

      While technically true, that's also technically true of classical algorithms.

      Which makes it not a particularly useful truth at this time.

    21. Re:Not to be taken seriously by ShanghaiBill · · Score: 1

      I'd say cryptography is still secure if the time complexity is something like n^80.

      You are underestimating exponential complexity. If you are using 1024 bit encryption, then 1024^80 is way, way, way, way smaller than 2^1024. The difference is more than that between the a single planck time and the age of the Universe.

    22. Re:Not to be taken seriously by Khashishi · · Score: 1

      Dude, I know how to math. 1024^80 is still much larger than the age of the universe in Planck times.

    23. Re:Not to be taken seriously by david_thornley · · Score: 1

      However, 4^80 == 2^160, which is far too big to brute-force. 2^80 itself is too big to brute-force currently, but I don't really know the bounds of what might be brute-forceable under what assumptions (like limiting the attack to the resources of the Solar System from now to the heat death of the Universe).

      --
      "When you have eliminated the unacceptable, whatever is left, however improbable, must be the truthiness" - Holmes
    24. Re:Not to be taken seriously by csrster · · Score: 1

      You mean the fact that my granny uses netbanking is evidence that P!=NP ?

  9. So are all new technologies by pr0t0 · · Score: 1

    Goddard was the father of modern rocketry (perhaps 5000 years of Chinese fireworks aside ;-), so really any fundamentally new technology is at it's "Goddard level". But it is amazing to think about what Robert Goddard was doing compared to a truly modern launch system, and apply that to what researchers are doing with quantum computing. Where will that be in 80 years? I wish I could be alive to see it.

    --
    I'm sorry, but your opinion seems to be wrong.
    1. Re:So are all new technologies by Anonymous Coward · · Score: 0

      "Where will that be in 80 years? I wish I could be alive to see it."

      Then get behind life extension, because if there's one thing that will blow the lid off our limits, it's life extension, yet it's never seriously addressed.

  10. Quantum isn't a magic bullet for NP-hard problems by Anonymous Coward · · Score: 1

    If the person who wrote the article understood the first slide they included, it even shows that the class polynomial time quantum algorithms (BQP) probably don't include NP-complete problems and it says something to that affect. Wiki is better:

        https://en.wikipedia.org/wiki/Quantum_computing#Relation_to_computational_complexity_theory

  11. Dumbed down explanation by Anonymous Coward · · Score: 2, Informative

    Stripping off the D-Wave Quantum nonsense:

    http://phys.org/news/2014-06-independent-group-d-wave-quantum-speedup.html

    "(Phys.org) —An independent research team with members affiliated with several universities in the U.S. and Switzerland has concluded that the D-Wave Two computer shows no signs of quantum speedup"

    -----

    It does a calculation known as 'constrained minimization'. so for a function f(x1,x2,x3....) where x1 has limits on acceptable values (constraints), x2 has limits, x2,...and so on, calculate a minimum value of f(x1,x2,x3...) and say at what x1,x2,x3,.... those values occur.

    In theory you could brute force this with noise (which would randomly change x1, x2 and x3, x4..., trying all possible values and filtering for ones that are within the constraints. D Wave claim to do it in quantum way, i.e. all possible values simultaneously being tested by the magic of Quantum Annealing. However their kit doesn't show that, and the results it generates under tests are often wrong, indicating all possible values have not been tested.

    So we have a problem here. It behaves like a noisy system being used to brute force a calculation, and like that system it generates wrong results because noise is random and spread across time, and you cannot know if you've given it enough time to get the optimal solution. And since we can run classical techniques for constrained minimization, we can find *better* solutions, and this prove it has not actually done the task!

    It also means it cannot possibly be doing Quantum Annealing because it has not tested all solutions. No amount of money will turn a brute force noise machine into a Quantum computer.

  12. the logic of analogies by dingleberrie · · Score: 1

    Currently EM Propulsion is also in early development like Quantum Computers, so EM Drives Might Be Where Rockets Were At the Time of Goddard, but we currently use rockets instead of EM drives, so... umm... the Time of Goddard is now?

  13. Goddard? Not so fast... by goodmanj · · Score: 5, Informative

    "Currently Quantum Computers Might Be Where Rockets Were At the Time of Goddard"

    Designed on totally incorrect physics?
    https://en.wikipedia.org/wiki/...

    The true revolutionaries of rocket propulsion all have German last names.

  14. Yeah, but... by Viol8 · · Score: 2

    To be fair, no one apart from a few vested interests are claiming that quantum computers are some sort of magical panacea. But just like modern graphics GPUs, they could be built into ordinary computers and used when the problem domain suits their capabilities.

  15. It ain't an article... by AchilleTalon · · Score: 1

    It is not an article, it is advertisement. There is absolutely no news content, just some stuff to make people discuss around it as if something new has happened.

    --
    Achille Talon
    Hop!
    1. Re:It ain't an article... by Intrepid+imaginaut · · Score: 1

      Article? Article! We do not read TFA!!

      This!

      Is!

      Slashdooooot!!

      *kicks AchilleTalon in the chest*

  16. Non-locality by disposable60 · · Score: 1

    I know quantum stuff is hard to pin down, but not knowing where Qumputing is by a century-wide error band is pretty bad.

    / streeeeeeeeetch

    --
    You're looking for quotes? See my journal.
  17. No, it's not like being able to travel to the moon by K.+S.+Van+Horn · · Score: 1

    OP writes: "The goal of being able to solve NP-hard or NP-Complete problems with quantum computers is similar to being able to travel to the moon, mars or deeper into space with rockets."

    Not even close. There was never any reason to believe that traveling to the moon was fundamentally impossible. That was an engineering problem, and no known nor suspected laws of physics prohibited it.

    Solving NP-complete problems efficiently (polynomial time) with quantum computers may is a mathematical problem, however -- it amounts to finding a quantum algorithm for any one NP-complete problem -- and it may prove to be truly impossible, that is, it may be that no such algorithm exists. In fact, most experts in the field would say that the evidence so far strongly suggests that this is the case, that BQP (the set of problems you can solve in polynomial time on a quantum computer) does not include the NP-complete problems.

  18. So all it would take would be a war? by petes_PoV · · Score: 1
    Rocketry developed rapidly during WW2, after which everyone "borrowed" the German developments - and their scientists. If there is a parallel with quantum computing, it would seem likely that no real progress will be made until some sort of conflict (either in the real world or cyberspace) breaks out and some dramatic development takes place. After which the losers will "give" their technological developments to the winners. The winners will then play around with it, make it just about usable (if still incredibly inefficient) and call that "good enough" for the next 50 years.

    It will only be after that when some commercial outfits start to get their hands on QC, that we'll start to see some innovation, progress and actual low-cost applications.

    Or maybe it'll be like planes: 60 years from wooden biplanes to the Jumbo Jet and a few more to Concorde. Then it'll grind to a halt.

    --
    politicians are like babies' nappies: they should both be changed regularly and for the same reasons
  19. Every new technology... by sjbe · · Score: 4, Insightful

    Give something a fancy name and by-God it has to be a world-changing technology, right? I just don't see it.

    So because you can't understand it, it must not be of any consequence? I think that says more about you than it does about the technology.

    The hardware is difficult to build / maintain, doesn't scale, and so far nobody is quite sure what to even do with it.

    That sounds like pretty much every new technology ever. The first computers were difficult to build and maintain, didn't scale well and people weren't entirely sure what to do with them outside of a few narrow use cases. The first airplanes were difficult to build and maintain, didn't scale well, and... etc. We figured it out eventually. Probably will with quantum computing too in due time.

    1. Re:Every new technology... by khallow · · Score: 1

      So because you can't understand it, it must not be of any consequence?

      If you're spouting such straw man platitudes, then you don't know enough about quantum computers to condemn someone else. In the defense of the previous poster, I'll note that there are a number of phenomena that permeate all of the Solar System (gravity, neutrinos, and thermal radiation) that may place an upper bound on the reliability of quantum computing no matter how magical your technology is.

    2. Re:Every new technology... by Anonymous Coward · · Score: 0

      No , don't you get it? The whole thing IS marketing hype. No serious scientist has anything remotely approaching a quantum computer as imagined in the media. The experiments that have been done so far are about as close to a working computer as throwing chicken bones at the ground and saying "see, I told you we could plan our evening this way!"

    3. Re:Every new technology... by Anonymous Coward · · Score: 0

      No serious scientist has anything remotely approaching a quantum computer as imagined in the media

      That is not even close to the "whole thing" being marketing hype, just that the popsci coverage has dumbed down and over hyped it, which is true for nearly all aspects of science and technology covered by popsci. Messed up media coverage media coverage is orthogonal to actual developments, whether dealing with quantum computing or the next storage medium.

  20. Not an advertisement either... by dfm3 · · Score: 2

    ...but a research paper. And a BADLY written one at that. One that, if submitted by one of my freshmen students, I'd probably assign a D+ if I was feeling generous.

    Even after parsing the confusing sentence structure in the first couple paragraphs, I gave up before figuring out exactly how the figures (which look like snapshots of some PowerPoint lecture or presentation? What's the source??) tie in with their overall thesis - which seems to be some poorly formed analogy between the history of flight and quantum computing.

    And they cited Wikipedia... ugh.

  21. This article is ignoring Micron Automata by hkultala · · Score: 1

    Micron Automata can solve NP-hard programs very quickly, and it's not quantum computer.

    It abandons the Von Neumann model we have been using or last 60 years and can achieve very high parallelism.
    And it requires a very different style of programming.

    But it's not quantum computer. And it's actually working, running in Micron's labs and very soon coming to market.

    Quantum computers are hype that's not really working, Micron automata is the real thing achieving mostly the same benefits.

    1. Re:This article is ignoring Micron Automata by Anonymous Coward · · Score: 0

      Looking at their website the thing looks like a massively parraelel hardware regex matcher.
      Better yet, it plugs into anormal von neumann machine.
      How is that achieving the same benefits as quantum computing?
      Not that I know what the benefits of quantum computing are supposed to be, since I can't seem to understand how it's supposed to work.

    2. Re:This article is ignoring Micron Automata by Anonymous Coward · · Score: 0

      You are wrong. They are solving certain classes of simple polynomial problems in linear time if they are able to successfully map it to their hardware. There is no magic that allows a solution space too large to fit in the known universe to be brute forced through parallelism.

  22. Wishful thinking by hackwrench · · Score: 1

    I thought this "article" contained little more than wishful thinking, and voted it down, but it still got through anyways.

  23. Yeah sure, this and nuclear fusion, right? by NotDrWho · · Score: 2

    Big breakthrough just around the corner!

    --
    SJW's don't eliminate discrimination. They just expropriate it for themselves.
  24. You mean... by Anonymous Coward · · Score: 0

    Built the wrong way around? Yup.

  25. Balderdash by MrVictor · · Score: 1

    Do not waste your time reading this. The moron who wrote that "article" is full of shit. Quantum computers can only efficiently solve (i.e. <= polynomial time) a specific class of problems called BQP. NP-hard and NP-complete problems would remain totally unfazed by quantum machines.

  26. Re:Goddard? Not so fast... by K.+S.+Kyosuke · · Score: 2

    I think that comparing "being able to solve NP-hard or NP-Complete problems" to "travel to the moon, mars or deeper into space with rockets" is a much worse offender, since the latter clearly doesn't violate the laws of physics whereas the former probably might.

    --
    Ezekiel 23:20
  27. Re:Goddard? Not so fast... by quanminoan · · Score: 2

    Eh, Goddard quickly learned that didn't work and went on to make this:

    http://i.space.com/images/i/00...

    Where Goddard failed apparently was in his paranoid insistence on secrecy.

  28. Re:Goddard? Not so fast... by thrich81 · · Score: 2

    Well, that's an ignorant comment of yours. The mods need to do a little checking before modding up.
    Here (http://airandspace.si.edu/explore-and-learn/multimedia/detail.cfm?id=2888) is a picture from the mid-30's of Goddard with one of his rockets which was equivalent or better than the Germans' at the time.
    Here (https://en.wikipedia.org/wiki/Robert_H._Goddard) is a statement by von Braun himself about Goddard's work:
    "Nevertheless, in 1963, von Braun, reflecting on the history of rocketry, said of Goddard: "His rockets ... may have been rather crude by present-day standards, but they blazed the trail and incorporated many features used in our most modern rockets and space vehicles". He once recalled that "Goddard's experiments in liquid fuel saved us years of work, and enabled us to perfect the V-2 years before it would have been possible."
    And from the same wiki article:
    Three features developed by Goddard appeared in the V-2: (1) turbopumps were used to inject fuel into the combustion chamber; (2) gyroscopically controlled vanes in the nozzle stabilized the rocket until external vanes in the air could do so; and (3) excess alcohol was fed in around the combustion chamber walls, so that a blanket of evaporating gas protected the engine walls from the combustion heat."

  29. Give specific technical arguments or go away by sjbe · · Score: 1

    If you're spouting such straw man platitudes, then you don't know enough about quantum computers to condemn someone else.

    You might have a point if his argument was something more nuanced than "it's hard and I don't understand how it will ever work" with a few marketing = boogeyman slams thrown in for good measure. Maybe quantum computers will be a thing and maybe they won't but he sure as hell doesn't know. If you want to claim quantum computers will never work then present some compelling technical evidence to support that position. Otherwise shut up and let the researchers do their job.

    In the defense of the previous poster, I'll note that there are a number of phenomena that permeate all of the Solar System (gravity, neutrinos, and thermal radiation) that may place an upper bound on the reliability of quantum computing no matter how magical your technology is.

    "May place an upper bound"? Sounds like you don't really know much about quantum computers yourself there my friend. Come back when you have some specific physics to discuss beyond some vague hand waiving about gravity and neutrinos.

    1. Re:Give specific technical arguments or go away by Anonymous Coward · · Score: 1

      The burden of proof is on you to explain how it DOES work.

      I have read countless papers as well as summaries on the subject, and despite not being qualified to BUILD a quantum computer I can quite confidently state that 99% of the claims made about them are utter BS.

      The only thing true in this article is that we are over a decade from POSSIBLY seeing any decent results from this.

      There are many great proof-of-concept PARTS of a quantum computer system, but the number of qubits that are currently attainable is so low as to be near-useless, and the topologies and support infrastructure required for an effective combination of these units (one of the most promising directions) don't really exist yet.

      Is it possible that someone, somewhere has actually constructed a useful QC in defiance of all the skeptics (And fanboys)? Absolutely. Should we believe them? Not without extraordinary evidence.

    2. Re:Give specific technical arguments or go away by Anonymous Coward · · Score: 0

      Replying to this because I slipped and hit redundant.

    3. Re:Give specific technical arguments or go away by Bengie · · Score: 1

      All the GP was saying was that quantum computers are still a worthy investment for humanity at large until proven otherwise. The burden of proof is on YOU, not him. From the sounds of it, you think quantum computers are impossible, prove it, show us some logic that proves the Universe places a limit on them such that they are mostly useless.

    4. Re:Give specific technical arguments or go away by Anonymous Coward · · Score: 0

      If you think I say they're impossible, you obviously stopped reading halfway through my post.

      Of course we should continue the research.

      That doesn't mean we aren't subjected to METRIC TONS of bullsh## in search of grant money and venture capitalists.

    5. Re:Give specific technical arguments or go away by khallow · · Score: 1

      You might have a point if his argument was something more nuanced than "it's hard and I don't understand how it will ever work" with a few marketing = boogeyman slams thrown in for good measure.

      It was. You mischaracterize the post in question.

  30. unfortunate comparision by Thud457 · · Score: 1

    Currently Quantum Computers Might Be Where Rockets Were At the Time of Goddard

    So the New York Times thinks it's a bunch of bunk, then...

    --

    the preceding comment is my own and in no way reflects the opinion of the Joint Chiefs of Staff

    1. Re:unfortunate comparision by Anonymous Coward · · Score: 0

      Thanks for that.
      That was hilariious.

  31. Unfortunately, it is not by gweihir · · Score: 2

    Quantum computing is about where teleportation, strong AI, a perfect cure for cancer, etc. is, namely it is completely unclear whether it will ever work. All this bullshit about Quantum Computing is just that: Bullshit. We do not even know whether the physics allows it, all we know is that the current theory (which we know is incomplete and inaccurate) would allow it if it was accurate.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    1. Re:Unfortunately, it is not by Anonymous Coward · · Score: 0

      The current theory is fine at low energies, where quantum computation resides. There is no incompleteness or inaccuracy that you can measure. Physics allows it, it's whether engineering allows it. This is of course the same problem as fusion energy.

    2. Re:Unfortunately, it is not by gweihir · · Score: 1

      Quantum computing requires perfect scalability. Effects that are unmeasurable at 1 or 10 qbits can easily kill calculations with 100 qbits completely. As there are no entangled systems with 100 qbits, it is unclear whether such inaccuracies are there or not. Practical applications, incidentally, require likely 1000 entangled qbits and more.

      So, no, "unmeasurable" at current entanglement numbers are meaningless to predict feasibility at higher numbers. And much higher numbers are needed before quantum computing offers any advantages. It is not even clear whether entanglement itself scales or runs into fundamental limitations at some point. The theory says it does not, but it is theory, not verified reality.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    3. Re:Unfortunately, it is not by Anonymous Coward · · Score: 0

      >It is not even clear whether entanglement itself scales

      It's not even clear if there is entanglement in our universe.

      https://en.wikipedia.org/wiki/Loopholes_in_Bell_test_experiments

    4. Re:Unfortunately, it is not by gweihir · · Score: 1

      Indeed. One way to find out may be to find that Quantum Computers do not actually work. What they can currently compute could well be caused by entirely different effects. Factorizing 12 does not take entanglement.

      Thanks for the link, fascinating stuff! I think physicists in that area have some time ago lost the ability to understand and handle their own models. Or Douglas Adams was right after all.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  32. Quantum Airlines by Impy+the+Impiuos+Imp · · Score: 1

    The goal of being able to solve NP-hard or NP-Complete problems with quantum computers is similar to being able to travel to the moon, mars or deeper into space with rockets.

    I thought it just functionally added massive parallelism, and didn't really solve this, by offloading the calculations into the quantum path space.

    --
    (-1: Post disagrees with my already-settled worldview) is not a valid mod option.
  33. What and where? by fahrbot-bot · · Score: 1

    Currently Quantum Computers Might Be Where Rockets Were At the Time of Goddard

    I'm not sure stacking computers on make-shift launch pads in the middle of the desert would be helpful. Or did I misread that?

    --
    It must have been something you assimilated. . . .
  34. Re:Goddard? Not so fast... by Anonymous Coward · · Score: 0

    Wow, it's so amazing you know all about physics from stuff we've already learned.

    That Goddard sure was a dummy, what with not having knowledge from 20 years after he did his work!

  35. calculate cancer! by Anonymous Coward · · Score: 0

    so for quantum computing, it's going to take about 30 years for its rocket to be nuclear fission powered?
    or will it require shielding and ANOTHER quantum computer to figure out that that stuff is bad?

  36. Burden of proof by sjbe · · Score: 1

    The burden of proof is on you to explain how it DOES work.

    No it isn't. I'm not trying to prove or disprove them and never claimed otherwise. If you want to claim that they cannot work then you need to provide a testable theorem to back that up. If you want to claim that they can work same thing applies. If you are merely trying to refute claims that someone has developed a quantum computer when they haven't then you merely need to clarify your position.

    Here is what I think we know right now. Some scientists apparently have created functional quantum computers with small numbers of qubits in labs. These lack sufficient qubits to be generally useful but do appear to indicate that useful quantum computers are likely to be possible. If there is a quantum computer with enough qubits to be generally useful I am not aware of it and there is no public indication of any breakthrough at this time. There appear to be substantial technical and theoretical problems to be worked out before quantum computers become a reality.

    Is it possible that someone, somewhere has actually constructed a useful QC in defiance of all the skeptics

    As far as I know they are all in the proof of concept stage in physics laboratories with very modest numbers of qubits. Never claimed otherwise. It does not follow however that quantum computers are an impossibility. Based on my understanding of the work accomplished thus far I suspect they probably can become a reality eventually but I make no claims regarding when that may be.

  37. NP-complete is still complete in Quantum computing by Anonymous Coward · · Score: 0

    But quantum computers are not that special or are they? What I learned from quantum computers is that they just enable another wave of miniaturizations until manufacturers are able to fit the power of the modern large super computers in a smart phone. Quantum computer theoretically enables storage in electrons, where normal computers can only store information by letting electrons change the state of a component.
     
    So in stead of 0 or 1, you will have 0, 1, 3, or 4 (or whatever the amount of states they can give to a qbit). This also means that the answer of a computation can be 0, 1, 2 or 3. But this means you need a completely different style of programming and that style of programming will probably so complex that nobody except a few talented mathematicians are able to get everything out of a quantum computer.

    A simple if (variable == 1) will give a result of yes or no or maybe or probably. What can you do with such answer as a programmer? Sorting can be made faster, because you could condense 'if (var == 1) else if (var >1) else if (var 1) else error:undefined' in one test on a quantum computer which only takes one clock cycle versus 4 on a normal computer. Thus some of the exponential problems on a normal computer seem to be able to be done in a non exponential quantum program. But who will write that kind of program if quantum computers will ever become available?

  38. Corollary to Betteridge's Law by Anonymous Coward · · Score: 0

    Isn't there a corollary to Betteridge's Law about headlines stated as questions for headlines stated as speculations such as:

        "Currently Quantum Computers Might Be Where Rockets Were At the Time of Goddard"

    Basically, when a headline is stated as a speculation, the answer is still no ;)

  39. The plural of anecdote is not data. by Anonymous Coward · · Score: 0

    This is the worst and most shoddy logic i have ever seen. This isn't a comic book, trends in one completely different tech do not correspond to other trends in other techs, or for anything, really.

    Is france going to invade russia in the winter again? It'll be winter soon, the trends say it must happen because it has happened once before!

    Humans are just not cut out for reason, it would seem.

  40. Quantum computing won't work by Anonymous Coward · · Score: 0

    If entanglement is not real, quantum computing will not work:

    https://en.wikipedia.org/wiki/Loopholes_in_Bell_test_experiments

  41. Might by Anonymous Coward · · Score: 0

    And then again, might not.

  42. Re: And monkeys might .... by billstewart · · Score: 1

    What a hopeless article. Yes, real quantum computing would be cool, and D-Wave has been doing quantum-y things with investor money for a decade or so, and scientists have developed improved more standard kinds of quantum computers to the point that they can now factor 21, surpassing the record of factoring 15 that held for a few years, and maybe sometime in the future quantum computers will be as far advanced beyond that as today's rockets are beyond the ones Goddard had on paper a century ago or his early flying models 90 years ago, or maybe not (or maybe both at once, because YOU CAN DO THAT with quantum.)

    But like most articles about quantum stuff in the popular press, and 99.9999% of content about it in the New Age business, it follows the paradigm of

    1. I don't understand quantum!
    2. I can imagine really cool things that I don't understand how to make!
    3. ????
    4. PROFIT! , err, Therefore, quantum is how to make really cool things I want! QED!

    Quantum physics isn't a Simple Matter Of Engineering like rocketry (and there are reasons for the phrase "Rocket Scientist" - rocketry's also more than just a S.M.o.E, no matter what you remember from those Heinlein stories you read as a kid about building spaceships in your back yard.) Mathematics and physics breakthroughs don't just happen because you really really want them to or because you pour lots of money into the engineering (though especially for the physics, that really helps.)

    And yes, D-Wave might be on to something, or they might be pursuing a dead end, and we'd learn valuable things by helping them do either one, if they publish enough detail about their work, and maybe they can build quantumy computers that are useful for real-world problems even if you can't use them to run Shor's Algorithm to crack factoring-based crypto. But just because rocketry was at sort of a cusp a century ago, and lots of other technologies have gone from "not ready/usable yet" to "useful" that doesn't mean that quantum computing is one of them; lots of other technologies have gone from "not ready/usable yet" to "old obsolete dead ends."

    --

    Bill Stewart
    New Fast-Compression-only CPR http://preview.tinyurl.com/dy575ks
  43. Re:Goddard? Not so fast... by Jookey · · Score: 1

    German names? Like Tsiolkovsky?

  44. Re:NP-complete is still complete in Quantum comput by lucien86 · · Score: 1

    You are probably tight but for the wrong reasons. I have worked developing a Strong AI algorithm for over twenty years, and have developed a basic quantum model of quantum computation in the brain. From this perspective q-bits are a big part of the problem, created with insufficient lateral thinking and an insufficient grasp of the problems of quantum coherence above the quantum limit.

    In the brain the quantum element gives a massive performance boost - so much so that without it complex brains basically wouldn't work. Know how the brain solves the problem of coherency? it doesn't, instead it basically does its quantum calculations at the molecular scale. Nor do brains use q-bits. What they do use is something quite different - unfortunately the answer is still commercially sensitive - and may form part of future patents. Quantum's big trick though ... is that like genetic computing algorithms it can solve problems using 'non-algorithmic' methods - and its extremely good at it. Like a 'magic box' it can solve problems that should be completely insoluble otherwise..

    The other point about quantum computing is that brains do their quantum calculations at human body temperature - the big problem with current technology is that it needs liquid nitrogen or even liquid helium temperatures - complex and expensive to maintain.. If we really crack how the brain does it - it leads straight to room temperature super conductors and other completely new technologies...

    --
    Below the speed of light Special Relativity is one of the most accurate theories in physics - above the speed of light..
  45. gweihir, 1 thing's sure: You're incompetent by Anonymous Coward · · Score: 0

    "Run, Forrest: RUN!!!" vs. a fair challenge http://news.slashdot.org/comme...

    * I find it UTTERLY HILARIOUS seeing a bullshit artist mere talk TROLLING done zero loser like you has the NERVE to state what you did - especially after you RAN in that link above, gweihir... lol!

    You don't HAVE the ability to code & the link above evidences it - you're a bullshit blowhard, nothing more - a MERE TECHIE MENIAL @ best/most!

    (FACT: Minus coders like myself, you TECHIE or NETWORK ADMIN MENIALS ARE HELPLESS - just as you've SHOWN yourself to be in that link above!)

    APK

    P.S.=> Keep on shooting your blowhard done nothing in computing mouth off gweihir - I'll be RIGHT THERE AGAIN to expose your crap yet again (have fun with the shame you'll have to publicly endure here & YOU STARTED IT WITH ME YOU USELESS TROLLING LOSER WITH NO SKILLS BUT LOTS OF MERE "TALK", lmao)... apk

  46. gweihir, quit trying to 'play smart': Face this by Anonymous Coward · · Score: 0

    "Run, Forrest: RUN!!!" vs. a fair challenge http://news.slashdot.org/comme...

    * I find it UTTERLY HILARIOUS seeing a bullshit artist mere talk TROLLING done zero loser like you has the NERVE to state what you did - especially after you RAN in that link above, gweihir... lol!

    You don't HAVE the ability to code & the link above evidences it - you're a bullshit blowhard, nothing more - a MERE TECHIE MENIAL @ best/most!

    (FACT: Minus coders like myself, you TECHIE or NETWORK ADMIN MENIALS ARE HELPLESS - just as you've SHOWN yourself to be in that link above!)

    APK

    P.S.=> Keep on shooting your blowhard done nothing in computing mouth off gweihir - I'll be RIGHT THERE AGAIN to expose your crap yet again (have fun with the shame you'll have to publicly endure here & YOU STARTED IT WITH ME YOU USELESS TROLLING LOSER WITH NO SKILLS BUT LOTS OF MERE "TALK", lmao)... apk

  47. Thanks 4 UR fascinating incompetence gweihir by Anonymous Coward · · Score: 0

    "Run, Forrest: RUN!!!" vs. a fair challenge http://news.slashdot.org/comme...

    * I find it UTTERLY HILARIOUS seeing a bullshit artist mere talk TROLLING done zero loser like you has the NERVE to state what you did - especially after you RAN in that link above, gweihir... lol!

    You don't HAVE the ability to code & the link above evidences it - you're a bullshit blowhard, nothing more - a MERE TECHIE MENIAL @ best/most!

    (FACT: Minus coders like myself, you TECHIE or NETWORK ADMIN MENIALS ARE HELPLESS - just as you've SHOWN yourself to be in that link above!)

    APK

    P.S.=> Keep on shooting your blowhard done nothing in computing mouth off gweihir - I'll be RIGHT THERE AGAIN to expose your crap yet again (have fun with the shame you'll have to publicly endure here & YOU STARTED IT WITH ME YOU USELESS TROLLING LOSER WITH NO SKILLS BUT LOTS OF MERE "TALK", lmao)... apk