Qutrits Bring Quantum Computers Closer
KentuckyFC writes "To do anything useful with quantum logic gates, you need dozens to hundreds of them, all joined together. And because of various errors and problems that creep in, that's more or less impossible with today's technology. Now an Australian group has built and tested logic gates that convert qubits into qutrits (three-level quantum states) before processing and then convert them back again. That makes them far more powerful. The group says that a quantum computer that might require 50 conventional quantum logic gates can now be built with just 9 of the new gates. What's more, the gates process photons using nothing more than standard linear optical components (abstract on the physics arxiv)."
Throughout the heyday of personal encryption, when Zimmerman was maintaining PGP and Bruce Schneier's Applied Cryptography was released, we kept hearing about how it would take thousands or millions of years to crack just one PGP message. Now we hear that computers that could break these messages might be relatively just around the corner. It's got to be a real disappointment and source of worry to people who did use PGP to encode the secrets that they are desparate to hide.
Does it run linux?
...quantum logic gates...logic gates...qubits...qutrirts...quantum states...quantum computer...quantum logic gates...gates...gates...photons...linear optical components...
For some reason, this reminds me of this post on about blogs on xkcd.
Is crushing a suspect's child's testicles illegal?
John Yoo: "No, [if] the President thinks he needs to do that."
A "gate" is roughly the equivalent of a transistor. Kind of. Think of it like a lot of transistors all put together.
Oh it's simple. The cat could be not only alive or dead, but also could be on life support.
Or maybe the cat will be spinning because someone stapled a piece of bread with jam onto the cat's back.
i thought once I was found, but it was only a dream.
Naturally, I read that as "qutits" the first time.
How can I believe you when you tell me what I don't want to hear?
No fair, you changed the state of the cat by measuring it!
Give the computer a nice cup of hot tea. From Douglas Adams "The Hitchhiker's Guide to the Galaxy" "If he thought to himself, such a machine is a virtual impossibility, then it must logically be a finite improbability. So all I have to do in order to make one is to work out exactly how improbable it is, feed that into the finite improbability generator, give it a fresh cup of really hot tea...and turn it on!"
Laters Sol "Have you found the secrets of the universe? Asked Zebade "I'm sure I left them here somewhere"
What this is basically saying is that instead of operating a quantum computer with 2 levels, 0 and 1, they are operating with 3, 0,1,2 lets say. According to my computer architecture prof 3 levels is the most efficient way of making computers, from a number of components standpoint. Its hard thinking in base-3, because things like inverters become meaningless. AND and OR gates still work with a reasonable amount of understanding. Things like multiplexers and decoders make sense. If you can get into the macroscopic level of design its pretty understandable. You can use 3 trit words to do base-27 in a similar way to using 4 bit words and hex.
Finally some games coming out for the quantum computers. I can't wait to see what Alexey Pajitnov would have done with this hardware.
Hear recorded Slashdot headlines on your phone! New service beta testing. Just call (248) 434-5508
And a transistor is kind of like a tube. (remember in the 1960s when they replaced all those tube radios with transistor radios?) So really, when it comes right down to it, the Internet IS really a bunch of tubes.
So does this mean that quantum computing will be based entirely on trinary code? Will those conceptual/theoretical trinary programming languages finally get some time in the sun?
The word "gates" has almost the same meaning in quantum computing as in the classical computing. In classical computing a gate operates on a set of bits and changes them to another set of bits. In quantum computing it is the same with qubits playing the role of bits.
:)
Of course funny things are possible in quantum computing. For example it is possible to make a "square root of not" gate, that when applied *twice* to the qubit |1> produces |0> and vice versa. Applying once creates something else (the square root of not in some sense).
One particularly handy way to think of quantum gates is to think of them as a matrix (operator) that operates on a vector (input qubit) to produce another vector (output qubit) just by multiplication. So if A is some quantum gate (matrix) and u is input qubit (vector) the the output qubit (vector) v = A*u . The matrix A needs to satisfy some technical requirements that gives quantum computing some nice features (like every algorithm is fully reversible and so on), but those details are not needed to get a rough idea.
don't be silly, no one gives a shit what 99.99% of people here sent using PGP. Governments, banking system, financial markets, megacorps will be the ones to worry.
Yes and no. I mean, the problem that you point out is only exists because a quantum computer is cracking an encryption that had to run in reasonable time on today's computers. But quantum computers don't have to be just one way like that... now you would have at your disposal a computer that can run encryption that would take thousands or millions of years on todays machines, on your data.
"When life gives you lemons, don't make lemonade. Make life take the lemons back!" -- Cave Johnson
Somewhat. Private key schemes are still secure.
The real power of quantum computing will be in factoring primes. Which most certainly will affect public key crypto, but public key was never the FULL solution. Like anything in crypto different problems have different solutions.
Public key crypto is great in the web age because you can use it for establishing connections, exchanging private keys, etc.
One of the first things you learn in any crypto grad class is that creating the crypto schemes is only part of the problem. Creating the usage scheme is the other. Most man in the middle and other such attacks can defeat the algorithms by which we use crypto far easier than we can defeat the encryption itself. (or just social engineer your way past it)
While it does suck a bit that the heyday of public key crypto might come to an end because of quantum computing, some other scheme will take its place. Perhaps someone will come up with a key gen scheme that doesn't rely on the difficulty of factoring large primes and instead some other mathematical relationship that quantum computing won't be able to stop.
Perhaps the optimal solution will be a mix. Perhaps each public key will in fact be 2 operations. One large prime factor to defeat traditional systems, combined with some as yet created scheme that stops quantum systems (but may be easy to beat on a tradition system).
As with all things, crypto will adapt. Perhaps one day we'll figure out a way using quantum mechanics to create true OTP encryption. Maybe 2 entangled particles or something (I know technically this is impossible, but just making the point maybe there's something we don't know yet that will help us in the future implement todays theoretically impossible/infeasible crypto)
My sig is better than your sig.
What I want to know is... when do we get a quantum computer based on Quatloos?! And can you imagine a Beowu... never mind!
Bruce Lane, KC7GR,
Blue Feather Technologies
I trust you read the summary. The neat thing about this is that you need fewer gates to do the operations with qutrits than with qubits. Fewer gates means that the machine is easier (or even possible) to construct. It seems to me that it is a short-term gain. As you point out, you are doing more work to achieve the same outcome, although I don't know where you pulled your numbers from. It's not a 50% increase in processing; they were able to do the work of 50 gates with a mere 9, which is a five-fold increase in processing.
www.timcoleman.com is a total waste of your time. Never go there.
What's a Qutrit?
(Emphasis added)
You might die tomorrow. Hurricanes might devastate the western world. Aliens might show up and blow the planet to bits for housing such a greedy, self-centred species. Any number of progressively unlikely things might happen.
There's no real substance to the rumours of encryption-defeating quantum computers - it's a hypothesis somebody proposed a few years ago, which has never been proved or disproved. We don't know anything about it yet.
Yes. :)
As for quantum computing: don't get your hopes up. There's no proof of concept that shows that QC will ever scale up to practicality. Every 6 months someone announces a "breakthrough" and gains plenty of funding, but in the final analysis, nothing ever comes of it. I'm convince that there are some fundamental things that we don't understand here, and that all we're going to get out of QC is a better understanding of how to scale down existing computational engineering models (which is a good thing, but not the promise of QC).
Qutrits with optics is cool, but is the quantum computer just around the corner? Most definitely not! Optics are great for communicating quantum information, not so much for storing them. Quantum memory needs solid state technology, and while some promising results have been reported using diamonds by researchers at Harvard and other places, the quantum computer is still many many years, maybe even decades away. TFA is overhyped, as seems to be the case with all articles reporting quantum computing breakthroughs!
Too bad I lost my mod points yesterday. This is the kind of thing people actually come to Slashdot for. I'll just have to try to contribute instead.
:)
Here's some further detail for those interested: the |1> and |0> qubits are actually vectors of probabilities. (Well, probability "amplitudes". More on that later.) The |0> bit means [1 0] and the |1> bit means [0 1]. The "|.>" notation is a bit of convenient shorthand.
If you have two qubits, you'd represent them as |00>, meaning [1 0 0 0]. (That's four possibilities for the qubits, and all the probability mass on the first: both off.) |01> means [0 1 0 0], |000> means [1 0 0 0 0 0 0 0], and so on. Note the exponential growth.
A quantum gate is nothing more than an operator of the same type that governs all discrete quantum system evolution: a unitary matrix. Think of a rotation matrix of rank 2**(number-of-bits), but in complex space. It's got to be some kind of rotation - it must preserve length - to preserve the property that the qubit states and combined qubit states are probability (amplitude) distributions.
A "square root of NOT", IIRC, is an operator (rotation) that turns [1 0] (or |0>) into [sqrt(1/2) -sqrt(1/2)]. Do it again, and you get [0 1]. Again, and you get [-sqrt(1/2) sqrt(1/2)], and again yields the original [1 0]. (I may have some signs wrong.)
The reason this cycle works at all is that the states aren't probabilities per se, but sort of square roots of probabilities, which allows them to keep extra information. This is called "phase". Much of the exciting weirdness of computing with quantum gates is that phase isn't strictly real, but in general has imaginary components.
The other exciting weirdness is of the massively parallel sort. If I do a computation on [sqrt(1/2) -sqrt(1/2)], it's sort of like doing the same computation on [1 0] and [0 1] in parallel. The tricky part is that measuring the outcome restricts me to just one of the results! One way to express the dilemma is that I can compute an answer for every possible input simultaneously (which would be great for solving NP problems), but that I can't easily select the right answer.
Another way to express it is to say that the cat is in a superposition of dead/alive, which will localize when I observe the poor beast.
I got my Linux laptop at System76.
The limit for quantum computing is currently space, the number of qubits you can keep at the same time is still very limited and AFAIK current QCs don't have the space to store a 2048 bit key.
Justice is the sheep getting arrested while an impartial judge declares the vote void.
The problem as I see it is it's not the cat that is in quantum entanglement with the particle hitting the switch, its the gas releasing. The cat is just the poor bastard observing. The cat also has 3 possible states - live, die by gas release, die from natural causes waiting for the damn particle to hit the switch. cheers
I'm a visionary!
3-State Bit
Asin trinary? 0, 1, dead cat?
www.isoHunt.com
Does this mean that quantum computing is just bring us back to analog computers?
(Actually, I guess, if my elliptical thinking here is anywhere close to meaningful, I guess the idea would be that a quantum processor would allow building complex reprogrammable filters (amplifiers) that don't require iterations. (Not talking about the simple analog filters, of course.)
My son seems enamored of analog computing these days. I remember when I was, as well. Maybe, the babbling above being completely wrong notwithstanding, it's a little early to dismiss analog computing as just a failed path in the problem tree.
I really wish I understood what I am not talking about.
Computer memory is just fancy paper, CPUs just fancy pens with fancy erasers; the 'net is just a fancy backyard fence.
Bah! Back when I was a kid we had only two logic states and we were happy to have them!
"The word "gates" has almost the same meaning in quantum computing as in the classical computing..." Does this mean we're already stuck with Vista as the operating system for quantum computers? Or do we need (64 x 3) "192-bit Vista", sure to ship before, oh, let's see, 2020?
In this context, it probably means something like a logic gate, although the operations on 3-state gates might be different.
http://outcampaign.org/