Slashdot Mirror


First Quantum Computing Gate on a Chip

An anonymous reader writes "After recent success in using quantum computing for superconducting qubits, researchers from Delft have formed the first Controlled-NOT quantum gate. 'A team has demonstrated a key ingredient of such a computer by using one superconducting loop to control the information stored on a second. Combined with other recent advances, the result may pave the way for devices of double the size in the next year or two--closer to what other quantum computing candidates have achieved, says physicist Hans Mooij of the Delft University of Technology in the Netherlands. Unlike today's computers, which process information in the form of 0s and 1s, a quantum computer would achieve new levels of power by turning bits into fuzzy quantum things called qubits (pronounced cue-bits) that are 0 and 1 simultaneously. In theory, quantum computers would allow hackers to crack today's toughest coded messages and researchers to better simulate molecules for designing new drugs and materials.'"

166 comments

  1. Double the size of a single not gate? by Spazntwich · · Score: 5, Funny

    I know grammar has been taking a hit in society as of late, but now even our computers are blatantly spewing out double negatives?

    We're not in for an unrough ride, gentlemen.

    1. Re:Double the size of a single not gate? by MyLongNickName · · Score: 1

      Where is the second negative?

      --
      See my journal for slashdot ID's by year. Mine created in 2005. http://slashdot.org/journal/289875/slashdot-ids-by-year
    2. Re:Double the size of a single not gate? by MadnessASAP · · Score: 0

      More to the point I thought the idea was to make these things smaller not bigger? Unless I'm missing something.

      --
      I may agree with what you say, but I will defend to the death your right to face the consequences of saying it.
    3. Re:Double the size of a single not gate? by Anonymous Coward · · Score: 0

      That reminds me:
      What happens when you divide by zero in a quantum computer?

    4. Re:Double the size of a single not gate? by Aladrin · · Score: 1

      According to the summary, it's the same thing as dividing by 1 on a quantum computer.

      Let's try it... -universe asplodes-

      --
      "If you make people think they're thinking, they'll love you; But if you really make them think, they'll hate you." - DM
    5. Re:Double the size of a single not gate? by Jazz13 · · Score: 2, Funny

      Rodney McKay steps through the resulting tear in space time and smacks you up the back of the head.

    6. Re:Double the size of a single not gate? by xouumalperxe · · Score: 1

      It's a double-size not gate.

    7. Re:Double the size of a single not gate? by maxwell+demon · · Score: 1

      Of course a quantum floating point exception, which stops your quantum program. Now the interesting part is if you divide by a number that is both 0 and not 0. Then you both trigger and don't trigger an exception, which means your program both will terminate and not terminate at the same time. And you thought the classical halting problem was tough ... :-)

      --
      The Tao of math: The numbers you can count are not the real numbers.
    8. Re:Double the size of a single not gate? by RoboJ1M · · Score: 1

      Everything?

      J1M.

    9. Re:Double the size of a single not gate? by RoboJ1M · · Score: 1

      Or perhaps every possible exception is throw at the same time? That is until you read the value of ex.

      J1M.

    10. Re:Double the size of a single not gate? by RoboJ1M · · Score: 1

      Wait! I know! The cat dies? Or lives... Er, which one happens again?

      J1M.

  2. A solid milestone... by teebob21 · · Score: 5, Interesting

    I find it interesting that the first electronic computing gates devised were the AND/OR gates, using basic diode logic. Quantum computing research develops the NOT gate first. I think this has something to do with the esoteric nature of quantum computing. AND/OR gates require two inputs to change to a single value, where NOT is merely an inverter. The idea of entanglement makes the inversion process a likely first step in quantum research.

    For those wondering why this is important, the first true electronic gates were invented in the early 1920's. This predates point-contact transistors by about 20 years, invented in 1947. 60 years later, here we are with transistor computing in every aspect of our lives.

    At the rate quantum computing is advancing, I think we can expect to see quantum transistors (in the lab, at least) by 2020. A true useful quantum computer may be available less than 50 years from now. Hopefully by then someone will pick up the slack and have the Linux kernel ported to the Q-CPU architecture!

    --
    khasim (12/9/06): In a blind taste test, more people preferred Coke over the Pepsi that I had previously pissed in.
    1. Re:A solid milestone... by Ant+P. · · Score: 2, Interesting

      What is a quantum computer good for, anyway? So far all I've seen is cracking encryption and other stuff involving gigantic calculations. Is there anything in the mainstream market it'd be useful for, like sound/video processing?
      Come to think of it, arithmetic encoding is a bit like encryption...

    2. Re:A solid milestone... by Simon80 · · Score: 2, Insightful

      I wouldn't know for sure, but I don't think it's valid to compare any form of computing based on binary logic with quantum computing. I searched for "quantum transistor" and found this, which makes use of the term to refer to transistors that rely on principles of quantum mechanics to function properly. This would be relevant to conventional computing, but not quantum computing. If I understand correctly, quantum computing is not a replacement for binary logic computing, but an alternative or supplement.

    3. Re:A solid milestone... by Yez70 · · Score: 1

      Consider the possibilities of complex artificial intelligence and this could be applied to virtually any aspect of our lives.

    4. Re:A solid milestone... by Anonymous Coward · · Score: 0

      Any kind of blind search (code cracking, chess, genetic algorithms, you name it) takes the square root of the time it does on a classical computer with the same space available. That's pretty neat.

    5. Re:A solid milestone... by asuffield · · Score: 1

      Any kind of blind search (code cracking, chess, genetic algorithms, you name it) takes the square root of the time it does on a classical computer with the same space available. That's pretty neat.


      However, the only kind of problems for which we would use blind search are very hard and take a very long time already, and the square root of a very slow algorithm is usually still a very slow algorithm. While they are "interesting" problems, they are largely esoteric in nature. Any practical applications of quantum computing are probably going to have to be more creative than the method you're referring to. We don't really know much about non-trivial quantum computing algorithms yet.
    6. Re:A solid milestone... by pablob · · Score: 5, Informative

      I find it interesting that the first electronic computing gates devised were the AND/OR gates, using basic diode logic. Quantum computing research develops the NOT gate first. I think this has something to do with the esoteric nature of quantum computing. AND/OR gates require two inputs to change to a single value, where NOT is merely an inverter. The idea of entanglement makes the inversion process a likely first step in quantum research.

      Keep in mind that this is a Controlled-NOT gate (a two-input gate) and not a simple NOT gate (a one-input gate). It has been proven that if you can implement two-qubit C-NOT and arbitrary one-qubit operations, you can implement a universal quantum computer (that is, one that can run an arbitrary "quantum program").

      There is a deeper reason for quantum computers not to use AND/OR gates, which is their irresibility (AND and OR are two-input to one input gate, which makes them irreversible). Quantum Mechanics is intrinsically reversible, so a quantum computer should be reversible too and that's why it is not common to hear about Quantum AND or Quantum OR.

      Pablo B.

    7. Re:A solid milestone... by Anonymous Coward · · Score: 0

      Transistors *already* use quantum principles to operate. What we're looking for is some kind of fundamental "qbit holder" that stores all superpositions in, for lack of a better term, a created mini-universe. Computing through those involves somehow "selecting the desired universe", whatever the hell that means. It wouldn't operate like a transistor by any means, it's just a convenient analogy for what is the "bit holder" building block in current computing.

    8. Re:A solid milestone... by asuffield · · Score: 5, Interesting

      For those wondering why this is important, the first true electronic gates were invented in the early 1920's. This predates point-contact transistors by about 20 years, invented in 1947. 60 years later, here we are with transistor computing in every aspect of our lives.


      However, it is important to realise that the theory of computation had been in development since the early 1800s (and the logic underlying that had been around for centuries); by the time the first electronic devices were created, we already had a good understanding of what they could be used for, because we had been doing exactly the same things by hand for over 50 years at that point (the word "computer" originally meant a person who performed such computations, and an "electronic computer" was just a device to replicate the task that person was doing).

      We can't do quantum computations by hand, so we have no real experience with the theory, and the underlying statistical methods are relatively recent developments: quantum computers do not use the classical logic that we're all familiar with. This is a massive setback compared to the development of the electronic computer - and advances in theory usually can't be accelerated all that much. It is likely to be between 50 and 100 years before we know enough to build non-trivial applications out of quantum computers. Not because we can't build the hardware, but because we don't know how to write any software to run on them. The entire field of software development will have to be reinvented, and we don't actually know that it will be useful for anything. Unlike the first electronic computers, which had very real and obvious applications performing the tasks that were currently being done by hand, we have only vague theories and ideas about what quantum computers might be useful for. (Even the much-quoted method for breaking certain encryption algorithms is based on various assumptions that aren't proven; we don't know for sure whether quantum computers will actually be able to run it, yet)

      We'll get there eventually, but it will probably take a long time and we can't really predict at this stage whether it'll be particularly useful. From what we know so far, these things are going to be incredibly arcane and obtuse to work with, and that is going to make it difficult. We might see it in our lifetimes, but I wouldn't place any bets on it, it might take much longer. The things we're playing with today may turn out to be the Babbage engines of quantum computing.
    9. Re:A solid milestone... by Anonymous Coward · · Score: 2, Insightful

      Most of the hard logistics problems are forms of nonlinear optimization and usually reduce to integer programming, which is solved by a pretty blind search (excluding tricks like branch and bound, pruning; it's still a tree search). Improving these solutions by a few percent translates into a lot of money very quickly.

      Esoteric, maybe (it'll be a computer in a lab, not a PC), but usable nonetheless.

    10. Re:A solid milestone... by jp102235 · · Score: 4, Interesting

      Well, inverting logic is well, logical (no pun intended) to most modern digital logic designers of the CMOS type. CMOS logic (and its variants) are inherently inverting. That is, the basic gate in CMOS is an inverter. The next higher complexity of gates in CMOS is a NAND and NOR (AND NOT / OR NOT). To make an AND gate requires a NAND and an Inverter... same thing for OR : a NOR and an Inverter. Although the quantum abstraction of computation may not be the same as CMOS (inverting layers of logic) it is not surprising at all that the designers tried to make an inverter first. Had they started during the days of relays, we might have had a different gate altogether. JP

      --
      jp
    11. Re:A solid milestone... by fatphil · · Score: 2, Informative

      Controlled-Not is not Not. Controlled-Not is "if the control line is 1, then not the input, else preserve the input", i.e. XOR. (But being quantum, it must also output the control line too, so that the operation can be reversed.)

      --
      Also FatPhil on SoylentNews, id 863
    12. Re:A solid milestone... by Schemat1c · · Score: 2, Funny

      What is a quantum computer good for, anyway? You could use it to store your recipes.
      --

      "Nobody knows the age of the human race, but everybody agrees that it is old enough to know better." - Unknown
    13. Re:A solid milestone... by IWannaBeAnAC · · Score: 1

      This isn't an ordinary NOT gate, it's a controlled NOT, or C-NOT. This gate does have two inputs. The state of the first input is either inverted or not inverted, depending on the state of the second input. So it is actually very similar to a conventional XOR gate.

      By all means, pull numbers out your ass on what your predictions on when you think a quantum computer will be built, but you should at least put in a disclaimer that you have no idea what you are talking about. WTF is a `quantum transitor' ? There are a lot of designs of transistors that depend on quantum mechanical effects to operate, and are therefore called `quantum transistors'. These exist today, but these are ordinary transistors and have nothing to do with quantum computing. If you are trying to refer to some device that has a similar relationship to a quantum gate that a transistor has to a conventional gate, then I'm afraid you are out of luck - AFAIK there is no such device. For the designs referred to in the article, a Josephson junction could maybe be considered a fundamental building block - but it acts nothing like a transistor.

    14. Re:A solid milestone... by TheRealMindChild · · Score: 1

      Does that mean I can finally play Doom 3 in high quality mode?

      --

      "When life gives you lemons, don't make lemonade. Make life take the lemons back!" -- Cave Johnson
    15. Re:A solid milestone... by WarJolt · · Score: 1

      Transistors replace tubes. Qbits replace transistors. Transistors do the same logical job as tubes. Qbits do the same logical job as Transistors. The transistor drastically changed the way electronics were designed. I suspect Qbits will do the same thing. We still use tubes today however, so obviously there are some things that tubes do differently then transistors. When I bought my tube amp I pretty much stopped using one of my transistor amps. Qbits, transistors and tubes behave differently, but they can do some of the same jobs. Qbits I suspect will slowly replace certain logical blocks on a semiconductor. Qbits and transistors behave differently. They will still be used for the same computational tasks.

    16. Re:A solid milestone... by Climate+Shill · · Score: 1

      What is a quantum computer good for, anyway?

      IIRC, quantum computers have one killer app, which is that they can simulate other quantum systems (i.e. Stuff). If you try simulating a lump of high temperature superconductor on a classical computer you won't get very far, but on a quantum computer you just might.

      #disclaimer: This is slashdot, so I reserve the right to have been talking out of my a(r?)s[se].

    17. Re:A solid milestone... by Climate+Shill · · Score: 1

      this is a Controlled-NOT gate

      Is there a reason why it's called a NOT gate rather than XOR ? Is there some quantum wierdness that makes the thing asymmetric and causes A-inverts-B to mean something different to B-inverts-A ?

    18. Re:A solid milestone... by Max+Littlemore · · Score: 1

      Yes and no...

      --
      I don't therefore I'm not.
    19. Re:A solid milestone... by pablob · · Score: 3, Informative

      Is there a reason why it's called a NOT gate rather than XOR? Is there some quantum wierdness that makes the thing asymmetric and causes A-inverts-B to mean something different to B-inverts-A?

      I guess it's mostly historical, and that XOR is usually associated with a two-input/one-output gate. Controlled-NOT looks pretty intuitive (the target is negated only if the control is 1), but probably XOR is better because A-inverts-B is exactly the same as B-inverts-A (which seems counterintuitive when you think of it as a CNOT, but it's reasonably simple to see that is the case by just looking at the corresponding truth table).

      But I would venture that most people working on trying to build quantum computers would be more familiar with CNOT than XOR in the context of quantum computation (QXOR sounds weird, doesn't it?)

      Pablo B.

    20. Re:A solid milestone... by nahdude812 · · Score: 0

      NOT is only true if A is true and B is false. A not B.

      true NOT true = false
      true NOT false = true
      false NOT true = false
      false NOT false = false

      XOR is true when A and B are different.

      true XOR true = false
      true XOR false = true
      false XOR true = true
      false XOR false = false

      The difference between NOT and XOR is in the false-true comparison. Actually officially (and maybe easier to conceptualize) "A not B" is a short hand of "A and not B," where not is an operator that applies only to B and inverts it. There is more info at the Wikipedia article on logic gates.

    21. Re:A solid milestone... by IWannaBeAnAC · · Score: 1

      You made that up, didn't you? Even the Wikipedia article you mention doesn't say anything about a 2-input gate called 'NOT'. I've never heard of A NOT B as shorthand for A AND (NOT B) before, but I'll forgive you if you can post a link to where that terminology is used. But that gate has nothing to do with XOR, and definitely has nothing to do with the quantum C-NOT gate. The whole point of quantum gates is that they are reversible, of which AND and OR (and there negative-true counterparts) are not.

    22. Re:A solid milestone... by pdbaby · · Score: 2, Funny

      Regex pedantry here, but you're being overly permissive - you allow semantically invalid words: as, ars & arss.

      As a side-note, if you like hearing from your local regex pedant, please remember to donate g(ener|ratuit)ously: we survive only through your funding

      ...it's like I know I should be ticking 'Post Anonymously' but I just can't stop myself

      --
      Global symbol "$deity" requires explicit package name at line 2. - If only $scripture started "use strict;"
    23. Re:A solid milestone... by Dantu · · Score: 2


      We can't do quantum computations by hand, so we have no real experience with the theory, and the underlying statistical methods are relatively recent developments: quantum computers do not use the classical logic that we're all familiar with


      I'm not an expert on Quantum computers, but I think the math/computer science is WAY ahead of the physics on this one. Please correct me if I'm wrong, but I think a Quantum computer is to a normal computer as a NFA is to an DFA (http://en.wikipedia.org/wiki/Nondeterministic_fin ite_state_machine). In this case it's really not a new idea at a fundamental logical level. I realize these only apply to regular languages, not general Turing problems, but that's because you can convert one to the other, so in THEORY they are equivalent anyway. Similarly, conventional computers can solve the same set of problems that quantum computers can solve, they just require an expansion of the problem which in the real world requires much more time and/or space to complete.

      Of course, we don't have (that I know of) nice high-level compilers for them yet, but I think that's a whole different issue.

    24. Re:A solid milestone... by afaik_ianal · · Score: 2, Funny

      you allow semantically invalid words: as, ars & arss.

      No they don't. The only matches are ass, ase, arss and arse, but your point still stands. When being a pedant, it's also polite to provide a correction. The regex they were after is: a(rse|ss).

      ...it's like I know I should be ticking 'Post Anonymously' but I just can't stop myself

      At least tick "No Karma Bonus", please :).
    25. Re:A solid milestone... by afaik_ianal · · Score: 3, Informative

      You're getting confused between the distinction between bits/transistors, and qubits/quantum gates. The difference between tubes and transistors is nothing like the difference between transistors and quantum gates. Bits and qubits are just as dissimilar.

      Like transistors, tubes are just amplifiers. Contrary to popular belief, both are analogue components, but they have quite different responses to changes in current (the graphs are a different shape). Many people consider tube amplifiers to produce better sound quality than transistor amplifiers, and tubes will almost always handle clipping better than transistors. There's actually not much a transistor can do that a vacuum tube can't.

      Either tubes or transistors can be used to implement logic gates. These gates can be built up to store and process bits of information. In the digital world, they are functionally similar. The advantages of tubes from the analogue world go out the window, and the advantages of transistors (size, speed and cost) come into their own.

      Quantum computers are another thing entirely. The computers you and I are using at the moment are deterministic Turing machines. Quantum computers are non-deterministic. Quantum gates deal not in bits, but in qubits. They don't think in terms of binary data, they work with quantum states.

      There are many things that these quantum components can do that conventional transistors cannot, but I don't think we'll be seeing quantum gates implementing binary logic in computers any time soon (if ever). The article unfortunately confuses the issue by making it sound like they've implemented a binary operation. CNOT is not a binary operation - it is a quantum operation.

      I hate analogies as much as the next guy, but if tubes are the horse and cart, and transistors are our cars, then quantum computing is going to be our interstellar space craft - they suck for doing the weekly shopping.

    26. Re:A solid milestone... by Short+Circuit · · Score: 1

      Perhaps quantum computing will speed up regex engines?

    27. Re:A solid milestone... by Short+Circuit · · Score: 1

      There's actually not much a transistor can do that a vacuum tube can't. How about only consume power when its state changes?

      Granted, that's a function of combining MOSFETs, but still not something you can do with a combination of tubes. (Unless I'm very much mistaken...)
    28. Re:A solid milestone... by afaik_ianal · · Score: 1

      Really? I know they can get close, and it's possible to prove that power must be consumed to change state, but I'd love to see a device with no leakage. Gates such as those used in NAND flash devices (dual MOSFETs) get pretty close, but I'm pretty sure even they leak, especially on read operations. I've always seen the "power required to change state" as the lower bound on power consumption, and not something that was being acheived (or ever will be, precisely).

      Still, I take your point. Obviously transistors have much lower power requirements than tubes (I should have listed that along with size, cost, etc - I'm sure there are other advantages I haven't listed, too), but it really is a minor thing. They're still just amplifiers. You can make big, expensive, power-hungry transistors quite easily.

      My point is that quantum computers are not just special transistors with slightly different properties. They really are a completely different thing. You're never going to make an amplifier out of quantum gates, and you're never going to make a quantum computer out of transistors

    29. Re:A solid milestone... by Short+Circuit · · Score: 2, Interesting

      Really? I know they can get close, and it's possible to prove that power must be consumed to change state, but I'd love to see a device with no leakage. Gates such as those used in NAND flash devices (dual MOSFETs) get pretty close, but I'm pretty sure even they leak, especially on read operations. You got me there. I'd forgotten about leakage across the insulating layer due to quantum tunneling. OTOH, a vacuum tube doesn't work well without power to the heating element. Come to think of it, though, one could still get current flow at ambient temperatures; It just wouldn't be nearly as large as when you have a hot cathode.

      My point is that quantum computers are not just special transistors with slightly different properties. They really are a completely different thing. You're never going to make an amplifier out of quantum gates, and you're never going to make a quantum computer out of transistors Point taken and noted. I'm still not very clear on how quantum computing works, but I'm looking forward to reading more discussions like this one in the future.
    30. Re:A solid milestone... by Climate+Shill · · Score: 1

      Regex pedantry here, but you're being overly permissive - you allow semantically invalid words

      Oh a(r()|s())s(\2e|\3)

      :-)

    31. Re:A solid milestone... by tsa · · Score: 3, Funny

      There will be a small market. I think the world needs only 5 or so quantum computers.

      --

      -- Cheers!

    32. Re:A solid milestone... by tbo · · Score: 2, Insightful

      Disclaimer: I am a quantum information scientist.

      If you re-read the article, you'll see that the gate is a controlled-NOT (aka CNOT) gate, rather than a simple NOT gate. CNOT is a two-bit (or, in this case, two-qubit) gate. Simply being able to make and maintain single qubits is challenging (at least, for superconducting systems), manipulating single qubits is more challenging, and performing two-qubit operations is extremely hard. It's worth noting that this result is not the first example of a two-qubit gate in a superconducting system; rather, it appears to be the most complete so far.

      It's also worth noting that quantum CNOT gates were achieved years ago in other physical systems (NMR, ion traps, etc.). Part of the reason people are so excited about this is that, by virtue of it being on a chip, we may be able to apply the enormous amounts of chip-fab technology we already posses to scaling up the system.

    33. Re:A solid milestone... by Cope57 · · Score: 2, Funny

      What is a quantum computer good for, anyway? So far all I've seen is cracking encryption and other stuff involving gigantic calculations. Is there anything in the mainstream market it'd be useful for, like sound/video processing?
      Come to think of it, arithmetic encoding is a bit like encryption... It was probably created to handle the high demands of the Microsoft Vista operating system.
      --
      http://www.accountkiller.com/removal-requested
    34. Re:A solid milestone... by Anonymous Coward · · Score: 0

      Quantum computers are technically a superset of classical computers. Any operations you can do with a classical computer, you can also do with a quantum computer. However, that's a pretty expensive way of doing something we already know how to do. So while in principle one could replace classical computers with quantum computers, the cost of one bit of quantum memory is currently probably more than a billion times that of one bit of classical memory, so it's a difficult choice to justify to your boss. Like you suggest, the scenario I find most likely is having a classical computer with a small quantum coprocessor that's used for specialized tasks.

    35. Re:A solid milestone... by tbo · · Score: 1

      I guess it's mostly historical, and that XOR is usually associated with a two-input/one-output gate. Controlled-NOT looks pretty intuitive (the target is negated only if the control

      Quantum mechanics being unitary and thus reversible, it's important that your gates be reversible, too*. CNOT is two-input, two-output, and is reversible. XOR is two input, one output, and is clearly not reversible (given the output you can't reconstruct the inputs). This is why people use CNOT for quantum computing--XOR wouldn't work.

      *I'm skipping things like cluster state (aka one-way) quantum computation because that just confuses the issue.

    36. Re:A solid milestone... by tbo · · Score: 3, Informative

      I'm not an expert on Quantum computers, but I think the math/computer science is WAY ahead of the physics on this one. Please correct me if I'm wrong, but I think a Quantum computer is to a normal computer as a NFA is to an DFA (http://en.wikipedia.org/wiki/Nondeterministic_fin ite_state_machine). In this case it's really not a new idea at a fundamental logical level.

      I am an expert, and I don't think CS is ahead here; rather, I'd say CS and physics are moving forward in a partnership. As best as we understand the relevant complexity classes, quantum computer are not equivalent to an NFA. To put it another way, as far as we know, quantum computers cannot efficiently solve NP-complete problems. I say "as far as we know" because we don't even know for sure whether classical computers can efficiently solve such problems. Quantum information is a fundamentally new concept to CS, however.

      Similarly, conventional computers can solve the same set of problems that quantum computers can solve, they just require an expansion of the problem which in the real world requires much more time and/or space to complete.

      If you look simply at the domain of solvable computational problems, and don't care about efficiency, then yes, there's no difference. There are, however, communication problems and quantum "games" that cannot be solved with classical information but can be with quantum information.

    37. Re:A solid milestone... by abhorsen666 · · Score: 1

      'In the future, computers will become so large and so powerful that only the 7 richest kings in europe will be able to afford one' Are you sure theres only a small market? At the moment yes, but in the future, you never know

    38. Re:A solid milestone... by master_p · · Score: 1

      Lots of Quantum-C jokes about pointers pointing to NULL and valid objects at the same time are possible here...oh, the horror of debugging a Quantum-C program!!!

    39. Re:A solid milestone... by Stefanwulf · · Score: 2, Funny

      Or you could store the superposition of all possible recipes simultaneously. It would simply decohere into the one you wanted once you began cooking.

      The trick is going to be figuring out the right first interaction to generate the recipe you're searching for.

    40. Re:A solid milestone... by nahdude812 · · Score: 1
      If you take a few moments, you'll observe two things. Allow me to quote myself:

      Actually officially (and maybe easier to conceptualize) "A not B" is a short hand of "A and not B," where not is an operator that applies only to B and inverts it.
      Now allow me to quote the Wikipedia article:

      INPUT
      A 0 0 1 1
      B 0 1 0 1 ...
      NOT B 1 0 1 0 ...
      NOT A 1 1 0 0
      So you'll see how I already qualified that there is no official two-input NOT operator, it's actually a one-input operator commonly coupled with the two-input AND operator since at least in my experience this is one of the most common uses of NOT. As way of supporting that, A and not B turns off whatever bits in A are turned on in B, so when for example you have a constant USER_PERMISSION_SOMETHING which is a bit mask, and you want to turn this permission off on the permissions field for some user, only if they have it, and also preserve other permission bits, you'll execute $user->privileges = $user->priveleges & ~USER_PERMISSION_SOMETHING. You'll also notice that I described that it's common (I don't have a citation on this, but at least among me, my coworkers, and my professor of logic in college this is the case) to use a short-hand reference as if there were a two-input operator which actually performs AND NOT.
    41. Re:A solid milestone... by david_g17 · · Score: 1

      What is a quantum computer good for, anyway? So far all I've seen is cracking encryption and other stuff involving gigantic calculations. Is there anything in the mainstream market it'd be useful for, like sound/video processing?


      <insert random vista joke>
    42. Re:A solid milestone... by pablob · · Score: 1

      I know, but you could say that a CNOT is an "augmented-XOR" (to give it a name). Classically, if you just copy one of the inputs as one output and then XOR the inputs as the other you have the most analogous classical gate to CNOT (in fact, the truth tables are identical, the only difference is that the CNOT takes superpositions). So it could be argued that CNOT could be more like a quantum two-input XOR gate than a quantum NOT gate. But I think CNOT is already established as a name...

      Pablo B.

    43. Re:A solid milestone... by vertinox · · Score: 1

      This is a massive setback compared to the development of the electronic computer - and advances in theory usually can't be accelerated all that much. It is likely to be between 50 and 100 years before we know enough to build non-trivial applications out of quantum computers. Not because we can't build the hardware, but because we don't know how to write any software to run on them.

      Technically it was only 40 years before the theory of relativity and the creation of its application in nuclear reactions.

      Of course it took a World War to cause the financing to happen, but sometimes just because we don't know about the things we don't know (as opposed to knowing the theory but not knowing the application) doesn't mean we will simply won't be able to create the application until we have the exact theory work down.

      Also I would like to point out that accelerating returns also is more advanced now it was 60 years ago. Now scientists have more tools to work with now than people in the 1940s had and that helps things along.

      Not to mention health care and basic needs are far more adequate these days and the fact we have more scientists and engineers today employed than we have had at any other time in our history usually speeds these things increasingly along.

      --
      "I am the king of the Romans, and am superior to rules of grammar!"
      -Sigismund, Holy Roman Emperor (1368-1437)
    44. Re:A solid milestone... by aldousd666 · · Score: 1

      (it'll be a computer in a lab, not a PC)

      Isn't that a little short-sighted of you? Who's going to have PC's in 20 years anyway? I seem to recall adverts from the 60's (from archives only I wasn't born until '80) that say something like "eventually Computers will be small enough to fit into a single room."

      --
      Speak for yourself.
    45. Re:A solid milestone... by inviolet · · Score: 1

      Controlled-Not is not Not. Controlled-Not is "if the control line is 1, then not the input, else preserve the input", i.e. XOR. (But being quantum, it must also output the control line too, so that the operation can be reversed.)

      It's not an XOR. CNOT differs from XOR in the following case: input 0, control 1.

      --
      FATMOUSE + YOU = FATMOUSE
    46. Re:A solid milestone... by fatphil · · Score: 1

      So, what's the difference in the output in that case?

      XOR: input 0 control 1 -> output 1
      CNOT: input 0 control 1 -> output 1 (and control 1)

      1 looks remarkably similar to 1 to me. Maybe my brain's just not quantum enough.

      --
      Also FatPhil on SoylentNews, id 863
    47. Re:A solid milestone... by Anonymous Coward · · Score: 0

      640 qubits should be enough for anybody.

    48. Re:A solid milestone... by IWannaBeAnAC · · Score: 1

      There is a fundamental difference though. The classical 'equivalent' of a C-NOT is indeed just an XOR gate where one of the inputs is duplicated as the second output line. This follows a common tool in classical circuits, where one output line can drive a large number of different inputs. You never need a two-output gate in a classical circuit because you could always produce the same effect by having two one-output gates and copying the inputs to each gate.

      But in a quantum circuit, there is a fundamental theorem that says you cannot do this - the no cloning theorem. This means that you cannot construct a C-NOT gate out of some quantum version of an XOR and a copy of one of the inputs, as neither of these operations exist. It must be done as a single two-input two-output gate.

      The C-NOT name is justified because you can increase the number of control lines. Eg, the C-C-NOT gate, which acts similarly to a 2-bit adder.

  3. Only a NOT gate? by Anonymous Coward · · Score: 0

    Is this newsworthy? Wait until they can make a full adder, on a chip. Then I'll be impressed.

    1. Re:Only a NOT gate? by BattleApple · · Score: 1

      One NOT gate ought to be enough for anyone.

  4. Like in Borat? by SilentOneNCW · · Score: 2, Funny

    Not Jokes:

    It's a Quantum Gate.... NOT!

    1. Re:Like in Borat? by AngryBacon · · Score: 1

      It a NOT Quantum Gate, would be more accurate. :D

    2. Re:Like in Borat? by mattcoz · · Score: 1

      Maybe I'm getting old, but I'll always associate not jokes with Wayne's World, not Borat.

    3. Re:Like in Borat? by maxwell+demon · · Score: 1

      Well, as long as it's not quantum Gates ... :-)

      --
      The Tao of math: The numbers you can count are not the real numbers.
  5. Fuzzy qubits of unknown distinction? by DanTheManMS · · Score: 1

    Sound a lot like Tribbles to me.

    1. Re:Fuzzy qubits of unknown distinction? by Joebert · · Score: 2, Funny

      Tribbles & Qubits: The new Pacman

      --
      Wanna fight ? Bend over, stick your head up your ass, and fight for air.
    2. Re:Fuzzy qubits of unknown distinction? by HeronBlademaster · · Score: 1

      Sounds more like the new pet food to me (Kibbles & Bits)...

      No, I don't have a pet.

  6. They say that it works by zmollusc · · Score: 4, Funny

    but how can they test it when the output is always either 0, meh, pfft or 1?

    --
    They whose government reduces their essential liberties for temporary security, receive neither liberty nor security.
    1. Re:They say that it works by Joebert · · Score: 2, Funny

      That's why they built a NOT gate, even if they failed, they'd still succeed.

      --
      Wanna fight ? Bend over, stick your head up your ass, and fight for air.
    2. Re:They say that it works by fatphil · · Score: 1

      Because you can chose the basis in which you are going to perform the measurement to determine the answer, you can either measure along the 0-pfft axis, or the meh-1 axis. That simplifies things greatly.

      --
      Also FatPhil on SoylentNews, id 863
    3. Re:They say that it works by Torvaun · · Score: 1

      If a qubit is both 0 and 1 at the same time, what the hell does an inverter do? Make it 1 and 0 at the same time instead?

      --
      I see your informative link, and raise you a pithy comment.
    4. Re:They say that it works by Your.Master · · Score: 1

      Brings it from 0 and 1 at the same time to 1 and 0 at the same time.

    5. Re:They say that it works by maxwell+demon · · Score: 1

      If a qubit is both 0 and 1 at the same time, what the hell does an inverter do? Make it 1 and 0 at the same time instead?

      Yes. If it consists of "the same amount" 0 and 1, then it will simply not change. That's called an eigenstate of the operator. However, you might be in a superposition of 0 and 1 where you have a bit more 0 than 1, and then you'll get something which is a bit more 1 than 0.
      Actually, it's still a bit more complicated than that. There are many ways to have a state which is 0 and 1 at the same time, and in most cases, the not gate will change one such state int another one.

      Actually the easiest way to understand a single qubit is to look at the so-called bloch sphere. If you take a sphere (i.e. the surface of a ball), then the states 0 and 1 are on opposite ends of the sphere, say the south pole and the north pole. Then every single point on the sphere represents a state of the qubit. The equator represents those states which are 0 and 1 to the same amount, the northern hemisphere contains all states which are more 1 than 0, and the southern hemisphere contains all the states which are more 0 than 1. Now a not operation means turning the sphere around an axis through the equator by 180 degrees. This obviously moves the south pole to the north pole, and vice versa (i.e. 0 gets 1, and 1 gets 0, so it's obviously a not gate). Anything on the equator (i.e. anything which is "half 0 and half 1") gets back to the equator; however except for the two points on the turning axis (the eigenstates of the operation), every point ends up at a different place on the equator.

      Now if you measure the qubit, you only get a 0 or 1 (you can in principle also measure along other axes, but since you can get any axis onto the north-south axis by simply rotating the sphere, it suffices to look at the one axis). If the state is the 1 state (the north pole), you are sure to get an 1, and if it's the 0 state (the south pole), you are sure to get a 0. For other states, you may get either 0 or 1 (in that sense they are both 0 and 1 at the same time), but the probability of getting 1 is the higher, the more northern you are. At the equator you are half way between south pole and north pole, so you get 0 and 1 with equal probability. In the southern hemisphere, you're more likely to get 0 as result, and on the northern hemisphere, you're more likely to get 1 as a result.
      --
      The Tao of math: The numbers you can count are not the real numbers.
    6. Re:They say that it works by mr_mischief · · Score: 1

      That sounds a lot like a fuzzy value, only stored in a single qubit instead of as a floating-point representation of possibility.

      Fuzzy logic is, after all, all about multi-state truth values and proportions of truth. So given your description, it sounds like with this gate what can be done is to (eventually, of course) create a non-deterministic fuzzy application platform with very high speed and very small storage requirements.

      Is that in the right stall, conceptually, or am I missing the barn?

    7. Re:They say that it works by maxwell+demon · · Score: 1

      Well, you are missing the barn, but that's not really your fault. After all, the power of quantum computing doesn't come from the properties of one qubit (which is what I described above), but from the behaviour of several of them (of course understanding one of them is a key ingredient of understanding several; however other than with classical bits, it's not sufficient). The magic thing which happens there (and which simply doesn't exist in a single qubit) is something called entanglement. It's entanglement which makes quantum computers special. And it's exactly the controlled not gate which creates entanglement (well, there are of course other ways to create entanglement, but CNOT is the method of choice in quantum computing). The problem with entanglement is, however, that it cannot be such easily depicted as the behaviour of a single qubit. Let me try anyway:

      First, let's look at what a COT does on classical bits. There's one control bit, and one target bit. If the control bit is 1, then the target bit is flipped (i.e. a NOT operation is done on it), and if the control bit is 0, the target bit is left unchanged (that's why it is called controlled not: The control bit controls if a "not" operation is applied on the target bit, or if it is not applied).

      Ok, now what if we replace the classical bits with quantum bits? Replacing the target bit is trivial: As explained above, a NOT is just a 180 degree rotation around an axis through the equator. However what about replacing the control bit? Now, let's look at the behaviour which results:

      First the obvious cases: If the control qubit is exactly 1 (i.e. at the north pole), the target qubit is simply rotated. On the other hand, if the control qubit is exactly 0 (i.e. at the south pole), the target bit is left alone. This is nothing but the straightforward translation of the classical behaviour.

      But what happens if the control qubit is in a superposition of 0 and 1 (i.e. somewhere else on the sphere)? Note that we don't want to do a measurement during the process (otherwise it would be simple: Measuring the control qubit gives a definite 0 or 1, and then we could apply the corresponding transformation). On the other hand, if we measure the control qubit after applying the CNOT, we still find that the target qubit has rotated exactly if we measure an 1. But remember that it's completely unpredictable if we will measure 0 or 1, thus we cannot predict if the target qubit was rotated or not. That is, the target qubit is in some sense rotated and unrotated at the same time! However, if looked at in isolation, the target qubit cannot be distinguished from the one we would have gotten by just measuring the control qubit, applying or not applying the rotation depending on the result, and then simply forgetting the measurement result. However, one can distinguish both cases if one can measure both qubits: You can measure the control qubit along another axis (or equivalently, rotate it before measuring it), and you'll get (at least statistically) different results in both cases. Indeed, if you look at it from the rotation axis, but in both qubits, you'll even find that the roles of the control and target qubit are reversed, i.e. if the target qubit happens to be in one of the two eigenstates of the rotation, the control qubit is rotated around the z axis, and for the other eigenstate it's not changed. This shows that the CNOT operation really affects not only the "target" qubit, but also the "control" qubit. Of course for a pure 0 or 1 state of the control qubit, this rotation doesn't have any effect, because those states are exactly the eigenstates of the z-axis rotation.

      Now where do those "both-rotated-and-not-rotated" states lie on the bloch sphere? Well, if you look at the single qubit in isolation, you can describe its state by some point inside the sphere, but that's not the whole picture (indeed, being in the inside always tells you that there

      --
      The Tao of math: The numbers you can count are not the real numbers.
    8. Re:They say that it works by mr_mischief · · Score: 1

      Thanks for the explanation. I'm aware that entanglement means that changing the state of one causes a corresponding change in the other, and that that's a primary strength of quantum computers.

      What I'm really wanting to know though, is not how it's done, but how it's to be used.

      In current fuzzy systems, it's simple enough to have something that's neither 1 nor 0 until your collapse the value. It's even easy enough to not collapse a value and to do things to a certain degree when that makes sense. That's what fuzzy is all about. It's all multi-state logic and that makes certain kinds of programming really much easier to make accurate than using binary logic. Now, the big drawback here is that in a classical fuzzy system, there are many checks to be made and many adjustments to be made to a value before it's in its required state to make a decision.

      If there was a multiply entangled system measuring multiple inputs simultaneously, and one could collapse all that input into one or a couple of outputs immediately instead of serially applying adjustments to a value then one could use these qubits as a fuzzy system that operates essentially instantaneously compared to the serial progression through revaluation cycles needed in fuzzy systems of today. This would make many types of process control and even AI perform much faster, and that would be a wonderful application of the technology. I'm not nearly so interested in quantum cryptography and blind searches day-to-day as I am in, say, seeing multiply redundant, fuzzy-based control systems working suitably fast to handle obstacle avoidance and balance maintenance in off-road vehicles.

    9. Re:They say that it works by maxwell+demon · · Score: 1

      I was long puzzled about those "fuzzy systems" you mentioned, but finally I think you are speaking about fuzzy logic, right? If so, quantum computing isn't like that. In fuzzy logic (as far as I understand it), your final result is always the one with the most weight. That is, if you get a fuzzy value of 99% for "do it", the algorithm will finally say "do it". However, a qubit in a state with 99% "1" and 1% "0" may still give "0" when measured. You still can get the "wrong" result, it just gets less likely (but then, it gets "even more wrong").

      However the power of quantum computing comes from a different angle anyway. A classic example of quantum parallelism is the problem of checking if a one-bit function is constant (i.e. if f(0)=f(1)). A classical computer would need two evaluations of the function to test this: You call f once with 0, and then again with 1, and compare the results. A quantum computer can test it with only one evaluation of f. A quantum implementation of f would give the output by flipping some other qubit (because all quantum computing has to be reversible, you cannot simply replace the input bit with the new value). Basically you prepare both the input qubit of f and the output qubit in a certain "equatorial" state. Now you run the calculation, and finally you read the input qubit to get your result, while the output qubit isn't changed. Now this sounds like magic, but it indeed works. It's easy to do the math, but unfortunately I (again) cannot offer you an image of it.

      --
      The Tao of math: The numbers you can count are not the real numbers.
    10. Re:They say that it works by mr_mischief · · Score: 1

      What you're describing with your 99% "do it" and 1% "don't do it" is a fuzzy-to-discrete system. It has a fuzzy logic aspect to it, but the output is being converted into a discrete binary action.

      Those do exist. There's another type, though, that is a fully fuzzy system. A canonical example is a thermostat.

      Instead of 99% "do it" vs 1% "don't do it" as to turning on a furnace to raise a temperature (a fuzzy to discrete system), a variable valve could be used to turn the fuel flow on to 99%, or to 3%, or 57%.

      A third type is a fuzzy random system, in which you adjust your somewhere between 0.01 and 1, then randomize a number between 0 and 1 and then make a discrete output based on whether the fuzzy value and the random number are in agreement. The fuzzy value is kind of like a cut-off in this case, where if the fuzzy value is 93%, then anything randomized as 0.93 or less triggers an "on" state and anything randomized as 0.94 to 1.0 triggers an "off" state.

      Now, there's obviously a bunch of neat stuff in quantum computing besides the point I'm wanting clarified, and I do thank you again for pointing those things out. I still have an intuitive feeling that the second and third types of fuzzy system I've listed above can be realized more quickly in a quantum system than with the fuzzy values being stored as floating point values in a classical binary system. I'm just not sure we're reaching one another, and much of that is probably my limited knowledge of the quantum computing topic. Anyway, thanks so much for the conversation although we've been mostly talking past one another. It can be fun to try to hash these things out, even when we fail.

  7. Quantum states by arashi+no+garou · · Score: 4, Interesting

    I'm no quantum theory expert by a very long shot, but it was my understanding that there are 32 quantum states of electrons, not just on/off (1/0) like in the binary computer world. So, if we now have a quantum NOT gate, doesn't that mean there are 32 possible states of the NOT gate? Also, according to the article the CNOT gates they created can be both 0 and 1 simultaneously. In my mind this would cause errors and actually stop the flow of information instead of speeding it up.

    Someone with some understanding of this stuff please elaborate, before my head asplodes.

    1. Re:Quantum states by LighterShadeOfBlack · · Score: 4, Funny

      but it was my understanding that there are 32 quantum states of electrons, not just on/off (1/0) like in the binary computer world. So, if we now have a quantum NOT gate, doesn't that mean there are 32 possible states of the NOT gate? Well, yes and no...

      *ba-dum-tsch* Thank you very much, I'll be here all week.
      --
      Spelling mistakes, grammatical errors, and stupid comments are intentional.
    2. Re:Quantum states by Anonymous Coward · · Score: 0

      That doesn't mean we have 32 NOTs. Think about it, we have a new 32-digit format just like bin, hex and dec on your calculator.

      btw Bill Gates has way more states than that

    3. Re:Quantum states by QuantumG · · Score: 0, Troll

      I'm no quantum theory expert by a very long shot No shit.

      Do some research.

      --
      How we know is more important than what we know.
    4. Re:Quantum states by pablob · · Score: 4, Informative

      32? They should be 42!

      More seriously, a qubit (short for "quantum bit") has two well defined states, 0 and 1 (|0> and |1> for those QM buffs) just as a regular (classical) bit. The difference is that the classical bit has to be in either 0 or 1, while the qubit can be in what is called a "superposition" of those. So you could have a qubit in the 0 state, or in the 1 state, or in the "x% 1 and y% 0" state (where x+y=100). Part of the magic of quantum computers comes from this fact: using the proper operations, you can feed your quantum computer a register which is set up to "all possible inputs" so that it applies the algorithm to all possible values. Some people call this "Massive parallelism". You have to be careful, because Quantum Mechanics does not allow to extract the result of all those calculations (that would be great), so you have to go through some tricks to get useful information out of that "parallel processing".

      I hope this helped some!

      Pablo B.

    5. Re:Quantum states by asuffield · · Score: 1

      it was my understanding that there are 32 quantum states of electrons


      That is almost, but not quite, entirely unrelated to quantum computing (it's got something to do with quantum physics, that's about where the relationship ends - I think it's about the chemistry of atoms). I don't believe it's true except under specific circumstances, anyway.

      So, if we now have a quantum NOT gate, doesn't that mean there are 32 possible states of the NOT gate?


      Quantum computers operate on qubits, which take on any state along a continuous probability line between 0 and 1 - you can think of it as a floating point number with an arbitrary degree of precision. As such, there are as many possible states as there are real numbers; this quantity is both infinite and uncountable. The actual math operates on the complex plane, but for the purposes of considering the number of possible states, it's equivalent to this description using the real numbers (if I've remembered my transfinite theory correctly - it's been a few years - but it's definitely infinite and uncountable).

      Actual quantum computers are likely to have fixed finite limits on their precision, but we're not really far enough along to be sure how that will work out yet. There are a number of competing theories on the subject.
    6. Re:Quantum states by mindriot · · Score: 5, Informative

      Note: I am not a physicist, this is just what I remember from a quantum computing lecture I attended years ago. Of course, rather than believing 100% in what I wrote, you're probably better off double-checking on Wikipedia and Google...

      The quantum states you're referring to do have something to do with this. However, their number isn't what's important.
      The interesting thing about the quantum computing world is that such states can be in superposition, that is, it is unclear whether or not the state is one or the other. You can only know that if you measure the state, the outcome will be state A in, say, 30% of the time, and state B in 70%. Now, you could probably extend this to 32 different states, but since we're used to bits, we'll build something where we just use two (for instance linearly polarized photons -- 0 degrees = 0, 90 degrees = 1).

      Now, there exist methods (or they're being researched) that allow you to put your bit into a superposition of its states. This could, for instance, be so that measuring the state will produce a 0 exactly half the time. Maybe you could put your Schroedinger cat in the box -- dead=0, alive=1...

      This by itself is not particularly exciting. But you could do that for multiple bits (say a 32-qubit word) so that measuring it, you get uniform probability to measure any number between 0 and 4294967295. Where it really gets interesting is when you apply quantum operators to your state: They can transform the state without destroying the superposition, i.e. without measuring it. For instance, if your superposition currently gives you 30% chance for measuring a 0 and 70% for a 1, then a CNOT gate would reverse that probability.

      Note, however, that a CNOT is a "controlled not": it has two inputs, the control and the target. The control passes through unchanged, but the target is flipped if and only if the control is 1 (i.e. the target output value is identical to the XOR of the input values). In a quantum world, this lets the two bits be entangled: For instance, if the target bit is 1, then the output of the target is 1 iff the control is 0 (target = NOT control). Now suppose that we create a superposition on the control input -- then the control output will be that same superposition, but the target output will be (NOT control) for all control values. In other words, we've just computed a function for all possible input values at once. And you can build these things larger, to do more useful things, such as with a 32-qubit input.

      The problem is, you thus get all possible results at the same time, but it's a superposition, and after measuring, you'll only have one result. Why is this useful? Because for one, you can construct some algorithms that transform the problem in such a way as to give a guaranteed result; in other cases, you'll do multiple samples and after a while you'll get your result -- and for some problems, you'll get it orders of magnitude quicker, on average, than on classical computers.

      For instance, the Deutsch-Josza algorithm is such an example. Assume I have a function that does one of two things -- it is either constant over the whole input domain, or it is balanced, that is, it returns 0 for exactly half the possible inputs and 1 for the other half. The function, to you, is a black box. How do you determine quickly whether the function is constant or balanced? On a classical computer, you have to test one more than half the inputs, in the worst case, to find out whether the function is balanced or constant. Using the Deutsch-Josza algorithm, you can solve the problem in *constant* time on a quantum computer.

      In other words, quantum computing may be interesting for some number-crunching applications. Of course the true capabilities of such a system are not yet completely understood. But I would think that for desktop computing it's probably not too relevant...

    7. Re:Quantum states by arashi+no+garou · · Score: 1

      Wow, how very snarky of you! You could have done like the other three people here and kindly explained to me that there is a vast difference between what I had in my head (quantum physics) and quantum computing. But no, you had to show your obvious superior wit and intelligence by saying the infinitely wise "no shit".

      Oh, wait, you posted a link to wikipedia. Perchance, that is the limit of your knowledge on the subject as well then?

    8. Re:Quantum states by QuantumG · · Score: 1

      What if it is? It's more than you bothered to lookup before posting.

      --
      How we know is more important than what we know.
    9. Re:Quantum states by CaspianXI · · Score: 1

      I'm an undergraduate physics student assisting a professor in research in quantum mechanics. Although I've only touched quantum computing slightly in my research, I'd like to confirm that much of what mindriot said makes sense according to quantum mechanics as I understand it (I say "as I understand it" because the great Dr. Feynman once said that "no one understands quantum mechanics").

      One point I'd like to mention -- the qubit is in both states A and B simultaneously, as far as we can tell. Measuring the qubit to be in state A 30% of the time does not indicate that is actually in that state 30% of the time -- rather, the act of measuring it tends to force it into state A 30% of the time.

      Quantum mechanics involves incredibly tiny particles that are easily interrupted because even our most delicate instruments will greatly interrupt the particles we're trying to measure. If this doesn't make sense, imagine that you're sitting in front of a table in a dark room -- there's a marble spinning on the table, and you need to determine which direction it's spinning using a ping-pong ball. You roll the ping-pong ball toward the marble, which diverts the direction of the ping-pong ball, which rolls off and hits a sensor. Now knowing the position of the ping-pong ball, you calculate how its path was diverted by the marble, giving you the direction in which the marble was spinning.

      BUT -- the ping-pong ball also hit the marble, which may have pushed the marble off in some direction. This may have made the marble stop spinning altogether, or the marble may now be rolling in some direction instead of spinning.

      With qubits, which often assume states "spin up", "spin down", etc., we have the same problem in measuring them. If you don't see the problem in this, imagine if the act of opening a file on your computer altered its contents. Qubits will probably be used more in memory than disk space... but still, if you place a value in memory, you don't want it to change when it comes time to retrieve it.

      Quantum computing involves a very delicate balance between how much information we want to "see" in the system and how to leave it alone. Once again, my research is only tangentially related to quantum computing, so I can't answer the question of how they've solved this dilemma (or if it's been solved), but I find it interesting nevertheless.

    10. Re:Quantum states by Anonymous Coward · · Score: 0

      Damn, you remember all that from a physics class years ago? I can't remember anything from my physics class last week!

  8. Cracking by z-man · · Score: 4, Informative

    In theory, quantum computers would allow hackers to crack today's toughest coded messages.

    That's an overstatement. A quantum computer will not suddendly magically crack the strongest codes. Yes, certain algorithms designed for quantum computers, like Grover's algorithm, will reduce the time needed to find the key of a symmetrical cipher with about half the number of bits in the key. However, given for example a 256-bit key you would still have ~2^128 keys to check and afaik 2^128 still takes quite sometime to crack....

    1. Re:Cracking by z-man · · Score: 1

      Note, my above post is about symmetric cryptography, not asymmetric cryptography. When it comes to asymmetric (public key) cryptography, which relies on computationally difficult problems such as prime factoring, quantum computing has a lot more potential. Factoring a prime number in O(log n^3) (Shor's algorithm) is an enormous improvement and would be devastating for traditional public key cryptography. Of course, we'd still have quantum cryptography.

    2. Re:Cracking by frieko · · Score: 1

      IANACSOQP but aren't all NP-complete problems essentially equivalent at some fundamental level? So if QC can do one NP-complete problem in P time, it can do all NP problems in P time?

    3. Re:Cracking by Anonymous Coward · · Score: 0

      All NP-complete problems are equivalent in that a puzzle for one can be transformed into one for the other in polynomial time; that's what makes them NP-complete. So yes, if the QC can do one problem, it can do them all, but it's not likely that the QC can do so. For the QC to solve NP-complete problems, either P==NP or the probabilistic variant (don't remember its name) == BQP, both of which are considered to be unlikely.

      There's Grover's algorithm, but that doesn't do you any good if the conditions above are false. If they are, then an NP-complete problem must have a worst case superpolynomial time complexity, and since Grover only reduces it by the square root, it isn't enough to bring NP over to P.

      (Also, if someone manages to make a Kieu-type hypercomputer or a "QC" that uses quantum gravity to solve PSPACE-complete problems, then the above is moot; but such a QC wouldn't be the same kind of quantum computer as is described here.)

    4. Re:Cracking by Anonymous Coward · · Score: 0

      Ok, so we just build a quantum-buster-buster?

      Hey, it worked for the trace-buster in The Big Hit ;-)

    5. Re:Cracking by fatphil · · Score: 1

      For values of "essentially equivalent" equal to "can be reformulated into, and the result therefrom converted back, in polynomial time", yes.

      Note that factoring is not known to be, and suspected (by gut feel only) to not be, NP complete.

      --
      Also FatPhil on SoylentNews, id 863
    6. Re:Cracking by Anonymous Coward · · Score: 0

      Or Lamport signatures, at least for digital signatures. There's a cryptosystem based on the same idea, but I can't find its name.

  9. Quantum gates? by Mikachu · · Score: 5, Funny

    They're opening the quantum gates now? They're insane! Who knows what might pour out of them... I hope they're at least doing it on the moon.

    The future of the human race is up to one lone marine now. Thanks a lot, scientists.

    1. Re:Quantum gates? by Anonymous Coward · · Score: 1, Insightful

      Wrong, get Gordan Freeman to throw the switch, no amount of Marines are gonna be enough.

  10. In 20 (50?) years... by Anonymous Coward · · Score: 1, Funny

    Dude you're getting a Delft!

    1. Re:In 20 (50?) years... by Anonymous Coward · · Score: 0

      I'd rather have the original Chinese, no offense.

  11. I fear for the programmer's sanity by Keichann · · Score: 1

    Can anyone remember the name of that assembler that only had the 'not' operator? Maybe it's time for a port :)

    1. Re:I fear for the programmer's sanity by fatphil · · Score: 1

      There was the OISC, is that what you're thinking of?
      I think its only operation was something like subtract A from B, and if negative jump to C.
      However, google will probably do better than my addled memory.

      --
      Also FatPhil on SoylentNews, id 863
  12. Six of one, half a dozen of the other? by nick_davison · · Score: 0, Redundant

    ...the first Controlled-NOT quantum gate... a quantum computer would achieve new levels of power by turning bits into fuzzy quantum things called qubits (pronounced cue-bits) that are 0 and 1 simultaneously. 0 and 1 simultaneously, through a NOT gate... becomes 1 and 0 simultaneously? Sounds useful. ;)
  13. A long way off yet! by Chemisor · · Score: 1

    > the result may pave the way for devices of double the size in the next year or two

    Well, at the current rate of progress, we might see a Quantum Pentium III in about 26-52 years, depending on whether its "next year" or "two". I might be dead of old age by then.

    1. Re:A long way off yet! by Anonymous Coward · · Score: 0

      Who's to say the number of qubits on a chip doesn't *square* every 18 months?

    2. Re:A long way off yet! by poopdeville · · Score: 1

      Let's hope not. We're still stuck at 1.

      --
      After all, I am strangely colored.
    3. Re:A long way off yet! by Anonymous Coward · · Score: 0

      "Well, at the current rate of progress, we might see a Quantum Pentium III in about 26-52 years, depending on whether its "next year" or "two". I might be dead of old age by then."

      This is now merely academic research with hardly any corporations behind it. Imagine IBM, Intel and AMD putting a lot of manpower on this research instead of working on POWER and x86(-64). Or even way more universities. At some moment, big business catches up where academics left the stick.

  14. Used for what? by symbolset · · Score: 3, Funny

    At home you will use these for ever more sophisticated rendering of artificially intelligent virtual reality porn.

    At work it will be more useful in the advanced simulation of a mechanical process for imprinting letter glyphs on sheets of wood fiber.

    --
    Help stamp out iliturcy.
  15. Hans Mooij of the Delft University of Technology? by jddj · · Score: 1, Redundant

    "Mooij you're gettin' a Delft!"

  16. oblig.. by hldn · · Score: 0, Redundant

    but does it run linux?

    --
    http://www.accountkiller.com/removal-requested
  17. GateChip One by Anonymous Coward · · Score: 0

    It's a gate, on a chip.

  18. Inversed qubit? by Lobais · · Score: 2, Interesting

    If a qubit is both 0 and 1 at the same time, what is the point of inversing it? Would it then be 1 and 0 at the same time?

    1. Re:Inversed qubit? by Anonymous Coward · · Score: 0

      Maybe we'll be able to settle the 2+2=5 thing after all!

    2. Re:Inversed qubit? by Anonymous Coward · · Score: 0

      Some qubits are more 0 than 1. The inversion then turns them into qubits that are more 1 than 0 (by the same probability).

      Very roughly speaking.

    3. Re:Inversed qubit? by bh_doc · · Score: 2, Informative

      Absolutely correct. The way it's written in the text is a bit misleading. A qubit can be 0, 1, or some proportion of 0 and 1. It's like a continuum between 0 and 1, and a qubit can take any place along that continuum.

      The tricky thing is, quantum mechanics won't let you measure anything other one of two values (not strictly true, but go with me on this). But those values don't necessarily have to be 0 and 1, just so long as they are orthogonal to each other.

      Okay, to understand that last bit you need to bring in the fact that the proportions of 0 and 1, x and y say, can actually be any complex number, positive, negative, imaginary, whatever, just so long as their magnitudes-squared add to 1. So, then, instead of measuring for the 0 and 1 states, you could measure for "0.5" and "-0.5" states.

      This isn't even getting to the confusion of putting these things into gates.

  19. Qubits? by Anonymous Coward · · Score: 0

    I've never really understand why they started calling them qubits.

    A 'bit' is simply shorthand for "binary digit". Quantum digits, however, aren't binary, since they can represent much more than a simple 0 or 1. By adding the 'Qu-' to the term, we are essentially calling them "Quantum Binary Digits," which is in itself an oxymoron.

    I understand that it's just supposed to be a nickname, but I think if we have the power to make up words to represent these "fuzzy" quantum digits, that "quigit" (like 'widget' with a K tacked on front) would be both more accurate and more fun to say.

    1. Re:Qubits? by gardyloo · · Score: 1

      I think if we have the power to make up words to represent these "fuzzy" quantum digits, that "quigit" (like 'widget' with a K tacked on front) would be both more accurate and more fun to say. Perhaps. But then all the Gnome people would insist on calling them "gwidgets" and the only real winners would be the xfce users....
    2. Re:Qubits? by afaik_ianal · · Score: 1

      Quantum digits, however, aren't binary, since they can represent much more than a simple 0 or 1.

      Qubits represent a probability of being a 0 or 1. Observing a qubit destroys that probability, and you "read" only a zero or a one. You don't actually know what the probability was of reading that value, only what the value was at the moment you read it (and you can't read it again - by reading it, you've destroyed the state).

    3. Re:Qubits? by tbo · · Score: 2, Insightful

      Disclaimer: I am a quantum information scientist

      Qubits represent a probability of being a 0 or 1. Observing a qubit destroys that probability, and you "read" only a zero or a one.

      This is at best an incomplete description of what happens. Qubits are quantum states, not probabilities. Quantum states are sometimes called "probability amplitudes", in that taking the square of the magnitude of the coefficient for a particular basis state gives you the probability of getting that state if you measure in that basis. There are a few very important points: (1) we're dealing with complex numbers, and things work in such a way as to give us the possibility of "interference" of probability amplitudes; (2) quantum states are real states, not just probabilities representing our ignorance of which classical state you'll find when you measure.

      A brief intro to the math:

      Let's take some qubit in some arbitrary state, which we'll call | psi > (I'm using Dirac notation). We can completely describe the state as follows:
      | psi > = a | 0 > + b | 1 >,
      where a and b are complex numbers, and have the property that |a|^2+ |b|^2 = 1. We see that we have an uncountably infinite number of possible states for just a single qubit. If psi were a classical bit instead of a quantum bit, we could use essentially the same description, except that the requirement on a and b would then be that exactly one of them is 1, while the other is 0 (only two possible states). If psi were a "classical" analog "bit" or a probabilistic bit, the requirement would be that a, b in [0,1], and a+b=1.

      What happens if we measure psi? It depends on the basis we choose to measure in, but if we go to measure psi in the {| 0 >, | 1 >} basis, we'll get | 0 > with probability |a|^2, and | 1 > with probability |b|^2. Figuring out probabilities for other bases requires only a basis transformation (simple linear algebra).

      Now, this qubit business seems horribly messy--we have an infinite number of states for a single qubit--how can we possibly describe the action of a two-qubit gate like controlled-NOT (CNOT)? Fortunately, quantum mechanics is linear, which means that if we describe how a gate operates on each of the possible input basis states, we've completely specified the gate. For two qubits, we can use the following basis: {| 00 >, | 01 >, | 10 >, | 11 >}. Labeling the rows and columns in that order, we get the following truth table for the CNOT gate:

      1 0 0 0
      0 1 0 0
      0 0 0 1
      0 0 1 0

      In other words, if the first bit is 0, do nothing to the second bit. If the first bit is 1, flip the second bit.

      It turns out that CNOT plus a bunch of different single qubit gates is universal, meaning you can use that set of gates to implement any "quantum circuit".

    4. Re:Qubits? by tbo · · Score: 1

      A 'bit' is simply shorthand for "binary digit". Quantum digits, however, aren't binary, since they can represent much more than a simple 0 or 1. By adding the 'Qu-' to the term, we are essentially calling them "Quantum Binary Digits," which is in itself an oxymoron.

      Qubits are quantum bits in the sense that there are two basis states (often | 0 > and | 1 >). In some systems, qutrits (quantum trinary digits) are more natural, and occasionally, you'll hear "qudit", which is a d-level quantum digit, for some arbitrary d.

      Given how often I have to say or hear the word "qubit", I guarantee it wouldn't be more fun if it had an extra syllable.

    5. Re:Qubits? by fbjon · · Score: 1

      After trying to wrap my head around the physics here, I feel like I just want to call it 'quit'.

      --
      True confidence comes not from realising you are as good as your peers, but that your peers are as bad as you are.
    6. Re:Qubits? by Anonymous Coward · · Score: 0

      well how about quintigers? and of course due to pronunciation problems we'll have to pass over hex straight to quoctal...

  20. Does this make D-Wave's quantum computer obsolete? by Anonymous Coward · · Score: 1, Interesting
    Recently, D-Wave's founder Gordie Rose was asked in his blog


    (comment 2):"How come Delft U has been able to perform a CNOT with two qubits using superconducting technology? I thought Rose/D-wave claimed it was extremely difficult to do discrete quantum gates with superconducting technology. What are the present & future limitations of the Delft "quantum computer?"


    Rose IGNORED the question. The quantum computer built by D-Wave is an adiabatic computer (which is an analog computer), whereas the Delft people have built a discrete gate quantum computer. Does the Delft computer make D-Wave's computer obsolete?

  21. Mod parent up. by Anonymous Coward · · Score: 0

    I don't know if it is insightful or funny, but I hope they mod you up.

    ---

    My image-word for this post is: redneck.

  22. It depends... by msauve · · Score: 1

    on whether someone is observing (or not, which is not and in negative logic).

    --
    "National Security is the chief cause of national insecurity." - Celine's First Law
  23. Argh by Mazin07 · · Score: 1

    Dangit, and I'm having enough trouble in computer science as it is, without all this fuzzy simultaneous 0/1 nonsense.

  24. NOT Moore's Law by VisceralLogic · · Score: 3, Funny
    the result may pave the way for devices of double the size in the next year or two

    Hmm, seems like they've successfully performed a NOT on Moore's law.

    --
    Stop! Dremel time!
    1. Re:NOT Moore's Law by codeButcher · · Score: 1

      So, Mooijs_law = ! Moores_law?

      --
      Free, as in your money being freed from the confines of your account.
  25. For what purpose? by arrenlex · · Score: 1

    Transistors are capable of more than on and off -- they can handle many intermediate stages of charge (fundamentally low, medium, high), which computing applications do not currently exploit. Why not add a third state by using technology that already exists? What are the benefits of quantum computing over the existing versatility of transistors?

    1. Re:For what purpose? by edschurr · · Score: 1

      My very incomplete understanding is that the quantum computer doesn't actually use three states, but rather both states simultaneously. I.e. the qubit is in a superposition of both 'on' and 'off'; it's not one of 'on', 'off', or 'other'. The difference matters. The quantum computer can be thought of as computing all possible inputs at the same time, but when the output is measured you get only one of the results, at random I guess. Apparently this can be taken advantage of in a few ways. Basically, some problems can be computed in a better time than the classical computer could do it.

      I reiterate that my grasp of this is weak, and especially where terminology is concerned.

    2. Re:For what purpose? by imgod2u · · Score: 1

      In a word, it provides infinite states (ok, maybe not infinite, but a lot).

      A quantum inverter would take an input that was 20% 1, 80% 0 and give you 20% 0 and 80% 1. Inverting is a relatively simple function but imagine a much more complicated function, such as multiplication. A 2-input, 32-qubit multiplier takes in two inputs each with a certain distribution of all possible 32-bit values (let's say, evenly distributed in one input and 50% less than 2 million, 20% between 2 and 3 million and 30% between 3 million and 2^32-1) and gives you a 32-qubit result that contained the multiplied distribution (a probability multiplication function).

      Your result, in this case, would be equivalent to doing 2^64 multiplications in a traditional binary multiplier. Of course, how you would sample the resulting data (it has to be sampled, and thus breakdown into normal 1's and 0's) would impact dramatically the usefulness of the function. You could, for instance, test for existence (does a certain number result from the function) and instead of having to compute all possible permutations one at a time, perform one pass using a qubit operation, then use a qubit "filter" operation of some sort (I'm no statistician so forgive me if I don't have an equation on hand).

    3. Re:For what purpose? by tsjaikdus · · Score: 1

      Not providing the answer, but some thoughts... Using the intermediate states of a transistor does not change the principle of classic computing. Although a single transistor may represent either 0 or 1, two transistors can define some state inbetween, which is still a classical computer. Also, Babbage's computer was digital, but used 10 states for its 'mechanical transistors' and it was still not a quantum computer. Also many analog computers of the past (for calculating trajectories of gunfire for example) use intermediate states, but aren't quantum.

  26. Sounds familiar... by guruevi · · Score: 1

    by turning bits into fuzzy quantum things called qubits (pronounced cue-bits) that are 0 and 1 simultaneously

    Sounds like any ol' woman to me, nothing to worry about, we have been handling it for centuries.

    --
    Custom electronics and digital signage for your business: www.evcircuits.com
  27. Maybe not so great... by FridayBob · · Score: 1

    ... In theory, quantum computers would allow hackers to crack today's toughest coded messages ...
    That may sound pleasing, but how about if it were changed to this:

    ... In theory, quantum computers would allow governments to crack today's toughest coded messages...
    It's not like we're going to be the first ones to get our hands on these devices, you know (if they ever allow us to have them).
    1. Re:Maybe not so great... by 808140 · · Score: 1

      That's a good point, of course, but the quantum computer will only be useful for solving certain classes of hard problems, not all of them. The mathematics behind their capabilities are relatively well understood, and in all likelihood cryptographers will design new algorithms that are difficult for quantum computers to solve.

      I have no evidence of this, of course, but it's too important a problem for the experts to ignore. Lest you forget, the government too has data it seeks to keep secret, and while basement-dwelling hackers may be unable to purchase a quantum supercomputer, odds are foreign states will have the resources to do so.

  28. Imagine slashdot on a quantum server! by EmbeddedJanitor · · Score: 3, Funny

    You'd never know if an article was a dupe or not.

    --
    Engineering is the art of compromise.
    1. Re:Imagine slashdot on a quantum server! by Spazntwich · · Score: 1

      Maybe they could be both. Or an article could be a dupe of itself.

      Personally, I'd just enjoy seeing them post a picture of a dead cat as a story.

    2. Re:Imagine slashdot on a quantum server! by Oktober+Sunset · · Score: 1

      when posted the picture would be of a cat that was both dead and alive and would only become dead or alive when it gets read. In soviet Russia though, it is far more complex.

    3. Re:Imagine slashdot on a quantum server! by dintech · · Score: 1

      You may be thinking of a dead horse. Being whipped.

    4. Re:Imagine slashdot on a quantum server! by RoboJ1M · · Score: 1

      In Soviet Russia, the cat both kills you and you kill the, er..., #OW# X@ *clutches head*

      J1M.

    5. Re:Imagine slashdot on a quantum server! by sanso999 · · Score: 1

      Flogged.

  29. Wow. ? by DoofusOfDeath · · Score: 3, Funny

    This is awesome no it's not!

  30. A little insight by Frion · · Score: 1

    Having taken a class on quantum computing last semester I would really like to add in some facts here. First to say qbits are both 1 and 0 at the same time is not entirely clear. Qbits are represented by arrays of length 2. These can be either [1,0] or [0,1]. Where the confusion occurs is when these are a superposition of the two, which means basically means that there is a probability that the result would be one of the two. What results from this is knowing the result most of the times, but sometimes being uncertain. For the uncertain cases there are ways to use the probabilities where in almost all cases only the more probable case will result. Also it is not completely correct to say we have no idea of how these will work. We have a pretty damn good idea, we just have not tested it yet. In fact, most of quantum computing is just simple linear algebra, as the qbits can be represented as arrays and the gates that control them can simply be represented by 2 by 2 matrices. Obviously this is only the basics of it, not touching on entanglement or any algorithms(which can all be represented by multiplying matrices). Anyway I did a pretty bad job of explaining all that, but the point is that this is a big deal and we are way ahead of understanding how these things should work in the future over understanding how to make a machine that will make them work.

  31. perl -qm by Doc+Ruby · · Score: 1

    I want to log into that machine and run some quantum Perl scripts on it. Nothing like an existing library of code to kickstart a new architecture.

    --

    --
    make install -not war

  32. Quantum Not? by zeketp · · Score: 1

    How does a quantum NOT gate work exactly? Normal NOT gates make zeroes into ones and visa versa. So this makes something from a simultaneous one and zero into a simultaneous zero and one?! How does this even help perform calculations? How do you use that info? *Not zero or one, but both? WTH?* Sorry if this is an obvious question, Discrete mathematics isn't in the curriculum for aerospace engineering. Does this do tons of simple calculations very fast? If not, I don't see as much of an application in it. Maybe if it could do some higher level calculus *in hardware* then it has real value.

    --
    Last Post!
    1. Re:Quantum Not? by m1h41 · · Score: 2, Informative

      here's a simple representation of a C-Not on two qbits:
        ______
      -| NOT|-
      -|____|-

      the gate has two inputs and two outputs
      in direct computation the the inputs are on the left, the outputs on the right
      in reverse computation the other way around

      let's take direct computation,
      say the inputs(left side) are in_x(top) and in_y(bottom) and the outputs(right) out_x(top) and out_y(bottom)

      the C-Not performs the following function:
      out_x := in_x;
      out_y := ((not)in_y and in_x) or (in_y and (not)out_x)

      BUT it performs this functions simultaneously on a superposition of inputs,
      a superposition of inputs for a qbit roughly translates to: something like if I measure the qbit I may get 0 with p probability and 1 with (1-p) probability

      algebraically you would express this using in_y = sqrt(p) |0> + sqrt(1-p) |1>

      so literally the gate works like this: in the cases when in_x is 1, out_y will be 1 with a probability of p and 0 with a probability of (1-p) - exactly the inverse probabilities of in_y

      this is all roughly speaking, there are other more subtle aspects...

    2. Re:Quantum Not? by tendays · · Score: 1

      Or, in programming language notation, a cnot gate performs "y ^= x", x being the control bit and y the target bit.

      If x and y aren't both pure states (i.e. are a superposition of 00, 01, 10, 11), the operation is performed independently on each basis state. Read http://en.wikipedia.org/wiki/Quantum_computer for more details.

  33. AI by Jedi+Binglebop · · Score: 1

    If I were to make a creative leap I would say, something that can be utilised which has two binary states at one time could somehow turn in to something that could result in erroneous random but recorded switching which then could in turn develop into an evoloving set of data that could potentially become self aware.

    Or it could just spit out junk.

    Either way my vote is that it should be called "Deep Thought".

    -JB

    --

    "I love deadlines. I love the "whooshing" sound they make as they pass by." - Douglas Adams.

  34. Really freaking fast processing by estimation by Wrexs0ul · · Score: 2, Interesting

    IAMAQP (I am not a quantum physicist) but the theory I read explains a system gaining processing power from shared computing of a single processor replicated across multiple realities. Each qubit is a calculated answer by a machine in one reality and the culmination of those answers assumedly gives you the correct response. David Deutsch wrote a book on this called "The Fabric of Reality" that works through the concept of a basic Turing machine - where computers all come from - and how this can be re-worked into a quantum processor.

    There's a lot more math to it than that, but the idea is a simpler approximation formula replicated infinitely across realities gives an accurate response much faster than any single reality calculating the absolute answer.

    Cooler yet is that if they're actually making functional quantum gates does this mean the processor power is actually being derived from other realities? That would be awesome and totally Outer Limits material.

    -Matt

    --
    --- Need web hosting?
  35. Paper by yellius · · Score: 1

    For those with access the paper can be found here (PDF). Dr.Dobb's and PhysOrg also have the story.

  36. wrong gate by master_p · · Score: 1

    The NOT gate is a simple bit inverter, but the CNOT gate (CONTROLLED-NOT) has two inputs, using the 2nd bit to invert or not the first bit. The article mentions the CNOT gate, not the NOT gate. In classic digital electronics, the CNOT gate equals the XOR gate:

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

  37. Don't worry, no Quantum cpu will ever be legal. by IndustrialComplex · · Score: 1

    Cracking encryption algorithms? Sounds like the MPAA/RIAA may need to flex the DMCA yet again.

    --
    Out of modpoints but really liked a post? 1BDkF6TtmmeZ3yqXbz9yhdYVqRYnwFoXDj
  38. both 0 and 1 simultaneously by ajs318 · · Score: 1

    If a qubit Q is both zero and one at the same time, then surely its complement !Q is also both zero and one at the same time? If you had qubits Q and R which were both 0 and 1 at the same time, then wouldn't (Q & R) be all of {0, 0, 0, 1} at the same time (so more likely 0), (Q | R) be all of {0, 1, 1, 1} at the same time (and so more likely 1), and (Q ^ R) be {0, 1, 1 and 0} at the same time (so equally likely 1 and 0)?

    Just because a wave function has to collapse into one eigenstate when it is observed, doesn't necessarily mean that will collapse into the one you were hoping for! And you don't need to lock a cat in a box with a time bomb to prove that.

    --
    Je fume. Tu fumes. Nous fûmes!
  39. Are you kidding? by Anonymous Coward · · Score: 0

    Next year's version of Grand Theft Auto won't run on anything else!

  40. misrepresenation by Anonymous Coward · · Score: 0

    As always this article claims more than is reasonably true. Implementations of CNOT gates have been done with cold ion traps for many years now, with more than 90% fidelity (a bad number for implementing many gate systems, however.) If the article means to claim the first solution of the sort on a chip I think that, too, may be a bit far-reaching.

  41. backwards not forwards by sacrilicious · · Score: 1
    After recent success in using quantum computing for superconducting qubits, researchers from Delft have formed the first Controlled NOT quantum gate

    How is this a step forward, I thought we already had gates that were NOT quantum gates...

    --
    - First they ignore you, then they laugh at you, then ???, then profit.
  42. Sweet! by gekoscan · · Score: 0

    I bet the inverse of all data on a windows 98 CD would run better as an operating system than most products M$ brings out.
    Hail the all mighty powerful quantum NOT... !!! :)

  43. to be or NOT to be... by karbonKid · · Score: 1

    ...that is the question

  44. Re:A solid milestone... Quantum coupled Ethernet by aisnota · · Score: 1
    Well think more like the year 2010 and perhaps even sooner for a better that the equivalent.

    Next comes Quantum Coupled Ethernet to revolutionize communications. Quantum pair sets working to provide two point to point channels.

    Within a Duo Quantum, 10GigE, or the AQ (Athlon Quantum) same difference with a hyperchannel set devoted to other chips scattered all over the world.

    QCE is the "Zero Mile Solution", you heard it here on Slashdot first!

    Bandwidth in long haul optical fibers will be a thing of the past, those companies long term value goes down the tube! Economics of each end drives the food chain of interconnected networks at each expensive junction melting into a lower cost anywhere possibility. Then low and behold, even your cell phone works in a mine shaft or in space 100 million miles away, with nary a cell phone tower. Oops cell tower syndicate companies now have a value equal to toast per site.

    Smart phones will have more bandwidth than the little screens know what to do with.

    This is our world in the next decade folks.

    Remember, those who short the telecommunications economy, from cable, cell and phone with a dash of even satellite television challenged... Well now you can beat up on Wall Street ahead of those gullible institutional bankers trying to schill extra profits from an apparently revitalized set of companies. Well guess what folks, this is the last hurrah for them in a Quantum Communications world the amount of winners will be very small and the all of us get a better deal than the toll keepers to video and voice want to rain on your parade with yet another DRM scheme.

    Wall Street is so damn blind to this!

    --
    http://www.aisnota.com/slashdot/ Welcome to Logic and the Future