Slashdot Mirror


Tiny Holes Advance Quantum Computing

Nick writes "Worldwide, scientists are racing to develop computers that exploit the quantum mechanical properties of atoms - quantum computers. One strategy for making them involves packaging individual atoms on a chip so that laser beams can read quantum data. Scientists at Ohio State University have taken a step toward the development of quantum computers by making tiny holes that contain nothing at all. The holes - dark spots in an egg carton-shaped surface of laser light - could one day cradle atoms for quantum computing."

57 of 255 comments (clear)

  1. Great principle by treff89 · · Score: 5, Funny

    Quantum computing is quite simply where we turn after existing silicon is exhausted. Once the basics about the random nature of quantum particles, which is extremely interesting, the meaning of computer and mechanics thereof can be redefined.

    1. Re:Great principle by NetCow · · Score: 2, Funny

      after existing silicon is exhausted
      Good one.

    2. Re:Great principle by koreaman · · Score: 3, Insightful

      Not necessarily. We still have a long way to go before we have useful quantum computers, and they're not an improvement over silicon for everything. We may well have diamond computers or something else fundamentally similar to silicon computers before we make the leap to quantum.

    3. Re:Great principle by treff89 · · Score: 2, Insightful

      That's supposed to be, once we understand the basics.. From what I remember of a lecture, the real issue is actually being able to control the particle itself, but once controllable, the powers are immense.. for example, it would be possible to tell if an email has been read by "simply" observing the state of the quantum particles. Extremely advanced stuff but hugely powerful for the distant future,.

    4. Re:Great principle by the31337z3r0 · · Score: 3, Funny

      Heh. Leap to Quantum. Don't EVER reference that show again.

    5. Re:Great principle by Urkki · · Score: 5, Informative
      • they're not an improvement over silicon for everything.

      Indeed, talking about quantum computers as an improvment on silicon computers is like talking about jumbo jets as an improvement over cars. Ie not an improvment at all, unless you have something very specific to do (factor a large integer or cross an ocean). And you need the simpler alternative to use the more advanced one (car to get to the airport, regular computer to feed and extract data for quantum computing).
    6. Re:Great principle by AKAImBatman · · Score: 5, Informative

      Quantum Leap was an excellent TV show that ran through the late 80's and early 90's. The premise was that "Dr. Sam Becket" (who now plays Captain Archer on Enterprise) invented a time machine that would allow him to reach points throughout his lifetime. The problem is that he never quite got the kinks worked out of his retrieval program, and now finds himself randomly leaping from life to life. The tagline of the show was, "striving to put right what once went wrong and hoping each time that his next leap will be the leap home." (Usually then followed by us seeing him leaping into someone's life. Something utterly confusing then happens to him and he utters the words, "Oh boy".)

      And now you know... the rest of the story.

    7. Re:Great principle by stevok · · Score: 5, Interesting

      Not exactly. Quantum computers can simulate classical computers with no problems. That's one of the tenets of quantum computation. I would love to see a 747 parallel park in Manhattan. Also, the fact that quantum computers can factor large integers efficiently necessarily implies that they can do other NP-complete problems efficiently, such as the traveling salesman problem. If we can ever get more than seven qubits to behave, we'll be amazed by the things quantum computers can do. But, alas, scientists have only implemented Shor's Algorithm for factoring integers on one number. 15. And hot damn, they got the factors right, 3 and 5. Yes, IAWAUGTOQC (I am writing an undergrad thesis on quantum computation).

    8. Re:Great principle by SysSupport · · Score: 2, Informative

      Paul Harvey, g'Day.

    9. Re:Great principle by zwilliams07 · · Score: 3, Funny
      the random nature of quantum particles
      *enters 1 + 1 into the built-in calculator*
      *gets 2,124,972, 421 as an answer*
      *enters 1 + 1 again*
      *gets 0.0012 as an answer*
    10. Re:Great principle by Urkki · · Score: 3, Interesting
      • Quantum computers can simulate classical computers with no problems

      So, what kind of scale are we talking about here? To simulate, say, a million-transistor CPU and a megabyte of RAM, how many qubits would you need? About as many as you need transistors, or radically less?

      If the answer is millions, then I think my comparison to a jumbo jet is valid, as we're probably about as far from a quantum computer simulating even a 4004 with hundreds of bytes of RAM, than we're from ubiquitous flying cars replacing jumbos ;-)
    11. Re:Great principle by stevok · · Score: 4, Interesting

      Like the article said, the issue isn't processor speed, it's algorithm time as a function of input size, i.e. logN. Factoring integers takes an exponential amount of time on classical computers. The best known classical algorithm (called GNFS) is O(exp((logN)^{1/3}(loglogN)^{2/3})), whereas Shor's algorithm can factor N in O((logN)^3) time. But, Shor takes roughly 2^N qubits to factor N. So, if we're talking about factoring a 200 digit RSA number, that's a whole crapload of qubits to control. Many orders of magnitude more than we can control now. In short, you're absolutely right about quantum computers being completely impractical until there are some huge breakthroughs in engineering and physics. This is why I love being a math major. We don't have to worry about silly things like actually building a quantum computer. We just sit around and daydream about how a quantum computer would work, then when we've got it all figured out, we blame the physicists and engineers for not building one.

    12. Re:Great principle by murphj · · Score: 2, Informative
      So, what kind of scale are we talking about here? To simulate, say, a million-transistor CPU and a megabyte of RAM, how many qubits would you need? About as many as you need transistors, or radically less?

      From TFA: "In principle, quantum computers would need only 10,000 qubits to outperform today's state-of-the-art computers with billions and billions of regular bits," Lafyatis said.
      --
      SONY. Because caucasians are just too damn tall.
    13. Re:Great principle by frakir · · Score: 2, Informative

      But, Shor takes roughly 2^N qubits to factor N

      Make that log2(N) qbits. 2^N would be a bit excessive (to factor 15 they'd need 32000 qbits. They used 7 of them)

    14. Re:Great principle by QuantumFTL · · Score: 5, Informative

      Not exactly. Quantum computers can simulate classical computers with no problems. That's one of the tenets of quantum computation.

      If by "no problems" you mean "severe and most likely insurmountable quantum coherence issues". Any quantum computer big enough to simulate a modern sized classical computer will contain so many qubits as to have problems with interference from the outside world. IIRC the problem of quantum coherence is roughly exponential in the number of qubits in a system (one of the reason we don't have 1000 qubit computers sitting around). Just having enough qubits to remember my RAM would get pretty ridiculous.

      The truth is that quantum computers, in the forseeable future, will likely be an orthogonal type of computing system to classical computers - a coprocessor used for certain problems with small memory requirements but large search spaces. Many of our most important computations lie in this regime, but I doubt quantum computers will outperform classical computers on most ordinary stuff (i.e. word processing, running a webserver, handling large databases) due to its seriality and memory intensive nature. (Insert quote like "640 k ought to be enough for anybody" here)

      Also, the fact that quantum computers can factor large integers efficiently necessarily implies that they can do other NP-complete problems efficiently, such as the traveling salesman problem.

      It implies no such thing. Traveling salesman problem is NP-complete, and while we have no solid proof that a quantum computer cannot solve an NP-complete problem in polynomial time, Shor's algorithm is also in no way any kind of proof, as integer factorization is merely NP, not fully NP-complete as you claimed.

      Yes, IAWAUGTOQC (I am writing an undergrad thesis on quantum computation).

      Yes, I do have a degree in physics. You may wish to check said thesis in light of errors explained above.

    15. Re:Great principle by poot_rootbeer · · Score: 2, Funny

      *enters 1 + 1 into the built-in calculator*
      *gets 2,124,972, 421 as an answer*
      *enters 1 + 1 again*
      *gets 0.0012 as an answer*


      So the Pentium was a quantum computer?

    16. Re:Great principle by bobhagopian · · Score: 2, Informative

      The real difference is that quantum bits ("qubits") can exist in superpositions. Take some qubit, like the spin of nucleus (this is actually a pretty popular choice). Classically, it can point up or point down in a magnetic field. We call these orientations 0 and 1; accordingly, the spin stores the exact same information as a regular bit. Here's where the quantumness comes in: the 0 and 1 states can exist on top of each other, so that a spin is in a combination of the two states. To imagine the potential utility of this superposition, consider this (somewhat artificial) example. To store the integers 0 through 7 on a classical computer, you'd need 8 sets of three bits (i.e., 000, 001, 010, 011, 100, 101, 110, 111). You can store the same set of integers on a SINGLE set of three qubits (i.e., 0/1 0/1 0/1). Why is that useful? Say you want to figure out which of those numbers plus 5 equals 10. Classically, you'd go through the possibilities one by one until you found a match. Quantum mechanically, you can do the operation, and the only state out of the superposition that survives is the 101 state. Pretty cool, huh?

    17. Re:Great principle by Old+Telco+Guy · · Score: 2, Interesting

      Indeed! So you could set up an NP complete problem, say a routing problem, as a superposition of all solution sets, and as long as you set things up so that the only state that survives is the shortest/best/whatever route, you'd be doing NP complete problems in linear time (albeit with a lot of quantum "memory"). This means you could have a chess/go machine that played a perfect game with no heuristics necessary. Telephone routing would be perfect, business routing (airlines, FAA airways, mail, whatever) would be routed with perfect efficiency, etc. Cool.

    18. Re:Great principle by tbo · · Score: 4, Informative

      Yes, I do have a degree in physics. You may wish to check said thesis in light of errors explained above.

      And I'm doing a Ph.D in physics on quantum computing. Sorry to be a prick about it, but you were a bit rough on the undergrad who posted above, and what goes around comes around. As long as that guy isn't doing his research on slashdot, he'll probably be OK..

      If by "no problems" you mean "severe and most likely insurmountable quantum coherence issues". Any quantum computer big enough to simulate a modern sized classical computer will contain so many qubits as to have problems with interference from the outside world. IIRC the problem of quantum coherence is roughly exponential in the number of qubits in a system

      No, the problem is not exponential in nature. It has been shown that if the error rates for storage, gates, etc. can be brought below certain thresholds (typically 10^-3 to 10^-6), then arbitrarily long computations can be performed. There are many papers on the subject, but here is one.

      The only way in which decoherence could pose an insurmountable problem is if there is fundamentally new physics that plays a role in the regime between "quantum" and "classical". Nobel Laureate Tony Leggett has talked (in a recent issue of Science, and at the 2005 Gordon Research Conference) about how we might find such new laws of physics if they exist, or otherwise rule out their existence.

      It implies no such thing.

      You are correct. In the early days of the field, I think there was a little bit of confusion about whether quantum computers could do NP-complete, but it has long since been sorted out.

      I recently attended a talk by Ike Chuang about general issues in the field. Chuang feels that quantum simulation and quantum communication will be the important applications, although he emphasized communication. I think quantum simulation is way, WAY underappreciated. Not only is it going to revolutionize protein folding, drug design, and other biomed applications, I have a hunch it may prove to be a prerequisite for advanced nanotech.

      The article is not particularly good. The supposed problems that optical lattices will have in addressing qubits in the interior of a 3-D lattice are "solved" by using what is essentially a 2-D lattice on a chip. The same can easily be done with optical lattices.

      Of course, addressing atoms inside a lattice of moderate size can be done using a high numerical aperature lens to focus an addressing beam onto a single atom. The addressing beam produces an AC Stark Shift of the appropriate hyperfine sublevels of the atom (in the case of Cesium-133 qubits, it shifts each of the mF sublevels of the F=3 and F=4 states), with the exact shift being different for different sublevels. This allows transitions in that particular atom to be driven by a microwave pulse which is detuned from all the other atoms in the lattice. Just how well can we address one atom while not disturbing atoms in adjacent planes? I'll know in a week or two. I'm currently simulating one and two qubit gates in this exact scheme. The actual experiment is also under construction, at Penn State.

      Anyone interested in a distributed computing project to develop quantum computers? I could use help from developers, and later, also regular user input.

    19. Re:Great principle by Gate-c · · Score: 2, Informative

      I am the one who actually made this animation for OSU research communications last week! The main story was posted at OSU with the full movies, not just screen shots http://researchnews.osu.edu/archive/eggcarton.htm

  2. Definitions? by Rinzai · · Score: 5, Funny
    "...making tiny holes that contain nothing at all."

    Well, yes, that rather is the definition of "hole," isn't it? Having nothing in them is what distinguishes them from the rest of the surroundings.

    1. Re:Definitions? by AviLazar · · Score: 2, Insightful

      I have a hole, I place a golf ball in it - I still have a hole. It just happens to have a golf ball. The difference is one is an empty hole, the other is not.

      --

      I mod down so you can mod up. Your welcome.
    2. Re:Definitions? by EvilTwinSkippy · · Score: 2, Insightful
      Thirty spokes share the wheel's hub;
      It is the center hole that makes it useful.
      Shape clay into a vessel;
      It is the space within that makes it useful.
      Cut doors and windows for a room;
      It is the holes which make it useful.
      Therefore profit comes from what is there;
      Usefulness from what is not there.

      --Lao Tsu, The Tao Te Ching, Chapter 10
      --
      "Learning is not compulsory... neither is survival."
      --Dr.W.Edwards Deming
  3. Mind Boggling by CleverNickedName · · Score: 5, Funny

    Scientists ... making tiny holes that contain nothing at all.

    So these boffins have developed "nothing", but one day, in the far future, this nothing could be filled with something important.
    Wow. What an age we live in.

    --


    Unfortunately, I am not Wil Wheaton
  4. obligatory Simpsons quote: by TheAxeMaster · · Score: 5, Funny


    They're speed holes, they make the computer go faster....

  5. Best part of quantum computing by bigtallmofo · · Score: 2, Funny

    The thing I'm really looking forward to on Slashdot 2015 are all the posts:

    "Why would anyone need that much power? I remember 9 years ago when we only had 10 qubits to work with! Quantum programmers sure are spoiled and lazy today."

    --
    I'm a big tall mofo.
  6. Re:Just in time for Lonhorn!!! by ZeroExistenZ · · Score: 4, Funny

    If you get a quantum 3D-accelerated graphicscard.

    --
    I think we can keep recursing like this until someone returns 1
  7. Re:Wow by Vo0k · · Score: 3, Interesting

    Actually, most of holes on Earth are full on air. Even void isn't quite empty. If you have a couple of atoms forming a particle, the space between them isn't quite empty either - they partially overlap, the uncertainity principle says they "partially are" there. The idea is about making small holes with REAL void - no particles, no photons, no "with a little probability, there" electrons, just total null. Not quite easy. I, for one, can't quite imagine how are they going to stop neutrinos from entering that space...

    --
    Anagram("United States of America") == "Dine out, taste a Mac, fries"
  8. How many were there? by sharkey · · Score: 2, Funny

    And how many would it take to fill the Albert Hall?

    --

    --
    "Outlook not so good." That magic 8-ball knows everything! I'll ask about Exchange Server next.
    1. Re:How many were there? by meringuoid · · Score: 3, Funny
      And how many would it take to fill the Albert Hall?

      Four thousand.

      I was never quite clear on how the holes from Blackburn, Lancs. could possibly fill the Albert Hall. I mean, they're holes - defined as being something not there. How can they fill anything?

      Then I discovered marijuana, and understood :-)

      --
      Real Daleks don't climb stairs - they level the building.
  9. Magic Red Smoke by Analogy+Man · · Score: 3, Funny
    Everyone knows current computers and consumer electronics work using magic blue smoke. If the smoke escapes your device no longer works. Overclockers are very clumsy about letting out the blue smoke and sell their processors (depleted of magic) on e-bay under dubious accounts.

    Quantum computers will use red smoke (the Rubium cloud). Will we call the hobbiests that push the limits of these machines Quark shakers?

    --
    When the people fear their government, there is tyranny; when the government fears the people, there is liberty.
  10. Comment removed by account_deleted · · Score: 3, Interesting

    Comment removed based on user account deletion

  11. If Schroedinger is anything to go by. . . by oneandoneis2 · · Score: 2, Funny

    . . . won't quantum computers mean an end to binary?

    In the old days, a cat in a box was either alive or dead - one or zero, you might say. Nice and easy.

    But when it gets quantum? How the hell is a simple machine going to cope when it asks "Is it one or zero?" and gets told "Both"

    "We've had to replace 'if' and 'and' with 'maybe' and 'probably'. And 'not' has become obsolete."

    --
    So.. it has come to this
    1. Re:If Schroedinger is anything to go by. . . by x4A6D74 · · Score: 5, Insightful
      The computer does not ask "is it one or zero" and get told "both."

      Going back to the same metaphor you began to use, the principle that the Schroedinger's Cat Experiment is suppposed to illustrate is not the concept of superposition (that the cat is both alive and dead whilst in its quantum state in the box) but the concept of decoherence of the quantum state under observation.

      It's currently a postulate of quantum mechanics (i.e. everyone observes this phenomenon but nobody can explain it) that observation of a quantum state in a superposition (say, a "qubit" -- perhaps an electron spinning up for 0 and down for 1) will have one of the two values, with certain probability. Once read, the state loses that superposition and remains in the observed state (Recall: in the SCE, the cat stays alive or dead once you open the box).

      If you don't want to measure your qubits, and thus maintain their superpositions, entanglements, etc., that's fine ... of course, you can't get any information out of them. If you've properly designed your quantum machine, you may have a guess as to what the possible states are; you may even know the probability of each one.

      As soon as you ask to see a qubit, however, it becomes a classical bit and stays one. That's the downside to all this quantum stuff.

      Quantum computers also do not mean an end to binary -- currently, since humans have, and are trained to use, primarily classical faculties, quantum research is aimed at extending classical computation. So we typically discuss a "qubit" which may be 0, 1, or some combination thereof (specifically residing in the field C x C). But, if we ever want to interface a quantum computer with a classical instrument (for example, some sort of I/O device, or a classical computer, or a human) then we will unavoidably devolve back to binary.

      For more information, I recommend Nielsen & Chuang's book on Quantum Computation and Quantum Information (I think; I don't have it in front of me right now).

      Disclaimer: I am not a quantum mechanic. I am, however, an junior finishing up my degrees in mathematics and computer science so that I can go on in a year to work on a PhD in quantum computation. --0x4a6d74

    2. Re:If Schroedinger is anything to go by. . . by ciroknight · · Score: 4, Insightful

      A better explaination would be, "Is it a one or a zero?" "Depends on your perspective."

      Quantum computing, as I understand it (IANAQCS/P) works off the principal of super position; the ability for a bit to represent multiple bits, simply by the spin of the electron, or some other random thing that I wouldn't know how to explain.

      If you defined a zero as a square, and a one as a circle, then a quantum bit would be a cylinder; from one perspective you see the square, yet turn it on its side and you see its other property. But since you have other posibilities (cubes and spheres in this system), the "third dimension" persay has to be explicitly asked for by the requesting computer.

      So it's able to perform a massive amount of calculations based on a little bit of data, and store it as one neat little package at the end (either the cube, the sphere, or the cylinder). When someone comes along to ask, "was the answer a zero or a one" then, the only way to answer is "depends on the perspective".

      --
      "Victory means exit strategy, and it's important for the President to explain to us what the exit strategy is." G.W.Bush
    3. Re:If Schroedinger is anything to go by. . . by Deanalator · · Score: 4, Informative

      I like to think of quantum computers as binary on the outside, analog on the inside. You can only read and write in binary, but the operators in the middle can be real valued (complex valued even).

      Nielson and Chuang's book is neat (I have it sitting on my floor 3 feet from me ATM). It's mainly written for the physicist to learn quantum circuits and algorithms. It takes a year to read, but by the time you are done, you should be able to read and understand most of the papers in the field.

      A much lighter book on the subject is "Explortions in Quantum Computing" by Williams and Clearwater. It gives a basic overview without much assumed knowledge.

      Also "Problems & Solutions in Quantum Computing & Quantum Information" by Willi-Hans Steeb and Yorick Hardy has alot of fun problems in it. It's the kind of book thats good to read on a bus, or an airplane.

    4. Re:If Schroedinger is anything to go by. . . by MenTaLguY · · Score: 3, Informative

      why is the cat both dead and alive? why can a bit be both one and zero? i don't understand this and would like to hear an explanation that makes sense.

      While I'm not sure there is an explanation that makes intuitive sense, it does appear to be the way the universe works at small scales.

      Schroedinger's thought experiment was intended to illustrate the weirdness of the issue by tying the state of a macroscopic object (a cat) to a quantum state (the decay/not decay of the particle), mainly. It's not a realistic experiment because you couldn't isolate the macroscopic contents of the box from the outside world sufficiently (and besides, it's cruel).

      But, real experiments do demonstrate that quantum stuff consistently behaves in really bizzare and counterintuitive it-is-but-it-isn't ways.

      One famous example is the oft-repeated "double slit" experiment (hopefully I won't mangle the summary too much).

      You remember light-as-waves? If you take a coherent light source (i.e. a laser) and shine it onto a screen through a mask with two small parallel slits in it, you will see a pattern on the screen resulting from the two interfering wavefronts.

      That's simple enough. But light is also particles (photons). You can put a filter between the lazer and the mask that only allows one photon at a time to dribble through. Now you have individual photons going through the mask, and you see individual spots as they hit the screen. Intuitive enough.

      But it starts to get weird. If you measure the brightness of those spots, though, they still follow the brightness of the interference pattern. That would suggest that the photon is going through both slits at once and somehow interfering with itself. Hmm, that's not very intuitive.

      But, okay. We can test that by using detectors at the slits to note the photons as they go by. Hmm. No, each photon is only going through one slit or the other, not both at once. So why are we getting the interference pattern? Wait, where did the interference pattern go?

      Huh. We stop observing which slit the photon is going through, and the interference pattern comes back (i.e. it effectively went through both slots). We start observing again, and it starts "picking" one or the other slot again...

      Basically it looks as if, to employ a gross anthoropomorphism, on quantum scales the universe is "lazy", and only commits to a specific choice if it has to (because somebody is watching). No, that's not intuitive, and no, we have no clue how this happens exactly (although we're getting better at describing it and exploiting it for practical purposes like primitive quantum computers), but that's what happens.

      why does it need an "observer"? what exactly is an observer"?

      Physicists are wrestling with that one. We don't really know. A person directly observing the quality being tested (directly or via instrumentation) seems to be sufficient, but not necessary.

      That's one of the downsides of the "Copenhagen Interpretation", which is the most common interpretation of these phenomena -- that an observer observing "forces" the universe to make a "choice" (the grossly anthropomorphic word choice is mine though -- the actual way of putting it is that the act of observation "collapses the wave function").

      There are other interpretations, too, that don't require a privileged position of "observer", but they have other very awkward quirks.

      this all seems counterintuitive to normal logic so why should i believe it is true?

      Certainly you shouldn't accept it just because someone says so, or because a few experiments suggest it might be true. In this case, though, the experiments have been repeated too many times by too many different people for the weird results to be the result of experimental error though, and also experiments designed to disprove these behaviors have fai

      --

      DNA just wants to be free...
    5. Re:If Schroedinger is anything to go by. . . by MenTaLguY · · Score: 2, Insightful

      Something to bear in mind is that when we talk about particle spin, "spin" is a metaphor. There isn't an actual rotation of a material object involved.

      "spin" is just a label we've adopted for an abstract property of particles for which we don't have a good name otherwise. It becomes more obvious in e.g. quantum chromodynamics, where we use labels like "color" to describe particles.

      Sadly, it's all too easy to mistake the map for the territory here.

      In physics, even the notion of particles is a metaphor for stuff happening in specific places (at least when we're looking) and existing in discrete quantities, but taking the metaphor too far (e.g. reasoning as if they were actually tiny little solid spheres) eventually leads to conclusions that don't match what happens in the physical world.

      And, that's what actually matters in the end. Not my assertions or those of the GP, but what experiments demonstrate about how the physical world behaves. The metaphors are just descriptive.

      --

      DNA just wants to be free...
  12. Re:Just in time for Lonhorn!!! by Anonymous Coward · · Score: 2, Funny

    Probably or probably not. 50/50 either way.

  13. Original News Release by Milalwi · · Score: 2, Informative

    The original news release, which has an animation to support the story is available at the Ohio State University Research News site.

    Milalwi

  14. Re:Just in time for Lonhorn!!! by NinjaFarmer · · Score: 3, Funny

    So it will run Duke Nukem Forever then?

  15. Re:Wow by Strange+Ranger · · Score: 4, Funny

    I, for one, can't quite imagine how are they going to stop neutrinos from entering that space...

    Simple. They'll just repolarize the quantum invariance field and then bombard it with a tachyon pulse. This creates a standing wave of Heisenberg Flux, which is the only way to be certain the hole is empty.

    --

    Operator, give me the number for 911!
  16. Someone please clarify by karvind · · Score: 2, Interesting
    From the article: "We're pretty sure we can trap atoms -- the first step towards making a quantum memory chip," Lafyatis said. A working computer based on the design is many years away, though, he cautioned. In fact, Christandl suspects that they are at least two years away from being able to isolate one atom per trap -- the physical arrangement required for a true quantum memory device.

    1. What is the working principle behind this (mechanism of trapping) ?

    2. Are these experiments performed at room temperature ?

    3. How do they ensure they have trapped one "desired" atom and not more atoms and not some other impurity?

    4. How is the laser prevented from interfering with lattice (non-desirable interactions) ?

    5. What is the decoherence time which governs if you can really do any computation before the result is lost ?

    This is indeed an important step forward. But alas the student is graduating in august and I hope there is someone to followup on this work:

    Theoretically, if they release the atoms above the chip in just the right way, the atoms will fall into the traps. They hope to be able to perform that final test before Christandl graduates in August.

  17. Related article by c0ldfusi0n · · Score: 2, Interesting

    Physicists could soon be creating black holes in the laboratory

    When shall we get pet dark holes?
    Imagine cleaning the house with one of these around!

    --
    A computer makes it possible to do, in half an hour, tasks which were completely unnecessary to do before.
  18. In related news... by Etherwalk · · Score: 2, Funny

    > Scientists at Ohio State University have taken a step toward the development of quantum computers by making tiny holes that contain nothing at all

    In related news, Ohio State University has recieved research funding from the NSA to perform Ear Exams on all members of Congress twice a year...

  19. The Law. by k96822 · · Score: 3, Interesting

    ...and this is why Moore's Law will continue, even though Moore himself says that it won't. Never underestimate the cleverness of the Human.

    1. Re:The Law. by Quiet_Desperation · · Score: 2, Interesting
      Never underestimate the cleverness of the Human.

      *cough*fusionpower*cough* The eternally "just around the corner" technology.

      Hey, I tease mankind. :)

  20. Re:tiny chips, tiny problems by karvind · · Score: 2, Informative
    Does anybody really know exactly how atoms and sub-atomic particles are going to behave in less-than perfect environments? What about gamma-ray bursts from stars and nuclear emissions from our Sun? Will these possibly have an adverse effect on a chip that is running on the atomic level?

    One of the key to making things at nanoscale is to have fault and defect tolerance. With billions of elements in the system, you are bound to get manufacturing defects as well as many run-time defects. Even in modern DRAMs they have redundant columns of memory cells to improve the yield by swapping the defective ones with spare ones. FPGA(Field Programmable Gate Arrays) offer in-circuit reconfigurability. HP showed Teremac few years ago which had millions of defects yet it worked just "fine" by detecting the defects and reconfiguring around it.

    In short there will be sources of errors and faults in these systems, but there are various ways to get around it. Also in quantum computing, you can encode your data in such a way that it is immune to noise (atleast to certain extent) and is called Quantum error correction.

    But also remember that science is not just about destination but also the journey. Even if practical quantum computers are never built, we are likely to learn many interesting aspects which may be used elsewhere.

  21. Re:tiny chips, tiny problems by aziraphale · · Score: 4, Insightful

    "How about our Scientists rescue the Hubble Telescope first, something we know works, then worry about the quantum chip later."

    No, but first, our scientists have to clean their teeth, then our scientists will be asleep for the next eight hours. Once our scientists have got up in the morning, they'll have a bowl of cheerios and then read the paper for a bit. Then maybe they can tackle the Hubble telescope problem (although the fact that all n million of them are trying to write on the blackboard at the same time does mean they won't make much progress. And the biologists have to sit around twiddling their thumbs because there's not much they can do to help). After Hubble, there's some promising work on cancer they need to finish up, before they can get on with a bit of geology.

    Hopefully, someday soon, our scientists will realise that they can get much more done if they allow small groups of themselves to concentrate on different things, so they can make progress in different fields at the same time. In the mean time, though, you're right. They're all wasting their time on this pointless quantum computing nonsense.

  22. Re:There are still steps to take before quantum... by advocate_one · · Score: 3, Informative
    Diamonds have the highest conductivity rate of any known metal, which makes them perfect candidates for traditional computing. You may think "oh, but they're so expensive," but this isn't necessarily true. Natural diamonds are expensive, but this isn't due to its scarcity.

    Diamonds are not a metal... and Diamonds have the highest thermal conductivity... the last thing you want here for semiconductor devices is a substrate with the highest electrical conductivity... you want a very good insulator, which also gets heat away very quickly... this is where Diamond layers come in... not solid machined diamonds, but diamond deposited or grown into a thin layer...

    --
    Donald 'Duck' Dunn: We had a band powerful enough to turn goat piss into gasoline.
  23. Factoring is NOT known to be NP-complete by Catullus · · Score: 5, Informative

    In fact, it would be very surprising if it turns out to be NP-complete, as it is in NP intersect co-NP. Also, no efficient quantum algorithms are known for NP-complete problems, and it is generally suspected that quantum computers won't be able to solve them efficiently. For example, see this semi-technical paper.

    You had better get that right in your undergrad thesis ;)

    1. Re:Factoring is NOT known to be NP-complete by ortholattice · · Score: 2, Interesting

      While I have not read the paper you mention completely enough yet to understand its argument, let me point out the obvious fact that nature, by definition, "simulates itself," i.e. is its own computer. Now, the processes involved are extremely complex; just to simulate the processes going on inside of a single atom can take years of computation time on an ordinary computer, yet it happens essentially instantly in actuality. Is the problem of simulating nature on a submicroscopic level NP-complete? I'm not sure, but certainly it's way beyond the realm of what present-day computers can do. The question is, can we somehow harness this incredible built-in computational power to solve more general problems?

    2. Re:Factoring is NOT known to be NP-complete by Planesdragon · · Score: 2, Interesting

      While I have not read the paper you mention completely enough yet to understand its argument, let me point out the obvious fact that nature, by definition, "simulates itself," i.e. is its own computer.

      You're misusing that first word.

      A "simulation" is a testable model of something, usually created for a specific kind of testing, that specifically is NOT the thing itself. By way of example, consider "simulating" adding numbers on a computer chip. Most of the time you wouldn't bother doing it, because it's easier just to actually add them.

      But you could "simulate", oh, a computer chip running a very-complex program, just by having it do something that's needlessly complex. (Like, oh, performing random operations on a random number of a random size.)

      When you start dealing with Quantum Mechanics, it's important to stop every now and again, and remember that what we have for QM is a *simulation* -- i.e., in certain fundamental ways it's simply wrong, but the wrongness is OK because we don't need to know everything about how a process works for that process to work, or even to come up with a new process.

  24. Re:Wow by madaxe42 · · Score: 5, Interesting

    You can actually guarantee that it will be empty, by creating wave functions that overlap in such a fashion that the probability of a particle being in that space is, in fact, 0, or, by creating wavefunctions which when combined state that the probability of there not being something in that location is infinite. Picture two asymptotic curves joining at a vertical axis, mirrored.

    There are a lot of extremely odd quantum effects which aren't physically possible, in any classical or comprehensible universe, however do happen. For instance, it's possible to create a negative temperature. Not negative, as in minus 22 farenheit, but negative, as in below absolute zero!

    This happens when you rapidly invert the polarity of a magnetic field in which is contained a bose-einstein condensate - in the time that it takes for the condensate to re-align it's spin, it has a rapid change from a negative temperature to a positive temperature once more. The energy of a negative temperature is, actually, greater than that of an infinite positive temperature!

    Anyway, enough quantum rambling. If you don't believe me, look here.

  25. Re:I wonder... by SolFire · · Score: 2, Informative

    Acutally that won't happen because if it happend, it would imply information travelling faster than light, and that does not happen. Even if you have a pair of perfectly entangled qubits (called an e-bit), and you seperate them by a great distance and perform a quantum operation on the first qubit, the measurment outcome of the first qubit will not affect the measurement outcome of the second qubit.

    The idea of Quantum Teleportation has been misunderstood. Quantum Teleportation is not like the Star Trek transporters. Quantum Teleportation is a method of sending a qubit to another person. In order to do this you need to share an e-bit. Ex. Alice has a qubit Y she wants to send to Bob. Alice and Bob also share an e-bit E (which is a perfectly entagled pair of qubits 1/sqrt(2)(|00>+|11>). Alice performs a controlled-not operation on her part of the e-bit Y, then she does a Haddamard transformation (Quatum Fourrier Tranform on 1 bit) on the qubit Y, then she measures both the qubit Y and her part of the e-bit E. At this point we have two classical bits 00, 01, 10, or 11. She then sends this to Bob. Bob the performs a controlled-not on his part of the e-bit Y based on the first bit, and a controlled phase-flip based on the second bit at which point Bob's qubit that he now has is Y. This process perfectly sends a qubit from Alice to Bob, but the key part of this method that needs to be remembered is that the two classical bits that Alice measured had to be sent to Bob. Without these bits Bob would not be able to get Y and sending the classical bits, takes the usual ammount of time.

    What's even cooler is that if Alice's qubit Y had been entangled with another qubit X, the entanglement is preserved after the QT process so that the qubit Bob has is now entangled with X.

    Disclaimer: I am not a quantum physicist. I am a recent computer science grad who just took a course on Quantum Computing. Just one.

  26. Damn Butterflies. by purduephotog · · Score: 2, Funny

    The problem with the current quantum computer research is there are always butterflies in China flapping their wings ... interfering with the research done in the US.

  27. See the Animation (.mov and .wmv) by Anonymous Coward · · Score: 2, Interesting

    Here are posted movies of the experiment

    http://researchnews.osu.edu/archive/eggcarton.htm