Slashdot Mirror
German Scientists Create 5 qubit Quantum Register
CMan0 writes "In the University of Bonn, a team of scientists has built a 5 qubit register, using cesium atoms trapped by a laser-beam grid, The Register reports. They've been able to install an empty 5 bit register(i.e. all bits 0), change two of them to 1, and later read those 1s back. The next goal is to create an interaction between 2 bits. The full scientific article can be found here in PDF format."
This was covered on New Scientist and IndiaTimes a few days ago. Their articles:
-New Scientist
-IndiaTimes
definition of qubit: The quantum computing analog to a bit. Qubits exhibit superposition. Thus, unlike normal bits, qubits can be both 1 and 0 at the same time.
thankyou NTN
I think it has to do with this.
Dark StateEast Coast Brewers
Several reasons - it's heavy, easier to be made neutral and easier to be trapped in a wave dipole trap (that's what they seem to be using). In a standing wave dipole trap, the first factor especially plays an important role in sustaining stability.
Plus, they've a discernible signature even in a spatially modulated environment and that helps.
Well, I meant in a classical sense.
IBM's factoring operation was a very specific deed - it's not really a quantum computer as much as a customized quantum operation for a very specific task.
I meant something where you give an input, process it, store it and retrieve it -- entirely using quantum operations.
That is a challenging.
And IBM's task and this are two entirely different things, in terms of what they mean and what they've accomplished.
So, we're what 10 - 20 years away from a QC that both gives you your answer and blue screens at the same time?
Atleast.
I would say maybe 50. It's not enough if you can get a system to do something - you need to make it reliable and scaleable.
We're still tackling the very basic problems in QC, and have a very very long way to go. Error correction is still a very big problem.
Some people, such as Alexei Kitaev, have done some pioneering work but it's still in its infancy. A long long way to go.
Actually, that was Bill Cosby - or at least it was part of the act he did at the first Gator Growl he headlined (not hte one in 2002)...
Don't blame me, I voted for Kodos
A qubit (for "quantum bit") is the basic information unit for a quantum computer (just as the classical bit is for classical computers). They are actually two-state quantum systems (just as ... Ok, I'm repeating myself :-))
The point is that quantum systems have properties which are not found in classical systems. For one, they cannot be just in the states "0" or "1" (in the usual notation for quantum states: |0> or |1>), but also in so called superpositions of those states. Such a superposition means that they are something like both states at the same time (remember Schrödinger's cat? That's exactly such a state, except that unlike atoms, cats cannot actually be brought into such a state). More importantly, such a superposition can extend over more than one qubit, in which case each single qubit doesn't have a defined quantum state at all, but only the whole set of qubit has. This is called entanglement.
Now, why is this so useful? Well, assume you create a set of, say, 8 qubits which are all "half zero, half one". And now you perform a normal calculation on them (but with quantum operations). Then you are actually performing the calculation on all 8-bit combinations, at the same time, i.e. for all numbers between 0 and 255. This remarkable effect is called quantum parallelism.
Now, of course there's a catch: You cannot read out more than one of the results (because reading out one destroys the superposition), and which one you get is essentially random. Ok, you now may think, I can effectively make the calculation just for one randomly selected number? So this is actually a disadvantage? Well, the point is that you can not just do "classical" calculations, but you can add operations which are not possible in classical computers. For example, there are several "half zero and half one" bit states, and you can do a quantum operation to convert one of them to |0> and one of them to |1>. Therefore you can extract properties of that result which depend not on just one of the results, but on several of them. And this allows you to actually reduce the numeric complexity of certain tasks. For example, you can search an unsorted database in O(sqrt(N)) time, instead of the classical O(N) time (N being the size of the database). The most famous algorithm is of course Shor's algorithm which allows factorizing large numbers in polynomial time, thus allowing to break public key encryption systems like PGP.
Now, there's not too much danger yet, since AFAIK the biggest number successfully factorized with a quantum computer is 15. But then, as long as 5 qubits are newsworthy, you cannot expect too much (imagine a message that someone managed to build a classical 5-bit computer!).
The Tao of math: The numbers you can count are not the real numbers.
From the theorist's perspectice it doesn't really matter how you implement this stuff - if it works, all implementations are equivalent.
At the current stage it is very reasonable to explore all possible routes to a QC (atoms, ions, photons, quantum dots, superconductors etc, a nice and readable uptodate overview is given in the Quantum Computation Roadmap): first, since it is not clear which will turn out to be most successful and second, because along the way lot of interesting physics can be expected from the coherent control of well isolated physical systems.But of course ther are (and will remain) technical advantages of certain implementations. I do not think that currently anybody knows what the most promising physical system is. Trapped ions are probably most advanced at the moment. Compared to them neutral atoms in optical lattices might two advantages: optical lattices appear to be rather "scalable", i.e., one might go beyond 5 qubits rather quickly, once complete coherent control has been demonstrated. (In a linear ion trap there will be difficulties to go beyond 10-20 ions, though very promising ways around these difficulties have also been demonstrated.) On the other hand, using neutral atoms (rather than charged ions) may make the qubits less susceptible to stray fields and other sources of decoherence.
Qubit.
/kyoobit/ ) is a unit of quantum information. That information is described by state in a 2-level quantum mechanical system, whose two basic states are conventionally labeled |0> and |1>(pronounced: ket 0 and ket 1). A pure qubit state is a linear quantum superposition of those two states. This is significantly different from the state of a classical bit, which can only take the value 0 or 1.
A qubit is not to be confused with a cubit, which is an ancient measure of length.
A qubit (quantum + bit; pronounced
A qubit's most important distinction from a classical bit, however, is not the continuous nature of the state (which can be replicated by any analog quantity), but the fact that multiple qubits can exhibit quantum entanglement. Entanglement is a nonlocal property that allows a set of qubits to express superpositions of different binary strings (01010 and 11111, for example) simultaneously. Such "quantum parallelism" is one of the keys to the potential power of quantum computation.
--------- end quote -----------
Quantum cryptography
From Wikipedia, the free encyclopedia.
Quantum cryptography currently has two aspects. The first is quantum key exchange, a method for securing communications based on quantum mechanics. The second is the conjectured effect of quantum computing on cryptanalysis, although it is currently, like quantum computing itself, only a theoretical concept.
The basic idea in quantum key exchange is to use the "noisy" properties of light to render incoherent an image that acts to complement a secret key. This image can be represented in a number of ways, but the ability to decode that image rests upon an understanding of how it was made. No way to intercept the transmission without changing it is possible, so key information can be exchanged with great confidence it has been transmitted secretly.
Using quantum superposition as a part of the computation, quantum computing will considerably extend the reach of cryptanalysis, making brute force key space searches much more effective -- if such computers ever become possible in actual practice.
----------- end quote ----------
NOTE: Please read the actual wikipedia articles. They have TONS of hyperlinks with full explanations!
NMR quantum computing as demonstrated by IBM has many drawbacks.
For these reasons, liquid state NMR is not be considered to be scalable. Nevertheless, the NMR people have amazing control over the operations (logic gates) they can perform, and these ideas may (and have) fed back to other implementations. Moreover, there are attempts to overcome the mentioned difficulties (while keeping some advantages of NMR) by using nuclear spins in cold solids following Kane's proposal).First, there's not a single quantum system doing the computation, but rather some 10^20 molecules in the liquid - and you need so many to generate a detectable signal.
Second, the NMR quantum register cannot be properly initialized, rather it is in a nearly random state with only a slight enhancement of "0" over "1". This is part of the reason why so many systems are needed and it prevents the currently realized systmes from displaying any entanglement.
Finally, it is not clear how to scale such a system (increase the number of nuclear spins on a molecule): the larger that number, the more difficult it is to address individual qubits.
Just a different tech really, the IBM (Issac Chaung) method uses the properties of a molecule:
:(
5 Fluorine atoms joined together by Carbon atoms.
Where each Fluorine atom was a data storing "qubit".
There are lots of these molecules in a tank but they just store the same data, to give a larger reinforced signal than a single molecule. Hence the computer is limited to FIVE "qubits" no matter how many molecules you have.
You are limited by the complexity of the molecule.
.
The German trap would be expected to be more scalable, you can add more qubits by just (heh) making it physically "bigger" (longer).
.
Of course my field is solid state QC and it will OWN U ALL MUHAHAHAHAHAHA.... damn decoherence
All you need is one quantum bit in a cpu and you can generate genuine random numbers of any size. Sure beats psuedo random numbers.
Just to expand on this post, you can treat |0> and |1> as vectors. Well actually they are vectors.
So |0> is [1,0] and |1> is [0,1]
So a "superposition" is simply A*|0> + B*|1>
= [A,B]
Nothing particulary fancy or anything.
The analogy I used to explain it to my dad is this:
Imagine I have a light bulb, with a dimmer switch. I could set this to a dimmer switch to anything in between on and off. Theoritically I could store an infinite amount of information in the dimmer switch. Imagine I took a large book, converted it to hex, and turned that into one long number. Then I prepended 0. to the front.
So you get "0.1939434....". Then I set the dimmer switch to that exact value.
But, if I want to look at the light, for some reason, I can only see if it's on or off. The chance I see it as being on is the same as the dimmer switch setting. (So if it's set to 0.5, then I have a 0.5 chance of seeing it as on, and 0.5 chance of seeing it's off).
I'm stretching this analogy a bit, but you can see that despite storing anything I want, I can still only read it as on or off.
So.. how do we use this usefully? We don't really know many practical uses, but what you can do is do calculations.
Say you put two of these lights in a room. Both are set to 0.5 brightness. With the case of the lights, the total brightness is now 1. So we've gone from having probability, to something definite. You are always going to see that as being on.
The analogy doesn't quite fit, but you can see how you can use the underlying probability to do calculations and get a definite answer.
IMNSHO, It's not really a 5-qubit register until you have interaction between the bits. That is their next step, but until then, it just doesn't count. The reason is that, other than the third "indeterminate" state that randomly returns "1" or "0" (which they also do not appear to have tested), without interaction between bits they might as well be classical bits. There is no computing advantage (other than true-random number generation) without the interaction. If they demonstrated the random-number generation capacity, I would admit that they have 5 1-qubit registers. But I won't give them credit for a 5-qubit register without demonstrating interaction between bits.
Mathematics is not a crime.
Maybe I don't understand the analogy...
Assuming that the light uses a dimmer switch as described in http://home.howstuffworks.com/dimmer-switch.htm/pr intable then the two lights will both be on/off at the same time (same sinusioudal source begin converted to on/off signal). So, the probably of light being on is still 1/2.
If instead, we use an old dimmer (with variable resistor), then it is simply the voltage that is adjusted and the light is on always.
If instead, we assume that light is being driven with a random (i.e. some unique source other than power signal) PWM that is high (light on) 50% of the time? If so, then the probability of _a_ light being on is 1-prob(no light on) = 1-(.5*.5)=.75 so it is not definate (and never will be unless the light state is deterministic).
Can someone adjust my thinking?
That isn't even true with real quantum particles. You can manipulate force fields in order to skew the quantum wavefunctions, making it more likely for the outcome to be one option than another.
Yes, the behavior is random in the purest mathematical sense, but just because something is random doesn't mean it's unpredictable or uncontrollable.
Suppose I had a 12-sided die, which had the number 1 on each face except for a single face, which had the number 2 on it. Clearly, the outcome of the die toss is still randomly determined, even though the number 2 is only 1/11th as likely as the number 1. If I were betting on such a die, I would certainly bet on 1.
Manipulating the potential to change the quantum wavefunction is sort of analogous to changing the shape of the die. If I squash the die so that one axis is longer than the other, and the "2" face happens to fall on the end of the long axis, then I have dramatically reduced the probability of the die ever coming up 2. (Try tossing a book in the air and see how many times it lands perfectly on its spine. Possible, but very, very unlikely.) It could happen, but perhaps only one in a million times.
A 5-qubit quantum computer isn't really that fast. It's about 32 times faster than a comparable 5-bit computer, assuming that both can perform a similar number of instructions per second. Right now, these people have created one register on a quantum microcontroller. This is hard damn work. However, if they can get up to 32 qubits, then their computer would be about four billion times faster than mine at a comparable speed, on an appropriate problem.
This sounds damn fast, and it is. However, as I noted, this is working on an appropriate problem. Reversing a string, a typical example task that doesn't paralellize well at all, takes just as long on a quantum computer as it does on a normal computer. To add insult to this, by the time someone actually creates a 32-qubit quantum computer, normal computers will likely have outstripped it in most tasks, leaving it mainly for niche tasks like factoring huge numbers.
This isn't to disillusion anybody. Often in certain fields, people have greater expectations from some technology than is really possible. While quantum computers may not be magic, they will still be very, very fast computers for tasks which work well with them.
"Anyone who attempts to generate random numbers by deterministic means is living in a state of sin." -- John von Neumann
You know what the solution to that is...
http://en.wikipedia.org/wiki/Dark_state
All theories that try to explain what we observe without entanglement have been disproven time and again. Bell's inequalities have been violated to 10 (or was it 50?) standard deviations and in various physical systems.
[1] One "regime" of quantum mechanics that has not been much explored (and where quantum computers would come in handy) is massive multi-particle entanglement: can hundreds, thousands or millions of particle be in strongly entangled states? Theory predicts it, few doubt it, quantum computers require it, but it has not yet been demonstrated. (If that was the intent of your comment, see this as a clarification, not an objection.)Quantum mechanics is is probably the most tested theory around, and entanglement is an integral and unavoidable part of this theory - I dont think there is particular need to "prove that it is for real"[1]. Einsteins dream of a complete, local realistic theory to describe nature is unlikely to come - nature just does not behave that way. And, frankly, I think it's much more fun that way...