Slashdot Mirror


Under the Hood of Quantum Computing

nanotrends writes "Gordie Rose, the CTO of Dwave Systems, the venture funded company that plans to offer paid use of a superconducting quantum computer starting in 2007, reveals secrets of his quantum computer construction. It is based on nobium superconducting 'circuits of atoms' and is not RSFQ. (Rapid Single Flux quantum)."

156 comments

  1. Advantages? by Zouden · · Score: 4, Interesting

    I read the article, but it didn't make it very clear - what will be the advantages of paid use of their quantum computer? Unless it's going to be faster than other supercomputers, I can't see the point. Is there some other advantage I'm not aware of?

    I'd be very suprised if their quantum computer will be faster than conventional computers by next year. 20 years away, maybe.

    --
    "A week in the lab saves an hour in the library"
    1. Re:Advantages? by QuantumG · · Score: 4, Interesting

      I don't think anyone can assess the capabilities of his systems from that article. I also don't think that was unintentional.

      --
      How we know is more important than what we know.
    2. Re:Advantages? by Mathinker · · Score: 5, Insightful

      Uhm, from the article, nobody can even assess whether it really is a quantum computer.

    3. Re:Advantages? by Kjella · · Score: 5, Informative

      I read the article, but it didn't make it very clear - what will be the advantages of paid use of their quantum computer? Unless it's going to be faster than other supercomputers, I can't see the point.

      Well, it's a quantum computer. Given the problem it might be like trying to make your CPU compete against a GeForce or ATI. If you try to do it all with CPU emulation, there's not much doubt who'll win. That said, I got the impression that current quantum computers have a so limited number of qbits (the computing power pretty much grows to 2^n with n bits), that it's faster and cheaper to just cycle through all 2^n possibilties one at a time. Currently the largest I've seen is a 12 qbit computer. Now 2^12 = 4096 states at once is a nice curiosity but nothing that makes my encryption keys worry. Basicly it's man vs Deep Blue at computer again - the quantum computer is great at testing many solutions at once but the sheer computing power of traditional computers takes home the victory. Now, if they can get hundreds of qbits together things will change massively. But the difficulty in keeping all those in a cohesive quantum state also raise drastically, so I think we're far off from a usable quantum computer.

      --
      Live today, because you never know what tomorrow brings
    4. Re:Advantages? by RKBA · · Score: 3, Interesting

      "what will be the advantages of paid use of their quantum computer?"

      I'm sure the NSA and other government agencies have a passing interest in code breaking, which among other things means being able to factor huge numbers quickly. A quantum computer would (if it contained sufficient logic cells) be able to try all possible factors of a number at the same time, and would thus be able to factor any number almost instantaneously. It would mean the death of most common types of encryption that depend upon the difficulty of factoring as a means of insuring the privacy of data. After all, the government probably has petabytes of encrypted data from their nationwide wiretapping of telephone and Internet communications they would love to be able to decrypt quickly.

    5. Re:Advantages? by RKBA · · Score: 4, Informative
      "Now, if they can get hundreds of qbits together things will change massively."

      I think the point of the article is that D-Wave Corp claims to be able to create qbits from "large" objects (ie; large enough to be fabricated using standard IC fabrication techniques), but with niobium rather than silicon. This enables them to create a quantum computer without all the hassle of having to manipulate individual atoms as the present research lab quantum computers do. From the article:

      Superconductors are the only type of material that we know of where big lithographically defined devices (like really big. Like centimeter on a side big.) can be built that behave just like they were atomic-sized.

      Since supercooling is required, it's highly unlikely that you or I will be able to afford one of these things any time soon (assuming it's not all marketing hype in the first place), but you can be assured the NSA and other government "intelligence" agencies will be able to afford as many as they want because of all the tribute they demand from us on pain of imprisonment, in the form of exorbitant taxation.
    6. Re:Advantages? by smallpaul · · Score: 3, Informative

      I read the article, but it didn't make it very clear - what will be the advantages of paid use of their quantum computer? Unless it's going to be faster than other supercomputers, I can't see the point. Is there some other advantage I'm not aware of?

      Yes, of course the goal is to be substantially faster than other supercomputers: for certain classes of problems. These are outlined on the company's website ( http://www.dwavesys.com/optimization.php ) and ( http://www.dwavesys.com/quantumcomputing.php ). But if you want a "Neutral Point of View" , I'll quote wikipedia:

      It is widely believed that if large-scale quantum computers can be built, they will be able to solve certain problems faster than any classical computer...
      Integer factorization is believed to be computationally infeasible with an ordinary computer for large numbers that are the product of two prime numbers of roughly equal size (e.g., products of two 300-digit primes). By comparison, a quantum computer could solve this problem relatively easily. If a number has n bits (is n digits long when written in the binary numeral system), then a quantum computer with just over 2n qubits can use Shor's algorithm to find its factors. It can also solve a related problem called the discrete logarithm problem. This ability would allow a quantum computer to "break" many of the cryptographic systems in use today, in the sense that there would be a relatively fast (polynomial time in n) algorithm for solving the problem....
      This dramatic advantage of quantum computers is currently known to exist for only those three problems: factoring, discrete logarithm, and quantum physics simulations. However, there is no proof that the advantage is real: an equally fast classical algorithm may still be discovered (though some consider this unlikely). There is one other problem where quantum computers have a smaller, though significant (quadratic) advantage. It is quantum database search, and can be solved by Grover's algorithm. In this case the advantage is provable. This establishes beyond doubt that (ideal) quantum computers are superior to classical computers.

      From D-Wave's website:

      For several decades, computer scientists have been trying to classify all of the problems we know of. Whenever a new problem comes up, it is placed in one of the existing categories of problems. These categories describe how difficult the problems within it are, and why.

      One of the most interesting categories contains problems that are called NP-complete. These all have the feature that in order to solve the problem all possible solutions must be tried, and the number of possible solutions grows exponentially with the problem size.

      An example is the Travelling Salesman Problem, although there are literally thousands of them. This category is a particularly interesting target from a commercial perspective because most real-life business problems are in it.

      ...

      Quantum computers can be used to get approximate solutions to large NP-complete optimization problems much more quickly than the best known methods running on any supercomputer.

    7. Re:Advantages? by Anonymous Coward · · Score: 1, Insightful

      i think you need to relook at your understanding of computers.

      Its true, conventional boolean logic computers grow 2^n. But thats because its "bit" is a boolean value, it can only have 2 states, thats where the "2" comes from. A quantom computer would be x^n where x is the number of states a bit can be in, while n is the number of bytes. The articel dosent give any information besides a link to the paper (im to busy), the "12" they spoke of could mean as you took it, to be the number of bits, but that is unimpressive, even current computing technology could have bytes of 12 bits, its easy (altho powers of 2 are better to work with, because of the boolean thing again, 8 bits a byte just happened to work out well). But, since its a quantom computer, i would think it refers to the number of states, which is a lot more then 2, just imagine, 12^8 (8 bit bytes, why not?), take that 128bit computing!

    8. Re:Advantages? by lgw · · Score: 5, Informative

      As far as I know, only RSA-style cryptograophy is affected by quantum computing. There are other ways to do public key encryption, such as elliptical curve cryptography that should be unaffected, as they depend on a different class of problem being hard, and of course quantum computing won't help with symmetric key crypto at all.

      The NSA has been advising the security community against using RSA-style encryption for some time now - it's not like they're trying to keep the weakness a secret for some nefarious reason.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    9. Re:Advantages? by Hobadee · · Score: 2, Funny

      Advantages? ADVANTAGES!? Dude, think, your framerate for Counter-Strike will RULE!

      -Eric Kincl

      --
      ...Had this been an actual emergency, we would have fled in terror, and you would not have been informed.
    10. Re:Advantages? by mickwd · · Score: 4, Funny

      Or, following the principles of Heisenburger's Uncertain Cat, we can determine if it really is a live quantum computer, but we can't know where it is.

    11. Re:Advantages? by RKBA · · Score: 2, Interesting

      I don't claim to be a mathematician, but it's pretty easy to show that factoring is a boolean satisfiability (SAT) problem and is generally believed to be at least NP-Hard, if not NP-complete as SAT is. Consequently, if factoring could be "solved" (ie; performed "easily" by use of quantum computing or other means) then any other NP problem could be cast in terms of a SAT problem for easy solution. That would mean P=NP, would it not?

    12. Re:Advantages? by ZombieWomble · · Score: 4, Informative

      I do believe you're mistaken. Quantum bits are exactly like regular bits in their possible observable states - that is, they are either "on" or "off" when observed. The interesting part of quantum computing comes from the fact that, when they're not being observed, they exist in a superposition of both "on" and "off" states. Now, if you put 8 of these bits together, you have a 'qbyte' which, while when it's observed it can only represent the same range as a regular byte, can be used in calculations representing every single possible permutation of the data at once - i.e. every number from 0 through 255. Each bit you add doubles the number of states you can simultaneously test using this superposition property - this is what the GP meant when he said that quantum computing scales as 2^n.

    13. Re:Advantages? by Anonymous Coward · · Score: 1, Interesting

      > Quantum computers can be used to get approximate solutions to large NP-complete optimization problems much more quickly than the best known methods running on any supercomputer.

      Ahh. Let's break it down, shall we?
      NP-complete are decision problems (yes or no), not optimization
      *approximate* solutions for NPC - we know how to do those in polynomial time, you don't exactly need a quantum computer there; it's the exact solutions that are hard
      approximate solutions for *NPC* - they do however not transform very well between problems so each problem would need a different method (the exact solutions can be transformed)

    14. Re:Advantages? by EJB · · Score: 3, Interesting

      Not to mention Darwin's apple or Rembrandt's Mona Lisa. ;-)

      (Try "Schrodinger's cat" or the "Heisenberg uncertainty principle")

    15. Re:Advantages? by ZombieWomble · · Score: 3, Informative
      That sounds rather stupid. Why only test for "on" or "off" when you can test for any of the states?

      Two points: what other states, and how do you propose we measure them? Quantum bits will typically have only the 1/on and 0/off states, by design - partly because it meshes well with our classical computing methods, and partly because most make use of concepts like spin which are naturally in up/down or the like. When isolated, they evolve into a state expressed by a|0> + b|1>, where a and b are the probability that you will observe the 0 state or the 1 state, respectively. This superposition state is impossible to observe, since the wavefunction collapses into one or the other on observation, so we can only observe either the 1 or the 0. More generally, you have a state for the entire register which is the superposition of every possible 'classical' state, with individual probabilities of being observed when you check the register of a, b, c and so forth.

      Also, your post makes little since, everything is observed, which is why it exists, just because it isent observed by humans dosent mean its not observed,

      This is very true, in general, and is the very reason why quantum computing is hard. The qubits have to be completely isolated from everything except the read/write mechanism, so that these particles will only be observed by humans, and nothing else, otherwise many of the requirements to make a quantum computer effective cannot be reasonably achieved.

    16. Re:Advantages? by PatriceVignon · · Score: 4, Insightful
      One of the most interesting categories contains problems that are called NP-complete. These all have the feature that in order to solve the problem all possible solutions must be tried, and the number of possible solutions grows exponentially with the problem size. An example is the Travelling Salesman Problem, although there are literally thousands of them. This category is a particularly interesting target from a commercial perspective because most real-life business problems are in it. ... Quantum computers can be used to get approximate solutions to large NP-complete optimization problems much more quickly than the best known methods running on any supercomputer.
      Sorry, but that is simply not true. If you have a classical NP complete problem (e.g. Travelling Salesman), you can solve it by trying out exponentially many steps, 2^n, and most people believe that you cannot find faster (classical) algorithms. With a quantum you can improve this to 2^(n/2) by the so-called Grover search algorithm. This is not nearly enough to make these problems tractable in practice. And to make things worse, this "speed-up" will most likely be eaten up by the necessary error correction.
      Lance Fortnow posted a very nice summary of this on his blog:
      But I'm not a physicist or an engineer and suppose we can overcome these obstacles and actually build a working machine. Then I can imagine the following conversation in 2025:
      Quantum People: We now have a working quantum computer.
      Public: Yes after 30 years and 50 billion dollars in total funding. What can it do?
      Q: It can simulate quantum systems.
      P: I'm happy for you. What can it do for the rest of us?
      Q: It can factor numbers quickly.
      P: Yes, I know. We've had to change all of our security protocols because of your machine. Does factoring have any purpose other than to break codes?
      Q: Not really. But we can use Grover's algorithm for general search problems.
      P: That sounds great! So we can really solve traveling salesperson and scheduling problems much faster than before?
      Q: Not exactly. The quadratic speed-up we get from Grover's algorithm isn't enough the offset the slow-down by using a quantum computer combined with error correction. But we can solve Pell's equation, approximate the Jones polynomial and a few other things very quickly.
      P: Are those algorithms particularly useful?
      Q: No.
      P: They why did you build a quantum computer?
      Q: Because we could.
    17. Re:Advantages? by Anonymous Coward · · Score: 1, Interesting

      Factoring may a SAT problem, but that doesn't mean SAT is always a factoring problem. All that says is that a SAT solver could solve factorization.
      Prime factorization is in NP, so if it is proven NP-Hard, it must be NP-Complete.

    18. Re:Advantages? by citanon · · Score: 1

      Their computer is a generalized effort to simulate the running of a subset of computer algorithms with the behavior of a bunch of electrons tunneling around in a series of superconducting wires.

      The idea, I guess, is that you take a NP-hard problem such as the traveling salesmen, and encode it in the initial conditions of their circuit, which is initially in a non-equilibrium state. Then you allow the circuit to evolve and reach equilibrium while respecting certain boundary conditions devised according to the problem. The equilibrium conditions of the circuit correspond to the solution to the problem. They claim to have software that allow you to setup the system in a general and high level way.

      The basic concept is similar to the way Lynn Adelman solved the traveling salesman problem with DNA. It's not a quantum computer in the strict sense that it could do universal computing. However, for a number of problems, it could do very well.

      It's a pretty interest system. I'm intrigued about its potential applications to quantum chemistry.

    19. Re:Advantages? by Kagura · · Score: 1

      Very clever, I wish I had mod points :)

    20. Re:Advantages? by mickwd · · Score: 1, Funny

      I guess that's what I get for trying to tell a joke on a US Web Show without a laughter track in the background.

    21. Re:Advantages? by QuantumFTL · · Score: 1
      An example is the Travelling Salesman Problem, although there are literally thousands of them. This category is a particularly interesting target from a commercial perspective because most real-life business problems are in it. ... Quantum computers can be used to get approximate solutions to large NP-complete optimization problems much more quickly than the best known methods running on any supercomputer.
      If anyone is interested in how quantum computers can (at least may be able to) appoximately solve TSP efficiently, check out thisinteresting article submitted to Physical Review Letters. I would caution that this does not seem to be mentioned on the wikipedia article, and may be rather contraversial.
    22. Re:Advantages? by maxwell+demon · · Score: 3, Insightful

      Of course being able to efficiently simulate quantum systems would do a lot for many people. Let's start with quantum chemistry. When you deal with large molecules (as f.ex. in pharmacy), you are basically solving a large quantum system. The basic equations are well known, but the size of the problem is what makes it difficult. A quantum computer could resolve this problem. Or in other words, quantum computers might cause more health for the people.

      Or think about material sciences. Again, the basic (quantum) equations are well known, but are too large to calculate directly. Again, a quantum computer might be very helpful. It's hard to say what advantages the new materials might bring us (maybe room-temperature superconductors?), but it's allmost certain that there will be some advantage.

      --
      The Tao of math: The numbers you can count are not the real numbers.
    23. Re:Advantages? by sparklehackery · · Score: 1
      I can't see the point. Is there some other advantage I'm not aware of?
      Well, actually, it's all just spin... :P
    24. Re:Advantages? by syousef · · Score: 1

      They're trying to create a quantum tunnel into your pocket.

      --
      These posts express my own personal views, not those of my employer
    25. Re:Advantages? by StikyPad · · Score: 2, Interesting

      Except that taxation is an illusion, since the government creates the money. What they're really doing is pretending to give it to you. The most obvious version of this is that government workers pay taxes, but we're all government workers indirectly, since we work for the government's money. If taxation did not exist, salaries would just be lower. You wouldn't make any more money, and even if you did, everyone else would too, which means inflation would increase to offset the extra cash. Remember, inflation is set by how much disposible income people have on average. The prices of goods and services is, and always will be, directly proportional (or at least closely linked) to how much the lowest paid workers make. If they make "more," the price of goods and services must increase -- both because you're paying the people who make them more, and because prices are proportional to average income. When income goes up, prices always follow. The only way the cycle could end is if all matter and energy were reduced to 0 value, which is highly unlikely.

    26. Re:Advantages? by HaMMeReD3 · · Score: 1

      Well, it being a quantum computer should give it the benefits of being quantum, you know, the ability to solve N-Complete problems and such through probabilities and such. Wasn't quantum computing theoretically supposed to kill all non-quantum encryption techniques while creating unbreakable ones?

      I guess we'll have to wait and see, it's not about how fast it is, but its capabilities as a computer, do quantum computers still count as turing machines or would they be in a classification of their own?

    27. Re:Advantages? by Mac+Degger · · Score: 1

      I agree...but did you see the article about the guys at Delft uni? They've built and operated a silicon circuit which can 'trap' a qubit. Dunno about exact decoherence rates (I'll ask), but the circuit works, and becasue it is pure silicon, it can be massproduced NOW. And no supercooling neccessary!

      --
      -- Waht? Tehr's a preveiw buottn?
    28. Re:Advantages? by drerwk · · Score: 1

      Actually pleasently clever! Wish I had mod as well.

    29. Re:Advantages? by Anonymous Coward · · Score: 0
      what will be the advantages of paid use of their quantum computer?

      Profit!!

    30. Re:Advantages? by Anonymous Coward · · Score: 0

      You have a really poor understanding of how monetary policy in an economy like the USA's works. The "government" is not one large, fluid entity. The Fed "creates" the money. They, however, do not collect taxes. In the US (and in the EU as well) the Fed (in the EU its European equivalent) are autonomous and do not create money at the whim of the other branches and departments of the US government. They are charged simply with maintaining price levels and growing the money supply at a rate slow enough to prevent deflation and inflation while still stimulating economic growth. Depending on whether they take an activist or non-activist stance on monetary policy, they may also attempt countercyclic strategies to "smooth" the business cycle, although nowadays most economists agree that the various lags associated with such policy mean that more harm is done than good in practice.

      In the US, the "government" (minus the Fed) must fund its projects through taxes and debt -- taxes obviously you understand. Debt refers to the selling of T-bills and similar by the US Dept of Treasury. The US government cannot, unlike some banana republics, simply print money when they need more, because every Econ 101 student knows what effect that would have on the US economy (read: massive inflation.)

      This is why we talk about "deficits" and "surpluses" -- if the government runs a deficit, they are spending more than their income (from taxes) and must obtain those extra funds through debt -- ie, they borrow from private investors and other countries by offering T-bills and other such instruments on the open market. Conversely, if they have a surplus, they have spent less than their income (from taxes.)

      Money is in fact no different from any other commodity, including gold and silver -- its value comes from the laws of supply and demand. The goverment may indeed control the supply, but because they do it in a predictable and open way, the dollar retains its value. If they started printing tons of it, it would quickly depreciate, due to the sudden increase in supply. There's nothing complex about this.

      The fact that the money supply is a policy variable is one of the reasons that economic growth is so painless. When the dollar was based on the gold standard, the money supply was tied to the supply of gold, which could not be controlled by the government. But the growth of the economy requires steady growth in the money supply -- currently about 3% year to prevent deflation -- and there's no way to have this kind of steady growth with a gold standard.

      The incredible inflation experienced in the 1970s was not a result of the abandonment of the gold standard in the US, but rather a result of a misunderstanding of the economic effects of inflation. Specifically, economists recognized that an increase in the supply of money triggered an increase in aggregate demand, and decided that since prices were arbitrary anyway, inflation was a small price to pay for increased economic output and employment. Unfortunately they neglected the incredibly important difference between anticipated and unanticipated economic effects... when inflation is anticipated, it is built into contracts, wages, interest rates, etc, and the result is no net increase in aggregate demand. When this was recognized the expansionary monetary policy they had adopted was quickly abandoned, and since the 1980s our monetary policy has been much saner.

    31. Re:Advantages? by Digi421 · · Score: 2, Funny

      Or if you would know where it is, you'd never be able to figure out how fast it really is.

      --
      Hippopotomonstrosesquippedaliophobia: Fear of long words
    32. Re:Advantages? by volkris · · Score: 1

      That's a pretty flawed worldview.

      1) The US government doesn't create money; it creates US dollars, which are not equivalent to money.

      2) Salaries aren't set by taxation. Salaries are set by the amount of wealth one generates, which is completely independent of operations of the government. Without taxation salaries would rise since there would be larger money supply available to create more wealth.

      3) Inflation is mostly set by the money supply in general, not disposable income. Business to business exchanges account for a significant part of inflation.

      4) Prices aren't proportional to average income. There is a great deal more to the system than that.

    33. Re:Advantages? by Anonymous Coward · · Score: 0

      No, ECC is vulnerable to quantum computer algorithms. About the only thing that might not be vulnerable is lattice-based crypto, but I think that is vulnerable, too.

    34. Re:Advantages? by volkris · · Score: 2, Informative

      That's not really how quantum mechanics works.

      Everything is not observed. It cannot be observed. Mathematically there are certain things that cannot be observed, but that still exist, and can still be interacted with.

      The mathematics of quantum mechanics suggests that certain things happen so long as there's no attempt to observe them. There are all sorts of crazy experiments that verify this result, but in summary it's as you read: under quantum mechanics there are things that are certain ways only so long as you don't look.

      Before you think this is all hogwash, quantum mechanics is actually one of most successful theories that physics has ever proposed.

    35. Re:Advantages? by biffta · · Score: 1

      He also spelt 'disposable' wrong.

    36. Re:Advantages? by Vadim+Makarov · · Score: 1

      Even if it has no practical use, there will be researchers from other places who rent it, to do proof-of-the-principle experiments and such stuff without building their own devices.

      --
      17779 eligible voters in a district, 17779 'vote' as one. This is Russia.
    37. Re:Advantages? by Luyseyal · · Score: 1

      Without taxation salaries would rise since there would be larger money supply available to create more wealth.

      Sure sounds good on paper, doesn't it? The Libertarians would have you believe that the government is responsible for corporate domination, yet, Libertarian policies are, in effect, an (accidental?) attempt to return us to the Age of Aristocracy. Aristocracy may make the country look wealthy, but there will be plenty of emptier pockets to go about.

      IMHO,
      -l

      --
      Help cure AIDS, cancer, and more. Donate your unused computer time to worldcommunitygrid.org. Join Team Slashdot!
    38. Re:Advantages? by fatphil · · Score: 1

      You can transform a factoring problem into a SAT problem. That doesn't mean that factoring has the same complexity class as SAT, only that it's no more than that of SAT. Polynomially transforming arbitrary SAT into FACTORS would be a different matter entirely.

      I don't believe anyone would put any money on FACTORS being NP-complete.

      It's an problem for which there are well-known sub-exponential algorithms, for example, whereas there are many NP problems for which there are no sub-exponential solutions. Of all NP problems, perhaps FACTORS is one of the "easiest", in fact.

      FatPhil

      --
      Also FatPhil on SoylentNews, id 863
    39. Re:Advantages? by Delphiki · · Score: 1

      The best part of your post was the part where you provided all that evidence to back up your claims.

      --

      Feel free to mod me "-1 - Angry Jerk".

    40. Re:Advantages? by Luyseyal · · Score: 2, Interesting

      1) No gov't oversight
      +
      2) Dismantling of public-funded education
      =
      Aristocracy within 2 or 3 generations because the concentration of wealth at the top will far exceed the paltry pittance at the bottom. People complain about wealth at the top today -- wait til the Gilded Age of Libertarianism takes over.

      Did you know Libertarian arguments favor child labor?

      1) It's the parent's right to force a child to work. This has been the case for pretty much ever. Parents force their kids to do chores. Parents regularly employ their children in TV and movies. It's a basic tenet of every culture and society that children do work for their parents.

      2) Gov't should not deny parental rights to child earnings by telling them their kids have to go to school (assuming we have any since public education is Evil[tm]).

      3) The poor will force their children to contribute to household income using basic labor rather than paying for an education and deferring earnings. Obviously, an uneducated child's overall wealth potential decreases dramatically.

      4) So, the poor get poorer (and more ignorant) and the rich get richer.

      5) The rich, knowing that strict Libertarianism does not favor them, will do what they have always done: change the laws to favor themselves.

      Ergo, over time, a Libertarian system favors Aristocracy.
      -l

      --
      Help cure AIDS, cancer, and more. Donate your unused computer time to worldcommunitygrid.org. Join Team Slashdot!
    41. Re:Advantages? by Anonymous Coward · · Score: 0

      It's not N/2 it's N^0.5

    42. Re:Advantages? by hswerdfe · · Score: 1

      Not that I disagree or anything, but I think your are confusing
      "Aristocracy" : rule by the best
      with
      "Plutocracy" : rule by the wealthy
      And many would say that many of the western so called democracies are already Plutocracies.
      and not just moving that way.

      --
      --meh--
    43. Re:Advantages? by Luyseyal · · Score: 1

      I'm talking about a Plutocracy becoming a de facto Aristocracy (rule by hereditary nobles. Dictionary.com definition 1.).
      -l

      --
      Help cure AIDS, cancer, and more. Donate your unused computer time to worldcommunitygrid.org. Join Team Slashdot!
    44. Re:Advantages? by dabacon · · Score: 1

      You are mistaken. Elliptical curve cryptography is broken by quantum computers. And yes, I am a quantum physicist.

  2. Bah, I can beat that by Anonymous Coward · · Score: 0

    Any investors interested in my zero-point energy project? Come and bring all your capital, buwahahaha.

  3. sorry by kickedfortrolling · · Score: 0, Offtopic

    Yes.. but will it run linux?

    --
    --AlexC
    Just because I dont agree with climate change doesnt make me a troll
  4. Looking for VC funding myself by Anonymous Coward · · Score: 0

    I plan to build a quantum computer in my mind.

    1. Re:Looking for VC funding myself by biz0r · · Score: 1

      Funny you say that, some people think that is already the case. Who'da thunk it...

      --
      /* sig */
  5. Looks great but by BeoCluster · · Score: 0, Redundant

    Can I make a Beowulf Cluster of those Quantum computers ?

  6. Umm yeah right. by Millyways · · Score: 0, Redundant

    What a load of rubbish. Quantum computinf is nowhere near the level where it is useful for anything, let alone for building a supercomputer out of it.

    1. Re:Umm yeah right. by gweihir · · Score: 1

      What a load of rubbish. Quantum computinf is nowhere near the level where it is useful for anything, let alone for building a supercomputer out of it.

      While I completely agree, it seems enough to get funding. A sad state of affairs, indeed.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
    2. Re:Umm yeah right. by Anonymous Coward · · Score: 3, Insightful

      What would be the point of funding something already useful? Things are funded on the basis of their potential, not on what they can do now.

    3. Re:Umm yeah right. by gweihir · · Score: 1

      What would be the point of funding something already useful? Things are funded on the basis of their potential, not on what they can do now.

      True. But this has zero potential. So it should not be funded.

      --
      Most ACs are not even worth the keystrokes to insult them. Be generically insulted by this and ignored otherwise.
  7. RTFA, WTF? by ricky-road-flats · · Score: 1

    I just read the FA, and it makes only a token mention of quantum computing at the end. It seems to be a (very simple) discussion of using a superconductor to make faster transistors.... What have I missed here?

    1. Re:RTFA, WTF? by kfg · · Score: 4, Informative

      ... What have I missed here?

      For starters; a link to the company's website instead of somebody's "See Spot run" blog post:

      http://www.dwavesys.com/quantumcomputing.php

      KFG

    2. Re:RTFA, WTF? by infidel13 · · Score: 1
      Superconductors are the only type of material that we know of where big lithographically defined devices (like really big. Like centimeter on a side big.) can be built that behave just like they were atomic-sized. The reason for this behavior is highly technical - is has to do with the types of particles in the material. In a superconductor all of the "particles" that carry charge around can exist in the exact same state, so when you look at a whole lot of these particles (many trillions) it can be just like looking at only one (which is "very quantum mechanical").
      From this paragraph, it almost looks like the processor uses Bose-Einstein condensates - hence the reference at the end to "like looking at only one," since BECs (which, I might add, have to be cooled to cryogenic temperatures) essentially behave like giant atoms. Here's a link: Bose Einstein Condensates.
      --
      quia potentia mens mentis
  8. "Quantum" computer is misleading by kestasjk · · Score: 4, Insightful
    What D-Wave has done is begun with the standard approaches to building metal-based processors and modified them in such a way that these processors use quantum mechanics in order to accelerate computation.

    Wow, they use quantum mechanics? Every chemical reaction in our universe uses quantum mechanics; they couldn't be more vague if they tried. They're clearly trying to capitalize on the 'quantum computer' buzz.
    --
    // MD_Update(&m,buf,j);
    1. Re:"Quantum" computer is misleading by slashdotmsiriv · · Score: 5, Informative

      From dwave's site: "There are many potential ways to build quantum computers (QCs). Of these, four types have emerged as being most likely to succeed. These are based on (A) assemblies of individual atoms trapped by lasers; (B) optical circuits, for example using photonic crystals; (C) semiconductor-based designs, usually including atomic-scale control of dopant atom distribution or quantum dots; and (D) superconducting electronics. D-Wave focuses exclusively on superconducting electronics. This is because superconductors have the unique property that very large structures can be built out of them that behave according to the rules of quantum mechanics. Because of this, design of superconducting QCs does not require new technology development. This is in contrast to the other three types of QCs, in which information is stored using atoms or individual photons (particles of light), and controlling and manipulating this information requires technologies that do not yet exist. The two superconductors used to build QCs are aluminum and niobium. At room temperature these materials are metals. When they are cooled down close to absolute zero, the electrons in the metals pair to form particles called Cooper pairs. These particles carry charge in the superconductor. Cooper pairs are very different from electrons. One key difference is that Cooper pairs are what physicists call bosons, while electrons are fermions. Bosons are allowed to occupy the same quantum state, while fermions are not. In a superconductor, all the Cooper pairs can (and do) exist in exactly the same state. This means that all of the charge carriers in the superconductor are fundamentally linked. They directly inherit their behavior from the scale of a single Cooper pair. One way to think of this is that a chunk of superconductor amplifies the quantum effects that exist at the level of extremely tiny individual particles up to the scale of the whole chunk, even if the chunk is very large. This amplification of quantum effects is responsible for the well-known properties of superconductors, such as zero resistance to current flow and exclusion of magnetic field. It is also extremely useful for building components of QCs. Superconductors naturally shield themselves from external noise, creating a safe haven for quantum effects. This ability to build large things that behave like small things overcomes many practical problems in building real QCs."

    2. Re:"Quantum" computer is misleading by Sinbios · · Score: 1

      Actually, I think the point is they ARE trying to be as vague as they can :P

      --
      Anyone can "stand up for what they believe", but it takes a very brave individual to change what they believe. - Loundry
    3. Re:"Quantum" computer is misleading by imaginieus · · Score: 1
      Wow, they use quantum mechanics? Every chemical reaction in our universe uses quantum mechanics; they couldn't be more vague if they tried. They're clearly trying to capitalize on the 'quantum computer' buzz.
      While every chemical reaction in the universe uses quantum mechanics, every computer does not. The use of quantum mechanics in computing is actually as revolutionary as they make it seem. If d-wave succeeds in building a quantum computer, it will destroy the laws of computability. Because of superposition, it will be able to factorize large numbers with linear scaling, meaning that even a slow quantum computer could factorize the product of two 300 digit prime numbers in less time than a supercomputer.
    4. Re:"Quantum" computer is misleading by caffeinated_bunsen · · Score: 1

      Let's run Bunsen's Bullshit-O-Meter(tm) over this real quick:
      There are many potential ways to build quantum computers (QCs). Of these, four types have emerged as being most likely to succeed. (A) ... (B) ... (C) ... (D) ...
      [..........]

      This is because superconductors have the unique property that very large structures can be built out of them that behave according to the rules of quantum mechanics.
      [*.........]

      Because of this, design of superconducting QCs does not require new technology development.
      [**********] zzzZZZTPOP!
      Damn, another fuse gone. I've gotta add better overload protection to this thing. Anyway, try telling the couple dozen research groups working on superconducting quantum computing and the millions of dollars of funding being thrown at them that the problem don't require any new technology. Once they stop laughing (which may take a while, be patient), they'll go on for a few hours about all the problems that have yet to be overcome, like getting two qubits to interact strongly enough with each other to allow logic operations, but weakly enough with the environment to make the data last long enough to be useful. Kind of a fundamental problem, that. This looks to be yet another bunch of con artists who found yet another way to make good on that old adage about fools and their money.

      In other words, expect this thing's principal use to be running the Phantom Game Service.

      --

      Bugrit! Millenium hand and shrimp!
    5. Re:"Quantum" computer is misleading by Anonymous Coward · · Score: 0
      If d-wave succeeds in building a quantum computer, it will destroy the laws of computability.
      I find that quite doubtful. In the 15-some years quantum computing has been researched, we have come up with a mind-boggling TWO algorithms that make it even the slightest bit interesting. The effects of quantum computing have absolutely ZERO impact on the fundamentals of computational theory; it's only in the mushy bits of probabilistic complexity classes in the polynomial time hierarchy that anything's happened so far.
      Because of superposition, it will be able to factorize large numbers with linear scaling
      That's quite a bold assertion. Some very very smart people have looked at this problem, and the best they've come up with so far is cubic scaling. You should probably publish the research you've done into developing a linear-time algorithm and claim your millions of dollars now.
      meaning that even a slow quantum computer could factorize the product of two 300 digit prime numbers in less time than a supercomputer.
      What are you basing this arbritrary performance on? No one has any idea what a hypothetical "slow" quantum computer might do performance-wise.
  9. Woo Woo science by Valacosa · · Score: 5, Insightful

    A functional quantum computer? Really?

    I used to be a undergrad lab assistant. I never worked in quantum computing, but our neighbours were some of these guys. I picked up a few things, one of those things being that quantum computing is hard.

    Classical computers use the laws of classical physics to operate. Classical physics is deterministic, and that's how we want our classical computers to behave. As the chip and die sizes get smaller and smaller (what are we at now, 65nm?) CPUs are more likely to suffer from quantum effects, but AFAIK there's circutry in there to compensate for that. Error checking.

    A quantum computer is just a machine that uses the laws of quantum mechanics rather than the laws of classical mechanics to operate. The advantage is that some algorithms, when implemented on a quantum computer, are 2n instead of n^2. I never really understood this, maybe a better physicist will come along and explain it. Anyway, to build a quantum computer one needs two things:
    - (a) You need some Quantum bits (qbits) to store data
    - (b) You need to get those bits to interact with each other in some fashion

    There are many approaches to building a quantum computer. One guy (Raymond Laflamme) has a bunch of different atoms that are different elements all in the same molecule, those interact with each other but he has only developed the ability to read / write to about 5 different qbits. I read about another guy on Slashdot here who made a giant array of qbits using atoms in a laser trap. That gets you a lot of qbits, but they don't interact at all. There are many approaches.

    Anyway, the reason I think Dwave Systems is full of bullshit is that any approach thus far is good at (a) or (b), but not both. Someone who got a powerful quantum computer up and running would most assuredly win a Nobel Prize. Also, why the hell would he need to woo venture capital? I know I'm up in Canada, but I'm sure most governments are throwing scads and scads of research money at Quantum computing. Answer? Venture capitalists are more naive.

    If there's anything I learned from here, it's that a lot of Con artists use buzzwords to try and justify their woo-woo science. "Quantum" is one of them.

    Smart money on this guy being a fraud.

    --
    "Live as if you'll die tomorrow." Ridiculous. You could die later today.
    1. Re:Woo Woo science by kfg · · Score: 1

      . . . the reason I think Dwave Systems is full of bullshit is that any approach thus far is good at (a) or (b), but not both.

      You'd almost think that there was some sort of undetermanism at work or something.

      KFG

    2. Re:Woo Woo science by Iwanowitch · · Score: 5, Funny
      any approach thus far is good at (a) or (b), but not both.
      Ooh, Heisenberg-approaches!
      --
      One CS student VS 893 DOS games: Let's play oldies
    3. Re:Woo Woo science by grrrgrrr · · Score: 1

      Hey I think we are already using quantum computers. Computers that use the laws of classical physics to operate have to use vacuum tubes. Semiconductors are very much a product of the quantum mechanics. The effects of semiconductors where known before and used in crystal radios but where not really understood the same is true for for-example the photovoltaic effect .

    4. Re:Woo Woo science by cannonfodda · · Score: 1
      I'm with you on this one. I think this is total pants.

      For a start: "In a superconductor all of the "particles" that carry charge around can exist in the exact same state, so when you look at a whole lot of these particles (many trillions) it can be just like looking at only one (which is "very quantum mechanical")."

      My quantum mechanics is pretty rusty but I think the exclusion principle still holds at low temperatures. I which case, this is complete rot.

      --
      Hmmmmmm
    5. Re:Woo Woo science by cnettel · · Score: 1

      For fermions, yes. One point in models of (some) superconductors is a special pairing of electrons to form a boson-like structure. The common exclusion principle is just an idealized special case, not a general law for all wave functions. Ever heard of L.A.S.E.R.?

    6. Re:Woo Woo science by Valacosa · · Score: 5, Insightful

      You're half right. I had forgotten about the quantum properties of transistors.

      Though a transister does use Quantum Mechanics to function, it is a discrete unit (a "black box" if you will) with a preidctable outcome. A quantum computer, on the other hand, uses a property of QM known as "superposition of states". A qbit in a quantum computer isn't 0 or 1, but some combination of 0 and 1 at the same time. It's only when the qbit is "observed" (read) that it becomes a 0 or 1.

      If we can get these qbits to interact with each other without reading them (or "collapsing the wavefunction", in quantum mechanics lingo) then we can have various superpositions of 0s and 1s interacting with each other within an algoritm. Essentially the algorithm run by the quantum computer is acting in parallel with itself. When we observe the qbits when the algoritm is finished, we see the desired result. I know that sounds like magic, but I've probably explained it poorly. I've explained it better in the past.

      Incidentially, someone who is uneducated (not stupid, mind you, just uneducated) may have difficulty distinguishing between the BS in the original article and the more scientifically accepted BS I've spouted. See? That's how these con artists are allowed to succeed!

      --
      "Live as if you'll die tomorrow." Ridiculous. You could die later today.
    7. Re:Woo Woo science by adamofgreyskull · · Score: 0
      any approach thus far is good at (a) or (b), but not both.
      Ooh, Heisenberg-approaches!
      Or does he?...
    8. Re:Woo Woo science by grrrgrrr · · Score: 1

      So that is meant by a quantum computer . But i have to ask you a question to see if i really understand. For example when I think of finite state machines as a model for computers a quantum computer like is a direct implementation of a non-deterministic state machine?

    9. Re:Woo Woo science by gsn · · Score: 1

      No, no - if Heisenberg approcahes the real question is where is he? BTW mods I think that parent is "Funny" as opposed to "Informative" unless we must have sigma Funny sigma Informative >= hbar/2 in which case since hes marked informative no body can ever know how funny he is....

      --
      Reality must take precedence over public relations, for nature cannot be fooled.
    10. Re:Woo Woo science by jtheisen · · Score: 1

      Or a deterministic turing machine and a non-deterministic turing machine.

      If someone in the know could answer this question this would be greatly appreciated.

    11. Re:Woo Woo science by infolib · · Score: 2, Informative

      Maybe you should look into this really nice bunch of intros to quantum computing. (Click on "Tutorials").

      --
      Any sufficiently advanced libertarian utopia is indistinguishable from government.
    12. Re:Woo Woo science by Ruberik · · Score: 1
      Smart money on this guy being a fraud.

      It's not so much that he's a fraud. My understanding is that D-Wave is really working on this stuff, but they're known for somewhat optimistic press releases. Realistically it doesn't seem very likely that this approach is going to have us factoring like mad any time soon (much less getting quadratic speedups on more mundane problems).

  10. Quantum computing's Best candidate?? by Magi77 · · Score: 1

    I was wondering which one is the best candidate for Quantum computing. -Metal (superconductor) based -Optical quantum computer

  11. The guy is a *tad* optimistic by Ancient_Hacker · · Score: 2, Funny
    Seeing as nobody has been able to make even a 2-bit quantum adder, the guy is a bit optimistic that he will have a supercomputer in a year.

    BTW all circuits on the lowest level are "quantum" circuits, so maybe he's just trying to pass off his Packard-Bell 66MHz PC as a quantum computer?

  12. It just sounds a lot like a RSFQ chip. by AWeishaupt · · Score: 4, Informative

    From what has been described on the blog and website, i'm not convinced that what they're working on is much more than simply a superconducting RSFQ - Rapid Single Flux Quantum - chip, which although can concievably run at a breakneck speed compared to todays Silicon CPU's, is not a Quantum Computer in the normal sense. This thing isn't going to run Shor's Algorithm. Also, i'm surprised to notice that there are people here who still consider QCs as science fiction - they're not. Quantum Computing has been practical in the lab since the 90's - and, for example, composite numbers have been factorised in polynomial time. The challenge faced by QCT research groups around the world at present is mainly building the things with a large number of qubits, and still maintaining successful operation. With regards to solid state devices such as the Kane QC model, one of the approaches being investigated involves building multiple small QCs and interconnecting them via conventional microelectronics - perhaps SETs, RSFQs, spintronics or maybe even plain old silicon microelectronics - to create a useful, many-qubit, computer.

    1. Re:It just sounds a lot like a RSFQ chip. by khallow · · Score: 1

      Quantum Computing has been practical in the lab since the 90's - and, for example, composite numbers have been factorised in polynomial time.

      How many qubits are we talking here? Last I heard which was within the last couple of years, the Shor algorithm had been used on the number 15, ie, manipulated four qubits of information. I also seem to recall that the log time search algorithm had been tried on seven qubits or so. These are fairly recent. Since the size of the problem is so small, I wouldn't consider QC to be "practical" even in the lab. But OTOH actually quantum computing has been demonstrated. It's not a fantasy.
    2. Re:It just sounds a lot like a RSFQ chip. by Anonymous Coward · · Score: 0

      I was pretty sure that was the case from the article, but it was a bit vague - it seems it's not a quantum computer, but a quantum mechanical classical computer. The difference is that data cannot be in a superposition of states, and thus quantum algorithms such as Shor's algorithm can't operate. It will not lead to factoring numbers in linear time, or anything else. If this was actually a quantum computer, this would be *much* bigger news.

      However, experience with superconducting computing may help lead to a working quantum computer - so this isn't worthless. It's just advertising speak.

    3. Re:It just sounds a lot like a RSFQ chip. by Schwarzchild · · Score: 1
      Also, i'm surprised to notice that there are people here who still consider QCs as science fiction - they're not.
      Apparently, there are Computer Scientists who still regard quantum computing as science fiction. Read a few quantum computing blogs if you don't believe this to be true.
      --

      "sweet dreams are made of this..."

    4. Re:It just sounds a lot like a RSFQ chip. by AWeishaupt · · Score: 1

      You're exactly right - only a very small number of qubits. Trying to scale it up to handle larger problems is the main challenge in QC research at the moment, as i said. But, strictly speaking, working quantum computers do exist, for real, today. Whilst you could call any Josephson Junction-based microelectronic computer chip a "quantum mechanical computer", it's possible to apply that term to any semiconductor-based microelectronics, if you wanted to.

  13. ACK by Anonymous Coward · · Score: 3, Informative

    As a physicist who had courses in Quantum Computation I had to vomit when I just read the Title Superconducting Quantum Computer.

    There are only two Quantum Algorithms with applications in real live AFAIK Shor's factoring Algorithm to find the Prime Factors of a number in polynomial time, and a boosted search algorithm, which gives a \sqrt(O) speed boost. The largest number Shor's Algorithm could be used on is 15. And it won't be usefull before we reach 16 bit's or so (which we won't in my lifetime with any of the approaches discussed today). The larges stable aray of qubits is 8 AFAIK, and you cannot do anything with those so far everybody is just working on stbility and prooves of concept.

    1) Hence there is no usefull quantum computer in existence. Anyone who want's to sell you one is a liar.

    Superconductivity, is well known and not very hard to achieve. I can make pretty much any material superconducting if you just give me a liquid Helium 3/4 demixer. So once I have a working quantum computer, I can add some lead, empty a bottle of Liquid Helium over it, and claim, that I have a super conducting Quantum computer. To be fair it's often inherent in the design of a Quantum computer that it needs to be very cold. But it doesn't always need to be so. But what remains is

    2) Saying a quantum computer is superconducting doesn't add any infomation about the usefullness of such a device.

    So what could this headline mean:
    Someone allows you to use his NMR (Nuclear Magnetic Resonance) device if you give him money.

    (NMR is standard in todays chemistry labs, and very simple useless quantum algorithms (see "Deutsch algorithm") have been implemented with it.)

    Where is the beef? Can an article still be kicked out at this stage?

  14. Carl Sagan Said it Best by deadline · · Score: 2, Interesting

    I paraphrase:

    "extraordinary claims require extraordinary evidence"

    Yet another under construction web page and half baked idea. I pity the investors. And remember what Feynman said (which is still true today):

    "No one understands quantum mechanics"

    Which does not keep us from using the results of a a highly successful theory, but just keep in mind, wave function computing is not going to be easy, but I believe it is possible. And I should know, I'm made of atoms.

    --
    HPC for Primates. Read Cluster Monkey
    1. Re:Carl Sagan Said it Best by philipmather · · Score: 1

      > "No one understands quantum mechanics" Speaking as an Engineer I spend most of my days making things "I don't understand" work. It's not always necessary you know, I mean I've got a very good idea of how a SI engine works but I'd still be calling out the breakdown service if my Volvo packed up on the way to work. The other thing to consider is that some of the problems that a quantum computer would work on have an easily checkable answer. The travelling salesman problem might be tricky to verify, but if for instance the NSA had one a QC and some encrypted comms they wanted to break checking whether the private key your quantum computer has just generated from the public key is going to be trivial, it'll either decrypt to a bunch of gibberish or to a communication from the Chinese embassy saying their about to stop buying up you dollar debt mountain (that was joke, breath deeply yeah ;^) ). What have they got up to these days, maybe a dozen qubits did someone say? Say you built one at 24 qubits that only got all the way through it's calculation without collapsing it's wave one in ten times, I'm sure the lads at Langley would still want to "have a chat". I don't whether a 12 qubit QC is particularly feasible or reliable but I'm sure someone somewhere is willing to spend the money to find out and wouldn't be too upset to have something half reliable.

      --
      Regards, Phil
  15. Do they know what they are talking about? by rufusdufus · · Score: 2, Interesting
    The linked article, and the company web site is very sparse on information. Is there any indication that this guy knows what he's talking about? I did find one 'fact' on their web site that indicates that the answer may be no. Take a look at the last paragraph on the page:

    Quantum computers can be used to get approximate solutions to large NP-complete optimization problems much more quickly than the best known methods running on any supercomputer.



    I think this statement is incorrect. My understanding concurs with what is written in the wiki article:


    This dramatic advantage of quantum computers is currently known to exist for only those three problems: factoring, discrete logarithm, and quantum physics simulations. However, there is no proof that the advantage is real: an equally fast classical algorithm may still be discovered (though some consider this unlikely). There is one other problem where quantum computers have a smaller, though significant (quadratic) advantage. It is quantum database search, and can be solved by Grover's algorithm. In this case the advantage is provable. This establishes beyond doubt that (ideal) quantum computers are superior to classical computers.


    and


    BQP is suspected to be disjoint from NP-complete and a strict superset of P, but that is not known. Both integer factorization and discrete log are in BQP. Both of these problems are NP problems suspected to be outside BPP, and hence outside P. Both are suspected to not be NP-complete. There is a common misconception that quantum computers can solve NP-complete problems in polynomial time. That is not known to be true, and is generally suspected to be false.

  16. what a load of crap by Anonymous Coward · · Score: 0

    This is utter nonsense. Either the company is a front for something else, or their public relations department needs to be executed at dawn. For example - a quote from the article:

    "Whenever anyone says 'superconductor' just think 'really cold metal' "

    This is just garbage. A superconductor does not have to be metallic (some of the best are actually ceramics) and cold metal does not necessarily have zero resistance.

  17. it's hard :( by snafu109 · · Score: 1

    I find the very notion of quantam computing so complex that just reading the article's title made my head explode. Luckily there was a quantam wormhole within my skull that reassembled my head and brain, with no side effects whatsoever!

    I like stories.

    1. Re:it's hard :( by InMSWeAntitrust · · Score: 1

      One slight side effect, I see A useless post

  18. Low power CPU vs enormous cooling costs?? by slackaddict · · Score: 1
    FTA:

    "Historically arguments for metal-based processors have been that (1) since they're made out of superconductors, they generate much less heat than conventional processors (true); (2) for some technical reasons you can operate at clock speeds up to about 100 GHz without alot of problems (true); so if you want a really fast, really low power processor, here's a way to do it."

    Ok, sure you've got a low power CPU but what about the massive amounts of energy expended to keep it at absolute zero? This doesn't sound very practical to me. Maybe a physicist can shed some light on recent cooling advances that I'm not aware of...

    --
    ConsultingFair.com
  19. It's a *quantum* computer by WilliamSChips · · Score: 3, Funny

    If you assess the capabilities of the system, it disappears!

    --
    Please, for the good of Humanity, vote Obama.
  20. nobium? Surely you mean by Anonymous Coward · · Score: 0

    Niobium.

    A missing i, do you see?

    Nobium on the other hand is a gift to those who like knob jokes.

    The Anonymous Chemistry Spelling Nazi

  21. QC Simulator Demo + little patch by drkfdr · · Score: 1

    I came across some simulator... http://www.senko-corp.co.jp/qcs/ patched SetModifiedFlag (MFC) so you can simulate own circuits 00018030: 8B 31 (old and new value) 00018031: 44 C0 00018032: 24 90 00018033: 04 90 "Nag"screens removal 000011A0: 6A C3 00001470: 6A C3 Note that these patches still don't allow to save to a file but it's at least something.

  22. QP =? NP by benhocking · · Score: 2, Informative

    Actually, it would mean that QP = NP. This is considered more likely than P = NP, but as with P=?NP no one has yet shown it to be true or false.

    --
    Ben Hocking
    Need a professional organizer?
    1. Re:QP =? NP by RKBA · · Score: 1

      LOL! It took me a few seconds to get the joke, but after I couldn't find a definition of "QP" anywhere, I realized you probably meant it to be "Quantum Polynomial" time, and so your QP = NP means that P = NP iff you have a quantum computer. Right? Har, har. ;-)

    2. Re:QP =? NP by KDR_11k · · Score: 1

      It's BQP, not QP. The B means that the answer it gives has a chance of over 50% to be correct and running the algorithm often enough allows you to guess the correct answer by seeing the rate at which each occurs.

      --
      Justice is the sheep getting arrested while an impartial judge declares the vote void.
    3. Re:QP =? NP by lgw · · Score: 2, Interesting

      That's the promise of Quantum Computing. I'm quite skeptical, but given the NSA is suggesting that one rely on ECC instead, there's something brewing: the NSA has given *very* good advice historically, though it has sometimes taken the private sector decades to understand.

      Also note that factorization hasn't been *proven* NP-hard, so there may be a different explanaiton for the NSA's advice. They are the world's largest employer of math PhDs, after all, and it's just possible they know something we don't.

      In any case, there's a lot of study about what kind of problems a quantum computer could solve in P time: it's *not* all of NP, which is pretty interesting in an abstract way even if QC turns out to be BS.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    4. Re:QP =? NP by Anonymous Coward · · Score: 0

      I'm quite skeptical, but given the NSA is suggesting that one rely on ECC instead, there's something brewing: the NSA has given *very* good advice historically, though it has sometimes taken the private sector decades to understand.

      Ummm, because there's a subexponential factoring algorithm, but the best ECDLP algorithm is fully exponential and no one knows how to do it faster? Duh.

    5. Re:QP =? NP by fatphil · · Score: 1

      Yeah, NSA advised that DES keys should only be 56 bits (or fewer).
      That was /great/ advice given that extrapolating the final crack-box's cost backwards in time we can see that the NSA would have had the budget to brute-force crack such keys at least a decade before the public crack.

      FatPhil

      --
      Also FatPhil on SoylentNews, id 863
    6. Re:QP =? NP by lgw · · Score: 1
      can see that the NSA would have had the budget to brute-force crack such keys at least a decade before the public crack.


      Of course this would have been true regardless of the number of bits in the key, but then I've never been much of a fashion consultant for tinfoil headware.
      --
      Socialism: a lie told by totalitarians and believed by fools.
  23. Under the hood? by clang_jangle · · Score: 1

    The summary is waaaaay off base, as there are no "under the hood" details (except to identify a single construction material). Also no real claim of quantum computing is made.

    --
    Caveat Utilitor
  24. Financial expert wanted by exp(pi*sqrt(163)) · · Score: 1

    This device won't work. I won't bother giving my reasons. Can someone tell me how I can convert this knowledge into some kind of bet on a market that will make me money? It seems I ought to be able to use this knowledge somehow.

    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
  25. Au contraire by vtcodger · · Score: 1
    ***I'd be very suprised if their quantum computer will be faster than conventional computers by next year. 20 years away, maybe.***

    Just a guess. Given the article, one can't do anything other than guess. I think this may be a conventional computer using superconducting technology, not a 'quantum computer' as the term is usually understood. It seems to be expected that a superconducting computer -- if one can be built -- might clock an order of magnitude faster than conventional semiconductor based computers As I understand it, today's supercomputers are little if any faster than Best Buy's $300 special of the week. They just have a huge number of CPUs hooked up in parallel (I'm sure that if I have that wrong, someone will point out that I'm a total moron).

    Where does quantum computing come in? Looks to me like it doesn't exactly. My impression is that when you dink around with superconductivity, you need to understand and allow for quantum mechanical effects. That's all the article claims to do as far as I can see.

    So, can they build this wonder? Possibly, but my guess is that they can't. AFAIK, no one else has demonstrated or shipped a real, functioning, superconducting computer. I'm dubious that an outfit that needs to send out what are probably misleading press releases will be the first. But I've been wrong before.

    As for quantum computing. It's surely going to look like black magic to me, and, I strongly suspect, most other folks. I can sort of vaguely understand how (all?) the possible solutions to an operation can be computed simultaneously and held in a quantum device. I don't have clue how one knows which answer is the desired answer.

    --
    You can't see ANYTHING from a car, You've got to get out of the goddamned contraption and walk...Edward Abbey
  26. Re: Why?? by Anonymous Coward · · Score: 0

    Why would you use a superconducter to make a transisitor? The point of a transistor is to have resistance. Voltage over a certain amount will be able to pass the transistor. That equals a 1. Voltage that's under the threshold does not pass.... that equals a 0.

    Superconductors have 0 resistance so you might as well not even have a transistor... It's always gonna be a 1.

  27. Imagine... by Anonymous Coward · · Score: 0

    an old linux overlord cluster of these in soviet russia! (YOU compute they!)

  28. Complete nonsense by Anonymous Coward · · Score: 1, Informative

    This article is total crap. IAAP (figure it out) in the field of spin based electronics, closely aligned with efforts to develop qc. As described in the article, these circuits are not quantum bits. Nb metal that is held at low temp will enter the so called "ground state" of the material where all electrons are in a single state. Great. you have a macroscopic quantum state. Problem is that superconducting states do not exist outside of the superconducting metal. in fact they have a region of "normal state" i.e. non-superconducting electrons that forms a small skin on the outside of the material. This is mostly the result of disorder in the material, thermal fluctuations etc. This means that if you hare trying to create 2 q-bits in this way, you will have trouble "coupling" them together. if there is no coupling, no information transfer, no interaction, and no "computation". Building q-bits is easy, anyone can do it. Coupling q-bits and controling that coupling interaction is the hard part. superconducting states cannot couple to each other if they are discrete disconnected structures. This article is total bs. inverstors beware.

  29. MIT Technology Review Article on DWave by citanon · · Score: 3, Informative

    http://www.technologyreview.com/read_article.aspx? id=14591&ch=infotech

    Computers have infiltrated nearly every field of business and science, and they keep getting faster. Nonetheless, researchers routinely encounter problems impossible for even the most powerful supercomputers to solve. The remedy could be quantum computers, which would use the fantastic properties of quantum mechanics to crack such problems in seconds rather than centuries. Since the 1980s, physicists in academic labs and at firms such as IBM, Hewlett-Packard, and NEC have pursued a variety of quantum computing approaches, but none seems likely to deliver a working machine in less than 10 years.

    Company: D-Wave Systems

    Headquarters: Vancouver, British Columbia

    Amount invested: $22 million Canadian (about $17.5 million U.S.)

    Lead investor: Draper Fisher Jurvetson

    Key founders: Geordie Rose, Alexandre Zagoskin, Bob Wiens, Haig Farris

    Technology: Quantum computers

    Vancouver startup D-Wave Systems, however, aims to build a quantum computer within three years. It won't be a fully functional quantum computer of the sort long envisioned; but D-Wave is on track to produce a special-purpose, "noisy" piece of quantum hardware that could solve many of the physical-simulation problems that stump today's computers, says David Meyer, a mathematician working on quantum algorithms at the University of California, San Diego.

    The difference between D-Wave's system and other quantum computer designs is the particular properties of quantum mechanics that they exploit. Other systems rely on a property called entanglement, which says that any two particles that have interacted in the past, even if now spatially separated, may still influence each other's states. But that interdependence is easily disrupted by the particles' interactions with their environment. In contrast, D-Wave's design takes advantage of the far more robust property of quantum physics known as quantum tunneling, which allows particles to "magically" hop from one location to another.

    Incorporated in April 1999, D-Wave originated as a series of conversations among students and lecturers at the University of British Columbia. Over the years, it has amassed intellectual property and narrowed its focus, while attracting almost $18 million in funding, initially from angel investors and more recently from the Canadian and German governments, and from venture capital firms. The company plans to complete a prototype device by the end of 2006; a version capable of solving commercial problems could be ready by 2008, says president and CEO Geordie Rose.

    The aggressiveness of D-Wave's timetable is made possible by the simplicity of its device's design: an analog chip made of low-temperature superconductors. The chip must be cooled to -269 C with liquid helium, but it doesn't require the delicate state-of-the-art lasers, vacuum pumps, and other exotic machinery that other quantum computers need.

    The design is also amenable to the lithography techniques used to make standard computer chips, further simplifying fabrication. D-Wave patterns an array of loops of low-temperature superconductors such as aluminum and niobium onto a chip. When electricity flows through them, the loops act like tiny magnets. Two refrigerator magnets will naturally flip so that they stick together, minimizing the energy between them. The loops in D-Wave's chip behave similarly, "flipping" the direction of current flow from clockwise to counterclockwise to minimize the magnetic flux between them. Depending on t

    1. Re:MIT Technology Review Article on DWave by localoptimum · · Score: 1
      "The aggressiveness of D-Wave's timetable is made possible by the simplicity of its device's design: an analog chip made of low-temperature superconductors. The chip must be cooled to -269 C with liquid helium, but it doesn't require the delicate state-of-the-art lasers, vacuum pumps, and other exotic machinery that other quantum computers need."

      cooling to helium temperature does require vacuum pumps (usually more than one kind) and - if you want it to be reliable - a liquid nitrogen jacket too. I filled cryostats for years. There's nothing exotic about cryogenics, we've been doing this for decades. Just another example of the bull in this whole thing...

      --
      This message was scanned by European governments and contains no terrorism.
    2. Re:MIT Technology Review Article on DWave by citanon · · Score: 1

      No, it's saying that it doesn't need anything exotic. The beauty of their system, if it works, is its simplicity. They've found the simplest iteration of the "quantum computer" that's still useful for real world applications. I hope that they succeed. It would be nice to finally get some accurate energies for quantum chemistry systems where electron correlation is important. Right now, we can't even calculate van der waals forces ab initio.

    3. Re:MIT Technology Review Article on DWave by localoptimum · · Score: 1

      I too would like a quantum computer for accurate simulation studies of quantum spin ladders and molecular magnets, but my point is that I smell a rat here and I don't fancy their chances. Hats off, however, if I'm wrong and they actually build it instead of simply disappearing with the profits, after selling the company shares in a couple of months :)

      --
      This message was scanned by European governments and contains no terrorism.
  30. typo by torvince · · Score: 1

    ''It is based on nobium superconducting 'circuits of atoms'''

    I dont know what nobium is, i hoped it was based on niobium ...

    1. Re:typo by csrster · · Score: 1

      It's a typo for "noobium".

  31. That kind of hood must be very small by eille-la · · Score: 1

    It is all in the title

  32. I guess Josephson junctions and/or vaporware by infolib · · Score: 2, Informative

    This smells vaguely like vaporware. At least none of the speakers at this years or last years Spin and Qubit conference seemed nearly as optimistic as these guys, even though there were several top notch people (and last year the focus was VERY much quantum computing).

    In any case, the technology that comes to mind when I hear "very cold superconducting niobium quantum computer" is Josephson junctions. There's an article on it here.

    What people does DWave have? What have they published previously?

    --
    Any sufficiently advanced libertarian utopia is indistinguishable from government.
  33. Yes, it IS Josephson junctions by infolib · · Score: 1

    They've put up a paper on their techniques. And judging from the pictures, they do something that looks like serious research. Interesting. Apparently they're after quantum chemical computations.

    --
    Any sufficiently advanced libertarian utopia is indistinguishable from government.
  34. D-Wave doesn't use quantum entanglement by Anonymous Coward · · Score: 0

    There appear to be various kinds of "quantum computers", and this seems to cause a certain amount of confusion.

    Your post implicitly refers to QCs that employ quantum entanglement and have a large number of qbits. D-Wave's system doesn't.

    Instead, it seems to use Cooper pair amplification in a bulk superconductor to allow atomic-scale quantum effects like tunnelling to be manipulated at the macroscopic level. In effect this provides a large handle by which to poke tiny stuff. (:P)

    The real question is, what kind of "tiny stuff" can be "poked" and what kinds of computer solutions does this enable. Well, D-Wave has identified some potential applications, and indeed they are pretty important ones which might earn them gazillions. But your factorization example is not one of them.

  35. I think it will. by jthill · · Score: 1
    won't help with symmetric key crypto at all
    If you have any known plaintext, anywhere, your symmetric key is toast: Q will just try every key at once and select what produces that text. AES is a good deal simpler than multiplication (presuming that there's no magical direct method — the hits I get on "quantum multiplication" might as well be encrypted).
    --
    As always, all IMO. Insert "I think" everywhere grammatically possible.
    1. Re:I think it will. by lgw · · Score: 1

      There's no evidence that I know of that this is possible in the general case. A quantum computer is not some infinitely-parallel magic for solving all possible enumerative math problems instantly. Assuming, of course, that QC can actually be made to work on real problems at all, which has not been demonstrated to an engineer's satisfaction, QC merely makes the correct outcome more probable when guessing.

      Shor's algorithm to factor large number quickly with QC relies on feedback: a near-miss is useful for refining your next guess. A good symmetric algorithm makes this useless, as there's no wrong guess that tells you more about what the right key is.

      Also note that simply having one block of plaintext isn't generally going to be enough to guess the key by any method: even a magical guessing machine won't help you until your known plaintext exceeds the unicity distance.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    2. Re:I think it will. by jthill · · Score: 2, Informative

      A Brief History of Quantum Computing contradicts all your quantum-computing assertions: "In effect, a calculation performed on the register is a calculation performed on every possible value that register can represent." That's in its description of Shor's algorithm, which also contradicts your feedback-driven characterization, saying it produces very-likely factors and succeeds by simply retrying until one of its answers works.

      That link also describes Grover's algorithm, cutting brute-force search from O(N) to O(N^0.5). That alone is enough to put AES-128 in range of today's horsepower (but not enough to reach AES-256). Maybe it's provably impossible to reduce symmetric decryption to less than linear search, I don't know.

      The number of plausible-but-wrong decryptions of a cipher block you know the plaintext for is zero, so unicity distance is only trivially relevant; if you insist, we can say it's exactly the cipher block size regardless of the plaintext language in this specific case.

      --
      As always, all IMO. Insert "I think" everywhere grammatically possible.
    3. Re:I think it will. by lgw · · Score: 1

      People believe all sorts of things about quantum computing, perhaps we'll see a demonstaration one day to clear the air. Perhaps not. I'm extremly skeptical of inventions that only work on PowerPoint slides.

      In any case, having a block of known plaintext only makes the problem trivial if you know exactly what block of cyphertext it corresponds to, which you seem to be assuming is the case. Granted, if you have a known plaintext block (after known compression), and know the corresponding cyphertext block, and you have a magical guessing machine, then the unicity distance of the plaintext isn't important.

      If the correspondance between cyphertext and plaintext blocks is unclear, you still need enough plaintext to prove that you're not decrypting the wrong cyphertext block with the wrong key to get your known plaintext. Good compression is critical for cryptography whether the attacker is real or quantum, and leaving the block order unchanged in the cyphertext is just plain lazy.

      --
      Socialism: a lie told by totalitarians and believed by fools.
  36. Quantum computers...eh by InterestingX · · Score: 2, Funny

    When they come up with a quantum torpedo, I'll listen...

  37. how cool is this by whitman's+ghost · · Score: 1

    It sounds like this process would be a lot easier to create the quantum computing effect and substain it. Given the amazing promises that quantum computers offer, I can't help but get exicted. I hope that they continue to deliver on their promises. The future is so exicting.

    --
    They call me....Tim??!
  38. That is not a quantum computer by Anonymous Coward · · Score: 0

    If you're not a moron, you can see that it isn't really a quantum computer at all. Just fake advertisements. Talk to any professor- Quantum computing MAY be possible in around 200 years or so.

  39. I would be surprised it they manage.... by drolli · · Score: 2, Informative

    to build a working Quantum Computer until 2007. It would be a nice surprise, actually....

    As a small disclaimer: I work in QC field. There are a few approaches to building a superconducting quantum computer, but there are not many experiments coupling even two Qubits. One paper discussing one of the few experiments which worked is:

    http://scholar.google.com/scholar?q=author:%22Pash kin%22%20intitle:%22Quantum%20oscillations%20in%20 two%20coupled%20charge%20qubits%22%20&hl=de&hs=oKY &lr=&safe=off&client=firefox&rls=org.mozilla:en-US :unofficial&oi=scholarr

    But there are severe problems with superconducting qubits, namely that the quality of the insulators used in standard processes are not good enough for building a working QC right now.
    (http://eiffel.ps.uci.edu/cyu/publications/qubit.p df#search=%22mooji%20qubit%22,
    http://link.aps.org/doi/10.1103/PhysRevLett.95.210 503)

    It's not that these fundamental problems could not be adressed by developing better insulators or using other approaches
    (http://www.solid.phys.ethz.ch/wallraff/content/sc ience/QuantumComp.html, http://link.aps.org/doi/10.1103/PhysRevLett.95.210 503), but it is unlikely that any quantum computer will provide cheaper computing power for NP-hard problems than the cell processor until quite a while from now. In my personal opinion and also the opinion of some other people which i talked to is that the timescale for that is something like 10-15years of intense research.

    But indeed, superconductors are one of the best candidates (others: atom traps etc.).

    The role of D-Wave is that they are trying to push the development of superconducting QC to something which can be sold or where at least the patents can be sold. So it is natural (and probably good) that the external represantation on what they got is optimistic. But maybe it is important to point out to the slashdot readers that the blog of the CEO of a company is for sure an optimistic assumption what the future may hold and not the full criticism imposed by a peer-review in a scientific journal........

    Another thing which makes it difficult to assess what they got is that D-Wave is usually pretty uninformative about what their specific plans are. Thats understandable because they spend a lot of money (for a company) into something where they will get out patents which would be weakened by prior art if they talk to loud.

  40. Re: Why?? by maxwell+demon · · Score: 1

    Well, if you can switch between superconductivity and normal conductivity (maybe even with a large resistance in the non-superconducting state state), then it would make sense, I didn't RTFA, but I could imagine that this is possible by creating a magnetic field at the superconducting wire (large enough magnetic fields make superconductance break down). Then you could have e.g. superconducting state = no resistance = no voltage on the wire = 0, and normal conducting state = resistance = voltage on the wire = 1. Or alternatively, superconductance = no resistance = high current through the wire = 1, normal conductance = resistance = low current through the wire = 0.

    --
    The Tao of math: The numbers you can count are not the real numbers.
  41. You can't because..... by citanon · · Score: 1

    It's a private company.

  42. A minor correction, cos I'm pedantic like that by ZombieWomble · · Score: 1

    Those probabilities should be a^2, b^2, and so forth. Seems slashdot doesn't like alt-0178.

    1. Re:A minor correction, cos I'm pedantic like that by lokiomega · · Score: 1

      I think what he's saying is that it isn't base 2, but rather the base is all the states it could possibly have. Like is a bit was red, blue, and green instead of 0 and 1. As far as all I've read there are more than an "on" and "off" state.

    2. Re:A minor correction, cos I'm pedantic like that by bh_doc · · Score: 1

      That should actually be |a|^2 and |b|^2, ie the square of the modulus. a and b are called amplitudes, and they are not necessarily real numbers.

      Sincerely,
      A Fellow Pedant

    3. Re:A minor correction, cos I'm pedantic like that by ZombieWomble · · Score: 1

      Ah, you're quite right, well spotted. My break from quantum mechanics has made me sloppy.

    4. Re:A minor correction, cos I'm pedantic like that by ZombieWomble · · Score: 1
      Well, it's true, you could quite probably build a quantum computer around some more complex system with more than two levels, but the same applies to a classical computer, if you really wanted to. The issue there is whether or not it's actually worthwhile to do so, given any resulting changes in complexity and the like.

      But the thing is, any such quantum computer would not be referred to as being made up of a number of "qubits", as that explicitly implies a 2-level system - Wikipedia suggests "qutrit" for your hypothetical 3-level system, and so forth. It's not just a minor technicality either, as the difference in complexity and power is quite significant.

  43. Under the hood? by Mr.+Bad+Example · · Score: 1

    I opened the hood of my quantum computer, and all I found was a cat and some guy who kept asking for Wigner. I'm thinking of getting my money back.

  44. Wait a minute... by EmagGeek · · Score: 1

    How do you know that under the hood is the right place to look?

  45. As someone somewhat affiliated... by PaulBu · · Score: 1

    ... I can say definitely, YES!

    Paul B.

    1. Re:As someone somewhat affiliated... by kickedfortrolling · · Score: 1

      good, cos I expect even reducing n^2 tasks to 2n wont give us playable frame rates with aero glass.

      --
      --AlexC
      Just because I dont agree with climate change doesnt make me a troll
  46. "like getting two qubits to interact..." by PaulBu · · Score: 2, Informative

    Check out the sidebar under "Published Stuff", especially this link... Next objection, please...

    Paul B.

    1. Re:"like getting two qubits to interact..." by fatphil · · Score: 1

      arXiv is not peer reviewed.

      Yes, it's published, but so is any blog or slashdot post.

      Papers does not mean fact. Reproducable results is what
      you're looking for, which requires third parties.

      --
      Also FatPhil on SoylentNews, id 863
  47. "If you can switch..." by PaulBu · · Score: 1

    Congratulations! You've just invented the earliest attempt to build superconductive electronics (SCE), dating back to late 50s, or something -- quantrons these gates were called (I think, way before my time...), controllable by neighboring magnetic fields and using SC/non-SC to distinguish between ``1'' and ``0''.

    In early 60s Brian Josephson discovered interesting properties of what became to be known a Josephson junction, a tunnel barrier between two SC which would be superconducting or normal depending on the current one attempts to pass through it. The next SCE family was called "latching logic" -- switch some on, some off, and they remain in this state for as long as you are providing the bias current. Basis for 80s IBM SCE supercomputer project.

    (R)SFQ is based on a similar kind of sufficiently shunted Josephson junction, which would not stay in resistive state, but resulting currents (or absence of them) in SC loops can be interpreted as ones or zeros. According to some accounts, ``R'' stands for "Russian", though originally it was "resistive", then "rapid".

    Finally, when you use JJs in a SC loop and use the fact that you (nor Nature) have no clue which direction the current flows, you get superconducting quantum computing...

    Paul B.

  48. Let me say that more clearly by exp(pi*sqrt(163)) · · Score: 1

    Creative financial advisor sought.

    --
    Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
  49. Spot the difference by Jarth · · Score: 1

    Just in case you need to see the true state of this qbit-technology visit http://www.atomchip.com/ and http://www.atomchip.org/ for your reading pleasure. Sure worked for me.

    --
    free dom(inion) - free energy - free your mind - whee!
  50. ternary system by brunascle · · Score: 1

    when i first heard about quantum computing, i figured they were trying to move from a binary to a ternary system: on, off, and maybe.

  51. Not a joke by benhocking · · Score: 1

    I've seen the term QP used before at a quantum computing seminar. I certainly didn't coin it. There is a very important distinction between P and QP - namely that QP is, as you guessed, a polynomial time algorithm on a quantum computer. Google on "Quantum Polynomial" and NP if you want more info. Here's a link that Google Scholar turned up, as well (I haven't read it, but it sounds interesting - judging from the title it seems they are claiming that QP=NP): http://scholar.google.com/url?sa=U&q=http://arxiv. org/abs/quant-ph/9908080

    --
    Ben Hocking
    Need a professional organizer?
  52. Verifiable in P by benhocking · · Score: 1

    All NP problems are verifiable in P. So, although probability does still factor in (because in many situations there's a significant chance the correct answer won't come up), you can verify you have the right answer in P.

    --
    Ben Hocking
    Need a professional organizer?
    1. Re:Verifiable in P by KDR_11k · · Score: 1

      No, the output of the algorithm (yes or no) is random with a skew. You can't verify in P if your TSP algorithm gave the right answer.

      --
      Justice is the sheep getting arrested while an impartial judge declares the vote void.
  53. Can be converted to 3-SAT by benhocking · · Score: 1

    As I recall, the travelling salesperson algorithm (I assume this is what you meant by TSP) can be converted to a satisfiability problem in polynomial time. Furthermore, it is trivial to verify the satisfiability problem in polynomial time. Are you arguing that TSP cannot be converted to SAT (or 3-SAT, as is usually done) in P, or that 3-SAT is not verifiable in P?

    --
    Ben Hocking
    Need a professional organizer?
    1. Re:Can be converted to 3-SAT by KDR_11k · · Score: 1

      You can verify whether the path taken by a TSP is valid in polynomial time (which is pretty much the definition of NP) but you cannot verify whether the output of the algorithm (which is "Does a valid path exist for this TSP?") is correct. The quantum computer (or an NTM, which is obviously a bit more powerful than a quantum computer unless BQP=NP) can only tell you the final answer, you cannot see any of the possible solutions it tested since observing them would collapse the quantum wave form. Never mind that to be sure you'd have to test ALL of those possible solutions which is NP-Complete since the original problem is NP-Complete. The only thing that can test the quantum computer's possible solutions is the qc itself and its answer is random with a skew.

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

      --
      Justice is the sheep getting arrested while an impartial judge declares the vote void.
    2. Re:Can be converted to 3-SAT by lgw · · Score: 1

      It seems that the most interesting part of all of this is that, while all problems in NP had been assumed to be "equally hard", this might not actually be the case with a quantum computer.

      --
      Socialism: a lie told by totalitarians and believed by fools.
    3. Re:Can be converted to 3-SAT by KDR_11k · · Score: 1

      Not all problems in NP are equally hard, only the NP-Complete ones (again, assuming P!=NP). Binary search is in NP (and P) but it's not as hard as the TSP (which is in NP-Complete).

      --
      Justice is the sheep getting arrested while an impartial judge declares the vote void.
  54. Simple by Anonymous Coward · · Score: 0

    All machines are mechanical in nature. Machines are metal. Current needs to run to the Atoms. Data needs to be input to the Atoms. Shape takes place. Reworld small scale applications are tested.