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."

18 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 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).
    2. 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.

    3. 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).

    4. 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.

    5. 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.

    6. 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.

  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.

  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. 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
  6. 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

  7. 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!
  8. 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
  9. 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.

  10. 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 ;)

  11. 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.

  12. 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.