Slashdot Mirror


IBM Touts Quantum Computing Breakthrough

Lucas123 writes "IBM today claimed to have been able to reduce error rates and retain the integrity of quantum mechanical properties in quantum bits or qubits long enough to perform a gate operation, opening the door to new microfabrication techniques that allow engineers to begin designing a quantum computer. While still a long ways off, the creation of a quantum computer would mean data processing power would be exponentially increased over what is possible with today's silicon-based computing."

132 comments

  1. And people say .... by JimCanuck · · Score: 3, Funny

    And people keep telling me IBM isn't innovative and cutting edge anymore. [/Sarcasm]

    1. Re:And people say .... by Anonymous Coward · · Score: 0

      Is that actually sarcastic?

    2. Re:And people say .... by Anonymous Coward · · Score: 0

      Times change, they kinda dropped the ball with the "PC's will never catch on" thing.

    3. Re:And people say .... by The_Crisis · · Score: 2

      Yes, Sheldon...sarcasm.

      --
      "It is a fine line between lazy and efficient."
    4. Re:And people say .... by Anonymous Coward · · Score: 0

      Well, we'll see. It won't be until I see a "Deepak Chopra Guide to Quantum Computing" that I'll be inclined to think that this is truly a breakthrough.

    5. Re:And people say .... by Haxagon · · Score: 2

      Cloud computing seems to suggest otherwise. I'm sure it was cheaper to get out of PCs before the general PC profit margins decrease dramatically as people move toward dumb terminals once again. It's not entirely a good thing.

    6. Re:And people say .... by Anonymous Coward · · Score: 5, Insightful

      The depressing thing is that you will never see anything like this out of Apple. Billions of dollars in reserves and no "Jobs Labs".

    7. Re:And people say .... by Anonymous Coward · · Score: 1, Insightful

      no, but apple has been pretty focused on making technology cool and even desirable to the masses. While perhaps not as interesting to you as Quantum computing, its certainly important, and something that IBM was never able to do.

    8. Re:And people say .... by Darth+Snowshoe · · Score: 5, Insightful

      THIS, like times a million. NYTimes this weekend had an excellent article on the history of Bell Labs (the laser, the transistor, communications satellites, etc). HP, whatever else you may think of them, supported the pure research lab which brought forth the memristor. IBM can point to things such as this, its various efforts to simulate a brain, and Watson. Google, bless their souls, is pushing for automated driving (this may not sound in the same league, until you realize the consequences for everybody who drives or rides in an auto.)

      Where is the pure research at Apple? Do they think they can get by on just making better UIs, for the rest of forever? Are they at all part of a larger community?

    9. Re:And people say .... by bws111 · · Score: 1

      Wait, you mean International Business Machines doesn't make things for the masses? Who'd a thunk it?

    10. Re:And people say .... by Gilmoure · · Score: 3, Funny

      I wonder what animal will go on the cover of O'Reilly Quantum Computing In a Nutshell; a cat in a box?

      --
      I drank what? -- Socrates
    11. Re:And people say .... by Anonymous Coward · · Score: 0

      Wait, you mean International Business Machines doesn't make things for the masses? Who'd a thunk it?

      Wait, you mean Apple Computer didn't make computers out of apples? Who'd a thunk it?

    12. Re:And people say .... by BitZtream · · Score: 1, Interesting

      BASF, we don't make the things you use.

      We make the things you use BETTER.

      That was the commercial I remember for several years.

      Its not always about making cutting edge front page news break throughs, sometimes its just about refining something until its just right after someone else made the break through and then forgot about it because they moved on to the next shiny thing.

      Both kinds of people/businesses are useful and needed, well atleast until this utopian dream you have becomes reality and everyone works for the common good anyway.

      --
      Persistent Volume manager for Kubernetes - https://github.com/dwimsey/openshift-pvmanager
    13. Re:And people say .... by Anonymous Coward · · Score: 1

      No, they think they can get by on just making better UIs and using third-party or licensed hardware in shiny cases put together by suicidal chinese slaves. Also, suing their competitors to death when actual science prevails over the macfaggotry of the jobsian cult.

    14. Re:And people say .... by vikingpower · · Score: 2

      Reminds me of the t-shirt a colleague of mine wears. "Wanted - Schrödinger's cat. Dead and alive".

      --
      Religous speak to God. Insane are spoken to by God. When all shut up, one can finally hear Shostakovich in peace
    15. Re:And people say .... by Anonymous Coward · · Score: 0

      As long as they can sue you for having a Design/UI with same colors and rounded edges ;)

    16. Re:And people say .... by steelfood · · Score: 5, Interesting

      Apple doesn't do technological research. Instead, they pour all of that money into usage research, so that they can design an improved user experience.

      It's not necessarily a bad thing. There's a place for both the technological side, and the usability side. Most tech companies focus on the technology side while neglecting the usability, which is why so much technology ends up unusable by laymen.

      Microsoft actually does a lot of usability research too. But the difference between Microsoft and Apple is that Apple has (or had) someone steering the ship. They're a top-down dictatorship-style management house. Microsoft is more about internal competition to see who wins out. They're more of a survival-of-the-fittest, cream-of-the-crop-rises-to-the-top type of management house.

      --
      "If a nation expects to be ignorant and free in a state of civilization, it expects what never was and never will be."
    17. Re:And people say .... by geoffrobinson · · Score: 1

      It's not a zero-sum game. This would only be a problem if Apple was the only company that ever will exist. Let them do what they do well and let IBM do what they do well.

      --
      Except for ending slavery, the Nazis, communism, & securing American independence, war has never solved anything.
    18. Re:And people say .... by Darth+Snowshoe · · Score: 3, Informative

      But Apple SHOULD do technological research. Because it provides a long term competitive edge for them, and because its the right thing to do. Corporations, like people, live in a larger society, culture (and nation) and they benefit from those things. Apple would not exist were it not embedded in the Silicon Valley culture emanating from Stanford and Berkeley. Apple should give something back. Maybe Steve would not understand this, but surely Woz would.

      Yeah, iPhones are great, but honestly, ten years from now, we'll be on to a newer, better UI (glasses, brain implants, holodecks, or whatever.) It turns out we're still using lasers and transistors and communications satellites, all invented by Bell Labs in the 60s.

      Here, I'm pasting the best bit from the NYTimes/Bell Labs article, written by Jon Gertner;

      "But what should our pursuit of innovation actually accomplish? By one definition, innovation is an important new product or process, deployed on a large scale and having a significant impact on society and the economy, that can do a job (as Mr. Kelly once put it) “better, or cheaper, or both.” Regrettably, we now use the term to describe almost anything. It can describe a smartphone app or a social media tool; or it can describe the transistor or the blueprint for a cellphone system. The differences are immense. One type of innovation creates a handful of jobs and modest revenues; another, the type Mr. Kelly and his colleagues at Bell Labs repeatedly sought, creates millions of jobs and a long-lasting platform for society’s wealth and well-being."

      The whole article is here (paywall yadda-yadda)
      http://www.nytimes.com/2012/02/26/opinion/sunday/innovation-and-the-bell-labs-miracle.html?pagewanted=all

    19. Re:And people say .... by Anonymous Coward · · Score: 0

      Instead, they pour all of that money into usage research, so that they can design an improved user experience.

      Nonsense, they have close to $100 billion in cash that they aren't pouring into anything.

    20. Re:And people say .... by msobkow · · Score: 1

      Bullshit.

      Apple invests in PATENTING UI components so they can SUE companies and people who use them.

      IBM, on the other hand, sponsored, developed, published, and GAVE AWAY the Common User Interface Standard.

      Apple has no intent on sharing anything with anyone. They want to OWN the market. All markets. And any device that makes the mistake of using a common sense gesture, icon, or interface that anyone with a functioning brain cell could have come up with.

      Apple is a pimply leech on the ass of computing, sucking away for all it's worth, and giving NOTHING back.

      --
      I do not fail; I succeed at finding out what does not work.
    21. Re:And people say .... by sexconker · · Score: 1

      Yes, Sheldon...sarcasm.

      Bazinga.

    22. Re:And people say .... by Anonymous Coward · · Score: 0

      Clearly, they know a little bit.

    23. Re:And people say .... by Anonymous Coward · · Score: 0

      "Better UIs"??? What the hell are you smoking, and where do you live that it's legal??

    24. Re:And people say .... by Anonymous Coward · · Score: 0

      You can't tell me that if Apple drop a measly $1Billion over several years, for a pure R&D lab isn't a good idea. Even just for to get some people in there thinking outside the box. They have around $90Billion sitting in the bank collecting interest!

      I'll predict it now. Apple will stagnate not from it's user experience devices, or from the massive user usage data it has and moneys it acquires from licensing said data, but from the singularity that lies at the intersection of personal historical data, and their physical presence at the now. They're bound by external variables. Namely, cellular bandwidth, battery life, and handheld computational power. AFAIK, and please correct if I'm wrong, they aren't actively developing improvements on any of these fronts, in house.

    25. Re:And people say .... by mcgrew · · Score: 1

      Why is that so depressing? Apple is design and marketing, not engineering or research. And they do a damned good job of it, too -- they do usually have the best designs if not the best engineering (e.g., iPhone antenna).

    26. Re:And people say .... by forkfail · · Score: 1

      It may be cyclic.

      We started with mainframes, then went to PC's. From somebody else having your computing resources to you having them.

      While the cloud may be inherently distributed, it is like the mainframe approach in so far as your interface is much like a mainframe interface, and someone else again has your computing resources.

      Ironically, quantum computing might well put cycle things back to the PC model, in so far as you might no longer need the power of the cloud to get the job done; it might be feasible to have adequate and massive power in your desktop box again.

      --
      Check your premises.
    27. Re:And people say .... by forkfail · · Score: 2

      I wonder what animal will go on the cover of O'Reilly Quantum Computing In a Nutshell; a cat in a box?

      You won't know till you open the book.

      --
      Check your premises.
    28. Re:And people say .... by arisvega · · Score: 1

      .. focused on making technology cool and even desirable to the masses.

      You probably mean the middle class

      --
      The three laws of thermodynamics:(1) You can't win. (2) You can't break even. (3) You can't even quit.
    29. Re:And people say .... by gorzek · · Score: 1

      The Cloud is successful for a few reasons:

      1. Most users don't back anything up.
      2. Most users have no clue whatsoever how to set up a server of any kind, nor to properly configure their firewall/router for remote access.
      3. It's easier to share things on a platform your friends and family are already using than for everybody to have their own.
      4. Bandwidth has become cheap and prevalent enough that pushing data around public networks is relatively quick and convenient.

      Everyone could have their own "Cloud" on their home PC, but until someone develops a perfectly slick package that does everything Cloud services do in a completely idiot-proof fashion, Cloud services are going to keep gaining momentum.

    30. Re:And people say .... by gorzek · · Score: 1

      Apple's not in the business of researching, producing, and selling bleeding-edge computers. Apple's focus is primarily on pleasant design, intuitive user interfaces, and an overall integrated experience using commodity-grade hardware.

      (I say this as someone who doesn't even buy their products.)

    31. Re:And people say .... by marcosdumay · · Score: 1

      Do they think they can get by on just making better UIs, for the rest of forever?

      I don't know if they can, but they should be able to do just that. As long as they make the best UI (do they make it now?) if you want a nice UI, you go with them. The same way that if you want some revolutionary tech, you get it from IBM, or some other company that invest on tech.

      It is called especialization. It is one of the biggest drivers of growth since the XVIII century.

    32. Re:And people say .... by TheSkepticalOptimist · · Score: 3, Insightful

      Apple will wait for everyone else to have quantum computing, and then release a device making the masses believe Apple invented quantum computing because they call it iQuantum.

      But I agree. Apple has 98 billion in the bank and is worth over 1/2 trillion on paper, yet they are only focus on repackaging largely off the shelf components invented by other companies into fancy packages and spending way too much money designing retail stores that boast large sheets of seamless glass.

      What strikes me as really depressing is that while Bill Gates is generally hated among Slashdot readers he had given more back to the world in the terms of his charity work. In his "retirement" he is focused on trying to solve some of the world's biggest issues in poverty and quality of life.

      On the other hand, Steve Job's stayed at Apple pretty much up till his death bed creating an empire where people just thrown them money to buy into a walled garden of content and hardware while Apple shits on any other competitive product or company.

      How has Apple given back to the world? Creating jobs where the pressure is so high people kills themselves when they don't meet Apple's quota's or quality standards? Creating products people actually kill for? Creating a market of "want" that is never satiated until someone becomes bankrupt?

      Apple needs to start giving back, put some of them billions into charity and maybe try to invent something useful for the world that does have an "i" in front of it.

      I sincerely think that Apple has enough money to cure cancer, but the company is more interested in hoarding money and technology patents. Its a shame really that everybody's beloved Apple is probably one of the most evil, greedy, selfish and vindictive companies wrapped in a protective bubble of smugness.

      --
      I haven't thought of anything clever to put here, but then again most of you haven't either.
    33. Re:And people say .... by Anonymous Coward · · Score: 0

      Cloud services are going to keep gaining momentum.

      Until the Americans shut down one of the bigger servers, that is.

    34. Re:And people say .... by JimCanuck · · Score: 1


      It had nothing to do with PC's the original quote, seeing as IBM started to produce small PC's in 1975 which was years ahead of the competition (The IBM 5100), instead your misquote comes from Thomas Watson's so called quote in 1943 about electronic computers, and yet since 1973 people knew it was a misquote and outright wrong.

      If your going to open your mouth (or in this case type) please read some history before you remove all doubt.

    35. Re:And people say .... by thesandtiger · · Score: 1

      Because Apple isn't that kind of company and seems to hold no ambitions to become one?

      Apple is really good at taking various pieces of existing technology and combining them in a way that nobody else has, or, if a similar product exists, taking it and refining the hell out of the user experience. That's it.

      Why should they spend money on something that's outside their intended domains of expertise? It would be like complaining that the Gap doesn't spend money researching basic materials science so they can make better clothes, or that Nintendo doesn't have a neuroscience research facility set up so that they can eventually make more addictive games or something.

      Now, I wouldn't complain if Apple took 50 billion and set up a Jobs Labs or something (and long live the Woz, even if it means it wouldn't be named after him), and it would certainly be a pretty awesome thing to do, but I have a hard time getting bothered by it as you seem to be.

      --
      Since I can't tell them apart, I treat all ACs as the same person.
    36. Re:And people say .... by thesandtiger · · Score: 1

      Given some of the unpolished turds Microsoft has put out in the past, that cream must be pretty curdled...

      In reality though, the stuff Microsoft has put out makes me think more of an organization with tons of internal competition, yes, but one in which people sabotage each other or engage in politicking in order to force pet ideas into projects resulting in products clearly designed by committee and often containing so many compromises that whatever good points are often completely outshone by really horrific kludge.

      Microsoft does do a lot of research - and a lot of what they come up with is AMAZING, really - it's just that in the whole process of turning it into a product the internal politics comes into play and ruins much of it horribly which is a real shame.

      Fortunately for them, they do have enough money that they can survive the refinement process and eventually scrape off the shit that gets attached to many of their 1.0 products.

      --
      Since I can't tell them apart, I treat all ACs as the same person.
    37. Re:And people say .... by Anonymous Coward · · Score: 0

      If your going to open

      "you're".

  2. another misleading quantum computing article by Anonymous Coward · · Score: 5, Insightful

    1) Repeated news about being able to perform some operation with a tiny number of qubits do not suggest that it is probably true that a useful quantum computer of practical size can be built;

    2) It wouldn't mean data processing power would be "exponentially increased", but that certain algorithms could be executed asymptotically faster.

    QC remains a second rate branch of mathematics for computer science types who don't want to apply themselves to less glamorous problems in the more mature and challenging fields of classical computing. For engineers, it's still in the nuclear fusion stage: kinda just possible in the right conditions, but under no conditions shown useful.

    1. Re:another misleading quantum computing article by rhook · · Score: 1

      That is just the kind of attitude that holds back progress.

    2. Re:another misleading quantum computing article by Andreaskem · · Score: 1
    3. Re:another misleading quantum computing article by Anonymous Coward · · Score: 0

      Actually it's this kind of attitude that makes the scientific community possible at all. He's right, and many agree with him. It's a serious problem to show that scalable Quantum computers are possible.

      However, racking down critics based on their "bad attitude" is completely ridicules behavoir in any scientific discussion. QM itself had much benefit from the debates between Niels Bohr and Einstein, if either one had just childishly said "You just have a bad attitude and your holding back progress", we would only have lost actual progress.

  3. Exponentially? by drooling-dog · · Score: 1, Informative

    data processing power would be exponentially increased over what is possible with today's silicon-based computing.

    Please, please, please stop misusing the word "exponentially". It just means that something is increasing (or declining) at a constant rate, which is practically the opposite of what is meant here.

    1. Re:Exponentially? by Anonymous Coward · · Score: 0

      Eponetially means that is is at a constantly increasing rate, which is what is happening here. Your Ignorance is showing.

    2. Re:Exponentially? by vlm · · Score: 4, Informative

      The whole discussion is fubar

      First of all, the derivative of e to the x ("exponential function") is e to the x. Yeah thats true the D is the same as the function itself. Welcome to 1st semester calculus, kids. Not a constant, not even sure what "constantly increasing" means mathematically, although if AC meant its linear thats a bucket of fail too.

      The next fubar is quantum computing doesn't provide a magic exponential speedup. There is a page length summary on the wikipedia but it should come as No Surprise Whatsoever to anyone in CS that different algorithm designs inherently have different big O notation and magically sprinkling quantum pixie dust doesn't change that, some algos are linear, some poly, some constant, some exponential, all quantum computing does is swap about where some belong. Solve for X where X+1=2 is not gonna change much, factoring into primes is going to change quite a bit. Some of the most interesting problems are polynomial time not exponential in quantum computing. http://en.wikipedia.org/wiki/Quantum_computer#Potential

      --
      "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
    3. Re:Exponentially? by NoNonAlphaCharsHere · · Score: 1

      It could have been worse. They could have said "quantum".

    4. Re:Exponentially? by Anonymous Coward · · Score: 0

      Like a quadratic then? I always wondered what 'eponetially' meant.

    5. Re:Exponentially? by Curunir_wolf · · Score: 2

      Wouldn't this be a game-changer for encryption, though (if they can actually make it work, that is)? I mean, brute-force decryption seems like exactly the kind of computational task that a quantum computer could easily handle. So a brute-force attack on a key that may take hundreds of years on a current supercomputer could be done in a few minutes. No password would be safe from any organization with access to that kind of computing power. Or am I understanding the potential?

      --
      "Somebody has to do something. It's just incredibly pathetic it has to be us."
      --- Jerry Garcia
    6. Re:Exponentially? by drooling-dog · · Score: 1, Troll

      Oy... The rate is constant, meaning that the increase is in constant proportion to the value of the function at any given time. That's why calculations of continuous compound growth take exponential form, and it's a result of e^x being its own derivative, as you point out.

      Of course neither the OP nor I were talking about the computational order ("Big-O") of a quantum algorithm, because no specific algorithm was under discussion. If such algorithms were typically exponential in N - i.e., O(e^N) - that wouldn't be very encouraging news, would it? The word "exponentially" was clearly used to mean a large, discontinuous increase - a quantum leap, if you will - and not the kind of smooth, fixed-rate growth that it implies in reality.

      But, whatever... It's a peeve of mine.

    7. Re:Exponentially? by vlm · · Score: 2

      Wouldn't this be a game-changer for encryption, though (if they can actually make it work, that is)? I mean, brute-force decryption seems like exactly the kind of computational task that a quantum computer could easily handle. So a brute-force attack on a key that may take hundreds of years on a current supercomputer could be done in a few minutes. No password would be safe from any organization with access to that kind of computing power. Or am I understanding the potential?

      Not necessarily, no. For any crypto app you can come up with some formula where you chunk in the number of bits and it spits out how long it takes to crack it. It exclusively has to do with scalability in design. Double a linear algo and that number takes twice as long. Most (good) crypto is exponential so triple the number of bits it goes up by 3^3 or 27 times longer or whatever. The deal is quantum computing for some crypto increases by poly instead of exponential.

      What no one wants to talk about is what if the quantum solution for a given sample takes 100 years ... thats a bucket of fail even if it only increases poly. That is completely freaking useless because it scales nicely if you double the number of bits its just great that it only increases to 200 years, but no one can wait 100 years anyway, so...

      This is also the strongly minority belief I hold about P=NP where I'm willing to accept there might be a poly solution to a supposedly exponential problem, but the constant factor for a trivial problem might be like a factorial number of universe-lifetimes so theoretically it exists which is why it hasn't been disproven yet and also it has no real world effect.

      Much like the physics analogy of time dilatation at highway speeds, it exists, but its irrelevant in scale.

      --
      "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
    8. Re:Exponentially? by Anonymous Coward · · Score: 0

      Depends on the form of encryption you use, not all encryption methods are vulnerable to Fourier sampling attacks like RSA is. I seem to recall seeing a story here a year or so back claiming the McEliece cryptosystem to be immune to this attack?

    9. Re:Exponentially? by drooling-dog · · Score: 1

      Your Ignorance is showing.

      Well, somebody's certainly is. Suppose that something grows continuously at a constant rate of 10% per year. That is exponential growth, because it fits the relation x = e^(0.1*n). Try it.

    10. Re:Exponentially? by Anonymous Coward · · Score: 0

      That's 10% on the last years principle + last years 10% on interests, you stupid fuck. The slope of e^(.1n) is .1*e^(.1*n), which is not constant. Go back to the wiki and start at y=mx+b before you make yourself look like a fool again.

    11. Re:Exponentially? by drooling-dog · · Score: 1

      I'm talking about the growth rate (i.e., the 0.1), not the slope of the resulting exponential curve.

      Here, try this: Plot the curve of a quantity that grows by a fixed proportion from one point to the next. E.g., a population that grows by 10% per year. Is that curve linear over time? No, of course not: it's an exponential, and the exponent is the growth rate (multiplied by t), which is constant. It's like magic.

      This is pretty elementary stuff, but before you start calling people a "stupid fuck", maybe you should talk to someone who is more mathematically literate than yourself. You do show good sense in posting anonymously, though; I'll give you that.

    12. Re:Exponentially? by drooling-dog · · Score: 1

      First of all, the derivative of e to the x ("exponential function") is e to the x. Yeah thats true the D is the same as the function itself. Welcome to 1st semester calculus, kids

      Me again... This discussion is long dead, but I have to point out that the exponential growth curve is not e^x but rather a*e^(x*t), where a is the initial quantity, t represents time and x is the rate constant. Now differentiate that with repect to t, and you get the slope a*t, as you would expect from a constant x.

      Hence, a population of 1000 that grows by 1% adds 10 times as many as a population of 100 that grows by the same rate. Constant growth rate, exponential growth. I don't see why this is so difficult, especially among people who came to a discussion on quantum computing.

    13. Re:Exponentially? by _0xd0ad · · Score: 1

      I think your main problem is that you said "constant rate". Rate is kind of ambiguous. To you, that meant increasing by a constant ratio, i.e. A(x+n)/A(x) = A(y+n)/A(y), i.e. exponential growth. To a few other people, it obviously meant increasing by a constant amount, i.e. A(x+n)-A(x) = A(y+n)-A(y), i.e. linear growth (as revealed by AC's introducing the derivative and thinking that proved his point).

      And really, if someone said something was "accelerating at a constant rate", I'd typically assume they meant linear acceleration, not exponential; I wouldn't say that your use of the word "rate" is necessarily any more or less correct than that. There would be less confusion if you'd say "factor" or "percent", rather than "rate".

      "[Exponentially] just means that something is increasing (or decreasing) by a constant factor (percentage) per unit time."

      If you really want to get the point across, you can illustrate with an example: E.g. this will grow by 10% from this year to next, and will grow by another 10% next year to the one after, and 10% the year following, and so on: a constant growth rate of 10%. By the time you drop the word "rate" into the statement, it's already quite clear that you're talking about a product, not a sum. You also won't have to refer to formulae like a*e^(x*t). And heck... why not at least make it friendly and use the compound interest formula that they might recall seeing, A = P*(1+r/n)^(n*t)?

      Anyway, yes, you're absolutely correct: it's completely nonsensical to use the word "exponentially" to describe growth of something from time A to time B. That sort of growth is a simple factor to the trivial power of 1. "Exponential" is only useful when it describes the shape of the curve between A and B, or the shape of the projected curve beyond B - neither of which is the case here. It would have been more appropriate to say that data processing power would be increased by "an order of magnitude" - i.e. by a simple factor. Amusingly enough, it's always assumed either the "order of magnitude" is 10, or the "order of magnitude" is significant in magnitude - neither of which is really implied by its actual mathematical meaning.

  4. Oooooo! by Grindalf · · Score: 0

    Never mind the banter, where's my nano Mac? Show us your sugar cube sized z-series mainframe! :0)

    --
    The purpose of existence is to make money.
    1. Re:Oooooo! by mcgrew · · Score: 1

      Show us your sugar cube sized z-series mainframe! :0)

      The Raspberry Pi isn't much bigger than a large sugar cube, and it's more powerful than any mainframe from 1960.

  5. Re:So by Agent+Z5q · · Score: 0, Redundant

    I have become increasingly disappointed with Slashdot’s lack of good content. This particular story about quantum computing is actually a pretty good one, but they're becoming fewer and farther between. So, I’ve reached the point where I’m going to delete my Slashdot bookmark. Any suggestions for a good replacement tech news website?

  6. economist article more interesting by rgbrenner · · Score: 3, Informative

    The Economist had an interesting article a couple days ago.. at least it's interesting if you don't really know the details of quantum computing:

    Quantum computing: An uncertain future

    Each extra qubit in a quantum machine doubles the number of simultaneous operations it can perform. It is this which gives quantum computing its power. Two entangled qubits permit four operations; three permit eight; and so on. A 300-qubit computer could perform more concurrent operations than there are atoms in the visible universe.

    1. Re:economist article more interesting by Anonymous Coward · · Score: 0

      The Economist is one of the few good magazines left. Love their stuff.

    2. Re:economist article more interesting by Anonymous Coward · · Score: 0

      It is technically correct but misleading. The operations you can do are constrained, so you only get that increase in computing power if the algorithm you are running can make use of quantum operations. Many cannot, so there is no improvement in speed at all.

    3. Re:economist article more interesting by marcosdumay · · Score: 1

      As the AC said, that's misleading.

      Another way to look at it is by having the computer indeed calculating over the entire domain at once (that means, the computer runs the calculation on all the numbers represented with X bits at once), but when you read you can only get the result of one of the calculations. The actual one you'll get is a random one, with a distribution that you can tune.

      That is equivalent to constraining the operations. I think that way of thinking is more intuitive.

  7. Re:Exponentially? Yes by JoshuaZ · · Score: 4, Informative

    Actually, this is a correct use. Some algorithms on quantum computers are exponentially faster than the best known classical algorithms. For example, estimating a Gauss sum http://en.wikipedia.org/wiki/Gauss_sum scales exponentially in time, but the most efficient quantum algorithms are bounded by a polynomial. So exponential speed up is a valid use of the term here.

  8. And two picoseconds later... by Anonymous Coward · · Score: 0

    The software goons find a way to bring even that hardware to a crawl...

  9. Bad explanition of qubit superposition by Gary+van+der+Merwe · · Score: 3, Informative
    Quote from article:

    A qubit, like today's conventional bit, can have two possible values: a 0 or a 1. The difference is that a bit must be a 0 or 1, and a qubit can be a 0, 1, or a superposition of both. "Suppose you take 2 qubits. You can be in 00, 01, 10, and 11 at the same time. For 3 qubits you can be in 8 states at the same time (000, 001, 111, etc.). For each qubit you double the number of states you can be in at the same time. This is part of the reason why a quantum computer could be much more powerful," Ketchen said.

    I find that to be a terrible explanation. What he said: "For each qubit you double the number of states you can be in at the same time." is also true for normal bits. Huh? Here is a better explanation: http://en.wikipedia.org/wiki/Qubit

    1. Re:Bad explanition of qubit superposition by Anonymous Coward · · Score: 1

      Actually, it is correct. An additional normal bit doubles the number of *possible* states. An additional (entangled) qubit doubles the "number of states you can be in at the same time" (with emphasis being on "at the same time"), which is a colloquial description of doubling the dimension of the state space.

    2. Re:Bad explanition of qubit superposition by Hatta · · Score: 2

      No. With regular bits, you can only be in one state at once. Adding a bit doubles - 1 the number of states you are not in.

      --
      Give me Classic Slashdot or give me death!
  10. What really IS important: by lexa1979 · · Score: 1

    does it run GNU/Linux ?

    1. Re:What really IS important: by Anonymous Coward · · Score: 0

      How many levels of Doom? How about the Flight Simulator?

    2. Re:What really IS important: by Anonymous Coward · · Score: 0

      I for one look forward to Quake 2030 on a 4Quintaherz quantum processor. :-)

    3. Re:What really IS important: by arisvega · · Score: 1

      And Minecraft. Does it run Minecraft? How does JAVA behave in it?

      --
      The three laws of thermodynamics:(1) You can't win. (2) You can't break even. (3) You can't even quit.
  11. This does _not_ imply scalability! by gweihir · · Score: 5, Interesting

    For conventional computers, as soon as you have "and" and "not" in gate-form, you can do everything, as you can just connect them together. For quantum computers that is not true, as all elements performing the complete computation need to be entangled the whole time.

    IMO, there is now reason to believe that the real-world scalability of quantum computers is so bad that it negates any speed advantage. It seems the complexity of building a quantum computer that can do computations on inputs of size n is at least high-order polynomial or maybe exponential in n. That would explain why no significant advances have been made in keeping larger quantum computing elements entangled in the last 10 years or so and no meaningful sizes have been reached.

    Keep in mind that, for example, to break RSA 2048, you have to keep > 2048 bits entangled while doing computations on them. And you cannot take smaller elements and combine them, the whole > 2048 bits need to represent the input all must be entangled with each other or the computation does not work.

    --
    Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    1. Re:This does _not_ imply scalability! by vlm · · Score: 3, Informative

      Theres a nice wiki page with pages and pages of detailed explanation of what this post is talking about.

      http://en.wikipedia.org/wiki/Quantum_decoherence

      Here's a nice analogy for quantum computing... its a magic old fashioned analog computer with serious reliability and I/O issues. Imagine at the dawn of the computer era you wanted to simulate the statics of a large railroad bridge. In 8 bits it would take a very long time, 16 bits much longer... And to prevent rounding error propagation you have issues. So why not simulate it with a thundering herd of analog opamps which will "instantly" solve the bridges static loads? OK cool, other than all the opamps must work perfectly the entire time you take a measurement which with vacuum tubes is questionable and qubits maybe impossible. The other problem is if you want 32 bit accuracy now your proto-computer engineer needs to build a 32 bit A/D converter to connect to your analog computer... good luck... This is not a perfect quantum computing analogy, but pretty close in many regards.

      There is a bad trend in computer science to assume "all computers and algorithm programming problems are about the same" which they historically have been, but are not in the real world. So given two roughly identical algorithms and problems on two roughly identical computers, the smaller big-O notation wins every time, more or less. That is a huge mistake to try that thinking across widely different architectures... OK so factoring computation is exponential on classical computers and everyone ignores I/O because thats constant with a normal bus design or at worst linear. OK so factoring computation is poly on quantum computers hooray for us... whoops looks like I/O might go exponential and constant factor might be years/decades to get the thing working.

      The way to keep secure with a classical computer is to pick an algorithm that big O scales such that it can't be broken in this universe. The way to keep secure with a quantum adversary is to pick a key size that seems to make it an engineering impossibility to build a quantum computer, even if by some miracle a quantum computer could solve it in poly time if only it could somehow be built.

      --
      "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
    2. Re:This does _not_ imply scalability! by Anonymous Coward · · Score: 0

      Science has to keep trying, I guess, but seriously...

      I get the feeling that this is one of those areas which lives in the same neighborhood as perpetual motion. I mean, if the whole, "measure it and it's no longer true" thing is accurate, then doesn't that kinda imply something?

      But then, I know for a fact I don't clearly understand what the hell they're even trying to do. Quantum mechanics might as well be voodoo witchcraft afaic.

    3. Re:This does _not_ imply scalability! by Anonymous Coward · · Score: 2, Insightful

      Another way of explaining this is that in order to take advantage of the exponential speed-up of quantum computing in practical applications, you need exponentially better management of entanglement and decoherence effects, which turns out to be a very difficult engineering problem. People keep proposing different models for quantum computing hoping that if they do these operations in solid state rather than via NMR, or in Bose-Einstein condensates, or using exotic pseudo-particles, or other means that the entanglement management and decoherence issues will become tractable. To the best of my knowledge, nobody has yet come up with an approach that really addresses the underlying issue.

      I don't really think there's any way to *prove* that it's impossible to do this though, which is why people will keep banging their heads into the problem for some time. Maybe they'll come up with something, or Quantum Computing will become computer science's fusion (a suck of funding and effort that keeps dragging out for decade after decade).

    4. Re:This does _not_ imply scalability! by gweihir · · Score: 1

      I like your analog computer analogy. Maybe for those that are not into electronics: Building a working 32 bit A/D converter (i.e. one that has 32 bits accuracy) is pretty much impossible, even at 24 bits the lower bits are only noise from several different noise sources. And OpAmps are pretty noisy to when you get to that precision level. 16...20 bits is about the practical limit unless you do things like supercooling and even then you only gain a few bits.

      I also completely agree on the countermeasures. And if the exponent on the "polynomial time" is large enough, then there is no problem at all. The polynomial vs. exp mantra is convenience, not necessity for crypto. If you have, say x^2 for users and x^6 for attackers, you can build practical public key crypto on this, especially if the x^2 is runtime, but the x^6 is complexity of the hardware you need to build.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    5. Re:This does _not_ imply scalability! by TheSync · · Score: 1

      For conventional computers, as soon as you have "and" and "not" in gate-form, you can do everything, as you can just connect them together. For quantum computers that is not true, as all elements performing the complete computation need to be entangled the whole time.

      Actually for conventional computers, to implement any binary function you only need either NAND or NOR, the "universal gates".

      For qbit-based Quantum Computing, the universal gate is Controlled Not (CNOT) gate, which can be used to realize any quantum computation.

      But you are correct that in many quantum computations, large number of qubits may need to have coherent entangled states, and that is has proven challenging to scale up large numbers of entangled qubits.

    6. Re:This does _not_ imply scalability! by gweihir · · Score: 1

      A matter of taste. I like to regard AND and NOT as different constructs, since one is unary and one is binary. May have to do with some background in modern algebra I have. Of course, you can combine them, but whether NAND/NOR is really less complex than AND/OR and NOT is up for debate. When implemented classically as TTL, NAND is easier than AND and only minimally more complex than NOT.

      Anyways, entanglement is the primary foe of scalability, other problems are data input and output, since that has to be done in analog, which limits precision to something like less than 32 bits.

      On a related note, CPU speed has hit a wall some years back and complexity has as well. Going multi-core gets less and less effective with distance and most tasks have very limited potential for parallelization. It is possible that what we have today per core is actually close to what can reasonably be done for non-generalizable tasks in this universe. So the end of scalability for conventional computing may be in view as well. Not that I see any serious problem stemming from that.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    7. Re:This does _not_ imply scalability! by Anonymous Coward · · Score: 0

      Building a working 32 bit A/D converter is not impossible, it's just not going to be very fast. If you are measuring a stable (DC) system, such as an analog computer, then you can measure the output of the system indefinitely long (until the machine breaks, or it destabilises for some reason), and sum each sample to get an average that will converge on the correct value. You can get infinite precision with infinite measurement time.

      Say I have a 16-bit ADC measuring a stable input, and the LSB is flipping apparently randomly, but I average four samples and find that 3/4 of LSB are 1, then I can deduce that the value of the true value of the 16th bit is 1, and also the 17th bit is 1. The trouble is that the certainty of my measurement of the 17th bit is only 50% at this stage, and adding bits in this way is exponential, each additional bit added requires double the samples of of the one before it for the same certainty.

      Noise adds uncertainty, for the 24-bit ADCs that have 20bits of "certain" bits at a specific samplerate, the certainty can be improved by averaging several samples, at least 16 samples. For a dynamic signal, this method of approximation doesn't help as you are simply trading bandwidth for precision by lowering your effective samplerate, but the example used was talking about an analog computer, which is a static system (time independent), and we can measure it for as long as we like, until we get sufficient precision and certainty to satisfy our curiosity.

      So we are left with the result that an analog computer has a time/precision curve in the same way that a digital computer running a successive approximation algorithm has an iteration/precision curve. Also neither a digital or analog computer can come up with an exact solution, as the analog system is limited by noise in the inputs and outputs, and measurement time, and a digital system is limited by quantisation of the inputs (number of bits) and execution time (and iterations for SA methods).

    8. Re:This does _not_ imply scalability! by vlm · · Score: 1

      Close but you missed a point in the system. If and only if the input signal is noiseless and/or the spectrum of the noise is white (almost always isn't AGWN) and completely driftless over time.

      which is a static system (time independent), and we can measure it for as long as we like

      There is no such thing out there, and at the 32 bit level there is a lot of logic chopping and special circumstances required. Maybe something like counting 32 bits worth of individual photons in a laboratory setting...

      I do agree with your analysis.... if the "raw analog signal" has a theoretical 16 bits of accuracy, you can smack a 8 bit A/D against it for a long time to get a 16 bit piece of massaged meaningful data. But smack a 20 bit A/D converter against a raw signal that inherently limits at 16 bits and you still only get 16 bits of data. Note I'm not talking about DSP techniques for pulling data below the noise level, I'm talking about the data itself only containing 16 bits worth of data regardless of the SNR.

      Shannon describes an upper limit on a AGWN channel but it assumes otherwise perfect signal path... its an upper limit not an always achievable goal.

      --
      "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
  12. Re:So by garaged · · Score: 1

    I dont know anything better, and you will be dissapointed with scientific journals too, so get used to it

    --
    I'm positive, don't belive me look at my karma
  13. Re:So by vlm · · Score: 1

    Any suggestions for a good replacement tech news website?

    You'll have to clarify your definition. If you want "tech news" as in news about "hard science" tech there are places like arxiv.org or PLOS for bio stuff. My best guess for IT type primary sources is maybe the debian-announce mailing list or the daily SANS ISC diary? There are no primary source places that I'm aware of with social media type features, not /. certainly not on G+ or whatever.

    If by "tech news" you mean news about other tech news sites, if you prefer a weekly format thats "this week in tech" and some other twit and rev3 shows and/or at least some /. articles. One important filter consideration is I don't want to go to a site exclusively populated with "txt speak" and/or total noobs. "Hay guys I just heard of this unix port 4 my pc its called linux has any1 else hear herd of it????!?". Sorry I don't want to see that. I haven't been a noob to this computer thing since 1981 or to the internet since the (very) late 80s.

    --
    "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
  14. Welcome H(I)A(B)L(M) by na1led · · Score: 0

    I wonder if IBM will be upgrading Watson with a Quantum computer brain. Won't be long now before they invent HAL.

    --
    -- By all means let's be open-minded, but not so open-minded that our brains drop out.
  15. I miss IBM PC's by thaiceman · · Score: 1

    I miss the days when IBM actually made PC's they were always rock solid. You could beat someone to death with one of there laptops and after wiping the blood off it it would still work...

    1. Re:I miss IBM PC's by vlm · · Score: 1

      I miss the days when IBM actually made PC's they were always rock solid. You could beat someone to death with one of there laptops and after wiping the blood off it it would still work...

      Model M keyboard with the steel backplate and buckling springs. Still use mine with a PS/2 to usb converter thing (not an adapter, a more expensive converter). Lack of a windows key didn't bother me until I switched to the "awesome" windowmanager which likes to use that key as a control key. Bummer.

      --
      "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
    2. Re:I miss IBM PC's by thaiceman · · Score: 1

      I didn't even think about the keyboards, which reminds me that I have a few in the basement hooked up to various machines. I don't get to use them as much as I used to because I use my laptop for all of my daily driver stuff. If you ever break it (not likely) you can pick up a replacement from Unicomp: http://www.pckeyboard.com/ They are expensive but its the only way to get a new model m these days unless you come across an unopened IBM branded one somewhere (in which case its worth a small fortune).

    3. Re:I miss IBM PC's by Anonymous Coward · · Score: 0

      I miss the days when IBM actually made PC's they were always rock solid. You could beat someone to death with one of there laptops and after wiping the blood off it it would still work...

      What's wrong with using a simple axe ?

    4. Re:I miss IBM PC's by Anonymous Coward · · Score: 0

      I miss the days when people actually knew the difference between there and their.

    5. Re:I miss IBM PC's by vlm · · Score: 1

      Why I'll be... a brand new 104 key type M... that means a windoze key to drive "awesome" window manager with. I may have to retire my old PS/2 type M...

      They're not expensive, they're only a hundred bucks. If they're as good as a real type M, your grandkids will be using them, which works out to "about a can of soda per month". Expensive is something like an all plastic "gamers keyboard" for $30 that only lives for 6 months before keys start sticking (true anecdotal story).

      --
      "Science flies us to the moon. Religion flies us into buildings." - Victor Stenger
    6. Re:I miss IBM PC's by thaiceman · · Score: 1

      I haven't personally used one of the Unicomp keyboards but from what I understand they hold the rights & are the only company producing the Model M still. Don't retire it, use it on a "retired" machine you can always setup your own router/server with something like clearos or a pbx or better yet both on the same machine ;)

  16. Re:So by HaZardman27 · · Score: 4, Funny

    has any1 else hear hurd of it????!?

    FTFY.

    --
    Apparently wizard is not a legitimate career path, so I chose programmer instead.
  17. Please enlighten me : Quantum computers & MWI by Altesse · · Score: 1

    Ok, IANAP, but, like many slashdotters, am interested in all things science and especially quantum mechanics. Please explain, if you may, this contradiction, because I've been unable to find a good explanation in anything I've read so far.

    If we consider the many worlds interpretation to be viable, from what I understand :
    - when a scientist will start up the very first quantum computer for the first time -- say, a big 250 qubit computer -- and will test it against a big cypher or whatever, 2^250 universes will participate in the process
    - after the quantum collapse, the unique solution will be found, the cypher will be cracked and OUR scientist in OUR world will open a bottle of champagne and congratulate with their team

    ... Does this mean that, in 2^250 - 1 universes, the scientist will commit suicide, or get fired, (because obviously, the other solutions are uncorrect) ?

  18. Pre-emptive strike against wtf is a QC by mathimus1863 · · Score: 5, Informative

    I took a class on Quantum computing, and studied many specific QC algorithms, so I know a little bit about them.

    Quantum Computers are not super-computers. On a bit-for-bit (or qubit-for-qubit) scale, they're not necessarily faster than regular computers, they just process info differently. Since information is stored in a quantum "superposition" of states, as opposed to a deterministic state like regular computers, the qubits exhibit quantum interference when mixed with other qubits. Typically, your qubit starts in 50% '0' and 50% '1', and thus when you measure it, you get a 50% chance of it being one or the other (and then it assumes that state). But if you don't measure, and push it through quantum circuits allowing them to interact with other qubits, you get the quantum phases to interfere and cancel out. If you are damned smart (as I realized you have to be, to design QC algorithms), you can figure out creative ways to encode your problem into qubits, and use the interference to cancel out the information you don't want, and leave the information you do want.

    For instance, some calculations will start with the 50/50 qubit above, and end with 99% '0' and 1% '1' at the end of the calculation, or vice versa, depending on the answer. Then you've got a 99% chance of getting the right answer. If you run the calculation twice, you have a 99.99% chance of measuring the correct answer. However, the details of these circuits which perform quantum algorithms are extremely non-intuitive to most people, even those who study it. I found it to require an amazing degree of creativity, to figure out how leverage quantum interference constructively.

    But what does this get us? Well it turns out that quantum computers can run anything a classical computer can do, and such algorithms can be written identically if you really wanted to, but doing so gets the same results as the classical computer (i.e. same order of growth). But, the smart people who have been publishing papers about this for the past 20 years have been finding new ways to combine qubits, to take advantage of nature of certain problems (usually deep, pure-math concepts), to achieve better orders of growth than possible on a classical computer. For instance, factoring large numbers is difficult on classical computers, which is why RSA/PGP/GPG/PKI/SSL is secure. It's order of growth is e^( n^(1/3) ). It's not quite exponential, but it's still prohibitive. It turns out that Shor figured out how to get it to n^2 on a quantum computer (which is the same order of growth as decrypting with the private key on a classical computer!). Strangely, trying to guess someone's encryption key, normally O(n) on classical computers (where n is the number of possible keys encryption keys) it's only O(sqrt(n)) on QCs using Grover's algorithm. Weird (but sqrt(n) is still usually too big).

    There's a vast number of other problems for which efficient quantum algorithms have been found. Unfortunately, a lot of these problems aren't particularly useful in real life (besides to the curious pure-mathematician). A lot of them are better, but not phenomenal. Like verifying that two sparse matrices were mulitplied correctly has order of growth n^(7/3) on a classical computer, n^(5/3) on a quantum computer. You can find a pretty extensive list by googling "quantum algorithm zoo." But the reality is that "most" problems we face in computer science do not benefit from quantum computers. In these cases, they are no better than a classical computer. But for problems like integer factorization, bringing the compute requirements down to polynomial time isn't just faster: it makes a problem solvable that wasn't before.

    Unfortunately [for humanity], there is no evidence yet that quantum computers will solve NP-complete problems efficiently. Most likely, they won't. So don't get your hopes up about solving the traveling salesmen problem any time soon. But there is still a lot of cool stuff we can do with them. In fact, the theory is so far ahead of the technology, that we're anxiously waiting for breakthroughs like this, so we can start plugging problems through known algorithms.

    1. Re:Pre-emptive strike against wtf is a QC by msheekhah · · Score: 1

      You can't design quantum algorithms to solve classical computer problems faster?

      --
      Mark Anthony Collins
    2. Re:Pre-emptive strike against wtf is a QC by Tyler+Durden · · Score: 1

      Your explanation was awesome. Thank you.

      --
      Happy people make bad consumers.
    3. Re:Pre-emptive strike against wtf is a QC by na1led · · Score: 1

      What about Quantum Entanglement? Being able to communicate instantaneously across any distance, which would be beneficial to probes exploring deep space.

      --
      -- By all means let's be open-minded, but not so open-minded that our brains drop out.
    4. Re:Pre-emptive strike against wtf is a QC by Anonymous Coward · · Score: 0

      You can design quantum algorithms to solve problems faster. Simply implementing a classical algorithm on a quantum computer will not provide ANY speed improvement (in fact, it will almost certainly run much slower, since classical computers are so fast now). "Classical computer problems" is not a terribly meaningful phrase.

    5. Re:Pre-emptive strike against wtf is a QC by JoshuaZ · · Score: 4, Informative

      Entagnlement doesn't allow you to communicate information. The following analogy may help. Imagine two coins that whenever they are both flipped they end up either both heads or both tails, but you can't control which one comes up. So if you separate the two coins, you can use them to get a shared source of randomness which you can use for some useful things (like cryptography) but you can't use it to communicate.

    6. Re:Pre-emptive strike against wtf is a QC by dAzED1 · · Score: 1

      sortof. If both sides can instantly know a rapidly changing value, that value can be used to both encrypt and compress communication. The fact that it isn't controllable doesn't mean that it can't be used for such things.

    7. Re:Pre-emptive strike against wtf is a QC by FrangoAssado · · Score: 1

      That was a great explanation.

      Just one small nitpick: when you talk about factorization, you use "n" for the number of bits, and when you talk about guessing an encryption key, you use "n" for the number of possible keys, which makes things a little unnecessarily confusing. I'd change the second one to also use number of bits -- so it would be O(2^n) on classical computers and O(2^(n/2)) for quantum computers. This way it's also easier to see that the square root (i.e., the factor of 1/2 in the exponent) doesn't buy a lot.

    8. Re:Pre-emptive strike against wtf is a QC by maxwell+demon · · Score: 1

      "Classical computer problems" is not a terribly meaningful phrase.

      It's a very meaningful phrase. It describes all computing problems where both the input and the output are completely classical.

      --
      The Tao of math: The numbers you can count are not the real numbers.
    9. Re:Pre-emptive strike against wtf is a QC by DMUTPeregrine · · Score: 1

      Easy way to think of entanglement that won't lead to thinking of it as an FTL communication mechanism:
      Imagine a machine (hidden from any observers) that flips a coin, cuts it in half, and puts the halves in two sealed boxes. The halves could be either heads up or tails up, you can't tell until you open a box. Both will be in the same state, no matter how far apart you move the boxes. You can drive all day with a half-coin in a box and it won't change. (Had to work a car in.) Knowing the state of one tells you the state of the other, but changing the state of one does not change the state of the other.
      The (big) error in this explanation is that there's no superposition, so it's really a terrible analogy, but it doesn't lead to the biggest common mistake the normal descriptions give.

      --
      Not a sentence!
    10. Re:Pre-emptive strike against wtf is a QC by FrangoAssado · · Score: 1

      I think this description applies to any "computing problem".

      It certainly applies to any "quantum computing problem" (i.e., any problem solvable by a quantum computer), because any quantum computer can be simulated by a classical computer. That is, any problem solvable by a quantum computer can also be solved by a classical computer.

      The catch is that, as the size of the input grows, it might be the case that the amount of time and/or space needed by the classical computer grows exponentially (that's not proven yet, though -- see here, for example).

  19. Re:Please enlighten me : Quantum computers & M by Altesse · · Score: 1

    Edit : the other solutions are incorrect
    (In the other worlds, I'm better at learning foreign languages).

  20. IBM layoffs by Anonymous Coward · · Score: 1

    This news story appears the day after IBM laid off a number of engineers in STG. (system and technology group, the part of the company that works on operation systems and hardware like Power, blades, Z, etc)

    Not that IBM would be attempting to deflect any negative news stories which might range from the very tight lipped control on number of employees let go, forbidding those employees let go from talking to the press or lose their severance pay, current number of employees in the US, brain drain of engineers leaving cause impacts in product creation.

    Stay classy IBM.

  21. HD Decryption Orders by Anonymous Coward · · Score: 0

    As soon as the 'decryption orders' stop and Truecrypt encrypted volumes are being entered into evidence decrypted, IBM will be on to something.

  22. "...properties in quantum bits or quibits" by SomePoorSchmuck · · Score: 1

    I always thought the contraction was "qubit" for "Quantum Bit".
    Is "quibit" an accepted variant spelling, and, if so, where does the extra letter "i" come from?

    --

    Hollywood, Television, has become the dream machine. We need to take that back; each of us is a Dream Machine
  23. Re:So by Yobgod+Ababua · · Score: 1

    I've always been partial to The Register (www.theregister.co.uk) which is snarky and British (and the home of the BOFH) and to Ars Technica (www.arstechnica.com) which tries to focus on actually writing interesting articles about news rather than just linking to things.

    There is often some overlap between themselves and /. but it's not as bad as you'd expect.

  24. Re:So by Anonymous Coward · · Score: 0

    Except that the Register is even more populist than Slashdot and written by mediocre hacks - Slashdot at least doesn't pretend to be staffed by journalists, merely linking elsewhere. And it's only "home" to the BOFH in the sense that the Aussie sold out to them ("he's a BOFH, what do you expect?").

    Ars technica has the occasional highly knowledgeable contributor but usually gives me the uncomfortable sense of an editorial belief that the more you write, the more insightful and relevant your piece is.

    There are three honest sources of STEM news:
    (1) Peer-reviewed journals;
    (2) progress reports by practitioners;
    (3) Chatty, informal summaries of press releases, word of mouth and items in (1) and (2).

    Items in (3) rquire you to either go to (1) or (2) or examine the subject yourself to obtain an in-depth analysis.

    Outlets which try to position themselves between (2) and (3) are a waste of time, also likely to reinforce any of your existing biases since they're never neutral.

  25. Re:Please enlighten me : Quantum computers & M by JoshuaZ · · Score: 1

    No. Quantum computing works whether or not MWI is correct. And it doesn't have to do with quantum suicide. In an MWI situation, the vast majority of universes will get the same (correct) result. Essentially, the different universes cooperate with each other before the split off. This isn't quite correct (in MWI there are really discrete universes but rather part of a continuum, and there are a lot of other subtleties involved).

  26. BASF by Candyban · · Score: 1

    BASF, we don't make the things you use.
    We make the things you use BETTER.

    That was the commercial I remember for several years.

    I suppose they couldn't live up to this promise any more since they changed it to We don't just make chemicals, we make chemistry

  27. Re:So by Yobgod+Ababua · · Score: 1

    "...also likely to reinforce any of your existing biases since they're never neutral."

    I thought we were talking about science content? Why would biases be relevant?
    Independently reproduceable results rule; soundbites drool.

  28. Re:So by jones_supa · · Score: 1

    Real World Technologies is worth mentioning too. It's a high-quality, rarely updated site involving mostly CPU/GPU/APU type stuff.

  29. how misleading! by Anonymous Coward · · Score: 0

    i hate how there are all these articles about how they finally have these break throughs! there was over a dozen alerts for IBM this morning and this record breaking discovery. DWAVE systems of BURNABY BRITISH COLUMBIA CANADA! has made a functional quantum computer chipset for over a year! They are already building chips at 500+ qubits with there first machine being sold to LOCKHEED MARTIN for $10 MILLION. they are already establishing a quantum computing cloud to allow access to developers and organizations to perform specific calculations. all these computer companies either dont read the news or are just fragrantly disregarding any level of honest disclosure. it's disgusting! its a huge breakthrough AGREED. made by another company!!!! get over it! TRY AND CATCH UP ALL YOU LIKE.. GOOD FOR YOU! BUT DONT TRY AND FOOL PEOPLE INTO THINKING YOU ARE THE PIONEER AND INDUSTRY LEADER WHEN YOU ARE NOT!

    1. Re:how misleading! by Anonymous Coward · · Score: 0

      i hate how there are all these articles about how they finally have these break throughs! there was over a dozen alerts for IBM this morning and this record breaking discovery. DWAVE systems of BURNABY BRITISH COLUMBIA CANADA! has made a functional quantum computer chipset for over a year! They are already building chips at 500+ qubits ...
      GOOD FOR YOU! BUT DONT TRY AND FOOL PEOPLE INTO THINKING YOU ARE THE PIONEER AND INDUSTRY LEADER WHEN YOU ARE NOT!

      When people react in a manner you don't understand you can take one of two approaches.

      1. USE ALL CAPS and call them out on their obvious stupidity.

      2. Invest time and effort to increasing your knowledge of the space to see if maybe just maybe there is something your missing. Look for reasons you may be wrong rather than looking for reasons to reinforce your assumptions.

      Crackpots and idiots always choose 1 without hesitation.

  30. Re:So by Anonymous Coward · · Score: 0

    Just one and he kept shouting things about peanuts.

  31. good explanation by globaljustin · · Score: 1

    "On a bit-for-bit (or qubit-for-qubit) scale, they're not necessarily faster than regular computers, they just process info differently."

    Thank you. I have been trying and failing (in tweets @DrEpperly) to explain the concept you describe very succinctly. I have a telecommunications background so we just think of it as having two channels...sort of like the old 'dual-mode' phones...

    When you get published saying this please send me a link ;)

    --
    Thank you Dave Raggett
  32. today's arXiv on quantum computation by Anonymous Coward · · Score: 0

    Everybody who's is interested in advances of quantum computation should have a look at this publication
    It was uploaded to arXiv today and shows another implementation of Shor's algorithm in a four-qubit system.
    Althought their fidelity is not as high as the one claimed by IBM, I do think that their technology is a little bit more advanced.

  33. Re:Please enlighten me : Quantum computers & M by FrangoAssado · · Score: 1

    That's not how quantum computers work, despite of what you might have read in science popularization articles. Quantum algorithms don't work like classical algorithms work, but "doing all possibilities at once". That wouldn't work because of the contradiction you described -- once you measure the result, all the other "possibilities" go away.

    Quantum algorithms work by not only solving the problem, but also shifting the probabilities of the qubits in such a way that, when you measure it, you get a very high probability of measuring the "right" answer. For example: in the quantum part of Shor's algorithm, you start with a lot of qubits that have 50% probability of being 0 and 50% of being 1, and after doing the computation, you end up with the qubits with a very high probability of having in the "correct" value. This works because the probability of being right can be as high as you want -- you can set things up so that the probability of being wrong is the same as that of an asteroid hitting the computer while it's calculating, for example.

    That's why it's very hard to come up with quantum algorithms. For a lot of problems, it's doubtful that it's even possible to have a quantum algorithm that's much better than classical algorithms. For example, most quantum computer scientists think that quantum computers will never be able to solve NP-complete problems much faster than classical computers.

  34. Quantum Computing the new fusion by jweller13 · · Score: 1

    Promises of quantum computers seem to be suffering from the fusion syndrome. Fusion has been "only 20 years away" for the last 40 years. :P

  35. Re:So by forkfail · · Score: 1

    Maybe it's more a reflection of the changes in the tech industry than in the site.

    --
    Check your premises.
  36. Re:So by maxwell+demon · · Score: 1

    How many African Americans helped to invent this?

    More than Anonymous Cowards.

    --
    The Tao of math: The numbers you can count are not the real numbers.
  37. encryption key layer by phorm · · Score: 1

    You have 2048 randomly entangled bits.
    Somebody on the other side of the world has the matching pair of 2048 randomly entangled bits.

    Not useful for communication per-se if you can't influence them, but if you could *READ* them without influencing them, they'd be darn spiffy for an encryption key or seed shared between two parties.

    Simple XOR encryption would be awesome so long as you both have synchronized reading of the encrypted bits. Take message, XOR it against the encryption key, send to recipient, recipient XOR's it against same encryption key and gets the encryption message.
    Next chunk of data, you both have a new key courtesy of your shared entangled bits.

    The issue again being that you'd need to have:
    a) Bits that change state randomly on an interval that fits your data throughput
    b) a very fine synchronization between how often the bits change state and when you send/receive data, so that both parties are using the same key/mask.

    1. Re:encryption key layer by FrangoAssado · · Score: 1

      [...] but if you could *READ* them without influencing them [...]

      That would be great, but you can't. Once you read them, the entanglement is broken. As mathimus1863 wrote in the original message in this thread,

      Typically, your qubit starts in 50% '0' and 50% '1', and thus when you measure it, you get a 50% chance of it being one or the other (and then it assumes that state). [my emphasis]

      That means that once you measure a qubit, its state becomes exactly what you measured (this is commonly known as "wave function collapse"), and so it's not entangled anymore.

  38. Crazy talk by Anonymous Coward · · Score: 0

    I simply do not accept "god" is prepared to let us little pissants scale qbits to our hearts content at a price we are able to afford. We have no evidence to support the assumption coherence reinforcement schemes can scale.

    I'm sure with enough R&D these systems will become cheaper and prove very useful in solving a wide range of hard problems.

    The extraordinary codebreaking claims and all related rumblings about solving problems practically impossible for a normal computer to solve are right up there with bigfoot, aliens, zedpm's, flux capacitors and sadly hoverboards.

    I'll believe it when I see it.

  39. Re:Please enlighten me : Quantum computers & M by Anonymous Coward · · Score: 0

    mostly, MWI is bullshit.