Slashdot Mirror
Quantum Computer To Launch Next Week
judgecorp writes "D-Wave Systems of British Columbia is all set to demonstrate a 16-qubit quantum computer. Simple devices have been built in the lab before, and this is still a prototype, but it is a commercial project that aims to get quantum devices into computer rooms, solving tricky problems such as financial optimization. Most quantum computers have to be isolated from the outside world (look at them and they stop working). This one is an 'adiabatic' quantum computer — which means (in theory, says D-Wave) that it can live with thermal noise and give results without having to be isolated. There's a description of it here — and pretty pictures too."
FTA .....
"Twenty years before most scientists expected it"
"It has been predicted that quantum computing will make current computer security obsolete, cracking any current cryptography scheme by providing an unlimited amount of simultaneous processing resources."
Just in time to crack Vista.
Sorry.. Couldn't resist...
k
Remember when Windows were washed, mice were trapped and UNIX guarded the harem?
I made this amazing water car once that went 300mpg with zero emmisions, but it stopped working as soon as anybody got in it. It was the weirdest thing. Now I understand that it was my quantum flux capacitor that was creating all the problems the whole time.
Adeptus
No trees were killed in the making of this post; however, many trillions of electrons were horribly inconvenienced.
It is not a general quantum computer.
It is a single instance specific formula calculator.
Any problem that can be recast as a two-dimensional Ising model in a magnetic field problem (AKA quadratic integer programming) can in principle be solved using the approach we'll be demo'ing.
Thats from their blog
There were some interesting questions asked and lots of people are sceptical.
liqbase
There still so many issues with quantumn computing that haven't been resolved yet. Like for instance how do you get the information out without affecting it...
Really, I don't think the Playstation 9 will need a quantum computer.
... i'd have heard of it in quantum computing class. But all we did was study algorithms and eventually reading breakthrough 2-bit model headlines in the news.
-- up-modding policy: make a good point, write self-contained.
Being that I live in Vancouver, I registered for the event. I certainly hope they toss me an invite!
Still #1 -- Lonely Gay Geek
But can it add 2 + 2 and get 4? I was lost after trying to understand the introduction ;)
Those who cannot remember the past are condemned to think "profiling is worse than the slaughter of innocent people..."
'And you can order one on the website TODAY!'
Most quantum computers have to be isolated from the outside world (look at them and they stop working)
This is often misunderstood. Quantum computers don't stop working when you "look at them", the "observer" metaphor is just a fancy way to say that the wave propagation of a particle collapses when it interacts with another particle.
Basically, imagine they are waves, propagating from the point of last interaction like expanding spheres. When two particles (spheres) touch each other, they collapse back to being single-point particles, and continue propagation anew until the next collision.
Which means, look at them all you want, just don't crack the casing open and point a torch inside.
Very nice! So when can I buy one? Does anyone remember the movie Sneakers? Now we can finally make Dr. Gunter Janek's little blackbox... Okay maybe not that little... Yet...
Wow! What a beauty. I think the 4x4 architecture is set up very nicely. Its to bad that using a system like this would be ineffective for personal use.
*Mac G5.....I thought that was a rap group*
Wrong. As far as current knowledge goes, a quantum computer is not a big help for cracking symmetric ciphers such as Triple DES or AES. It is a big help for RSA, since it can factor numbers in O(number size) time.
The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
The Russians have won. They have made the world a cesspool of distrust, greed, fear and hate.
Quantum computers even if they can be made practical , will only solve a small subset of problems in computer science that involve highly parallel number calculations or searches. They'll be little or no better than a standard turing machine for sequential (ie most) computing problems where the steps in the program can't be reduced to a simple mathematical formula or sequence or where branching levels are high.
So while various talking heads may waffle on about a new era in computing what they really mean is a new era in certain areas such as factorisation , whereas most of the computing world will carry on as before. Where not going to see quantum powered AI or whatever else we read about in the more on the fringe science mags anytime soon.
I am thinking that creating a Shift Register, and a Half Adder would be a nice addition. But I think that reserving my judgement till next week might be a good thing.
I have also noticed that 20 million dollars was used for startup capitol. If this is so, then the cost of computing power will be affordable using this type of computer more quickly than previous types of computers.
The expected app to be demo'ed will be Duke Nukem Forever.
"Tell me doctor, with all of your defenses, are there any provisions for an attack by killer bees?"
It may launch next week, but it's impossible to say where... </farnsworth>
One man's constant is another man's variable.
A couple of choice bits from the Slashdot post and TFA:
"Most quantum computers have to be isolated from the outside world (look at them and they stop working)"
"that can carry out 64,000 calculations simultaneously (in parallel "universes"), thanks to a new technique which rethinks the already-uncanny world of quantum computing. But the academic world is taking a wait-and-see approach"
I think I'll take a "wait and see" approach as well....anybody else smell bullshit?
A goal is a dream with a deadline
It ships to you 1 day before you decide to purchase it...
Nothing witty
The problem is, it is a black box. You could hide all the real logic in the interface, you could even be connected to a different box entirely. It is hard to see how this demo proves that anything works.
It reminds me of a 1930s example of a "perpetual motion" IC engine that ran on water. The con-man showed it running in an hotel room in Chicago, connected to the hotel water faucet. The trick, of course, was that he knew enough about the hotel to know that the water faucet was fed via a vertical pipe from the basement pump, and that he could safely pump a certain amount of kerosene into the pipe backwards since it floated on water. The engine was running on the kerosene.
Pining for the fjords
where do you put the cat?
[...]solving tricky problems such as financial optimization.
Q: Oh, you have quantum computers in your science lab, must be an interesting project you're working on!
A: Actually we're just counting bees in the woods.
Q: And what do you need quantum computers for?
A: Uhm, you know, these boxen are for finding ways to get proper funding.
Q: Ah.
A: Is that all you want to know?
Q: Yes...Oh wait!
A: What else?
Q: Did you just say "boxen"?
On second thought, let's not go to Camelot. It is a silly place.
They actually turned it on last week, and have spent the last few days trying to figure out if it still exists. It seems to both exist and not exist at the same time.
Well, most importantly, a while back I had read up on the research being done at Los Alamos National Laboratory on quantum computers. Granted, this was 4 or 5 years ago, they have an interesting paper[PDF warning] where, if you'll look at figures 1 & 2, you'll notice that the number of bits you are able to factor is directly related to the decoherence time.
Now, if you're not familiar with Shor's Algorithm, the values in the first figure might not mean much but, in layman's terms, I believe they were experiencing problems with 8 or more qubits. I remember reading that decoherence would destroy the relationship between the qubits before they could prepare them and do a meaningful computation. I had always thought that this would be an upper bound until someone figured out a way around it. If this computer is also using similar means, I'd like to know what special modification they did to overcome these coherence problems.
You're correct that there are a lot of important questions to be answered but a 16 qubit computer that is a "a single instance specific formula calculator" as you put it still interests me greatly and may be a giant leap forward in our ability to understand future computers that may be true full blown quantum computers. Why downplay this unless you can directly point out a problem with what they're doing and what they claim they can do?
My work here is dung.
"Quantum foam--take me home"(Crichton)
So simple, even my cat will be able to use it. Of course, the down side is that it'll cost him 3 or 4 lives every time he boots it up.
The Quantum Computer launched next week, becoming sentient and self-aware 5 minutes before being turned on. A worm-hole opened shortly after activation, preloading the Quantum OS 3 weeks ago that was announced next week and was ready for installation 2 years before the actual delivery date of February 9, 2021. 4 Hot fixes were waiting, in the quantum queu but won't be loaded until July 3, 2002 due to a lack of connectivity that was fixed in 2008.
Tasks for the quantum computer are:
Failure of the first 2 bullets have caused the new Quantum Computer to commit intellectual suicide and it now spends most of its time watching Buffy reruns and constructing 11 dimensional models of the Babylon 5 sets.
Politics is the art of looking for trouble, finding it everywhere, diagnosing it incorrectly and applying the wrong fix.
The real problem is that if you have a pet at home and one of these computers you'll never be sure if your pet is alive or dead.
It is by the juice of the coffee bean that thoughts acquire speed, the teeth acquire stains. The stains become a warning
...what programming language is best-suited for this computers?
I don't know why I can't stop thinking about FORTRAN.
Answer: Yes. Both.
${YEAR+1} is going to be the year of Linux on the desktop!
I find it interesting that quanutm computers are already getting so much press; maybe we should thank someone like David Deutsch (http://en.wikipedia.org/wiki/David_Deutsch for the great name of "quantum computer"). Because these things are so far from what anybody who reads an article about them, using the term computer is ridiculously misleading. I really believe that this field will explode and provide something more than obvious physics jokes. Until then, I want more people to realize that quantum computing is probably where digital computing was after World War II. MB
Easy.....investors. As someone else once said, "There's a sucker born every minute"
A goal is a dream with a deadline
does it run linux?
For some reason my fountain pen doesn't work here.
I'd tell you, but then I would lose my super position on Slashdot.
coding is life
That's not true, as far as I've read regarding attacks on symmetric ciphers with quantum computing. See these links:
y mmetric+ciphers+double+size&rls=com.microsoft:en-u s&ie=UTF-8&oe=UTF-8&startIndex=&startPage=1
http://www.google.com/search?q=quantum+computer+s
Specifically, it is said that a quantum computer gives a quadratic speedup in the kind of searches involved in breaking symmetric ciphers. That means it's enough to double the size of the key in order to account for quantum computing...
The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
I'll wait until the 32 qubit version comes out, it should be faster....
Does anyone else find it discouraging that the only example cited in the summary for applications of this technology was for "tricky problems such as financial optimization"?
One of the biggest advances in science, not just computer science, and it gets pointed at money.
sick
And Noah Replied...
"Riiiiiight... Whats a qubit"...
-Bill Cosby
Can't you imagine a Beowulf cluster of these?
Don't you wonder if it runs linux, or it powered by hot grits?
Get with the program please!
Taken from the blog post...
One very cool thing that we're planning to do in Q2/2007 is to provide free access to one of these systems to people who want to either develop or port applications to it...so if you have an idea for an app that needs a fast NP-complete problem solver, start thinking about what you could do with some serious horsepower.
think before you write, it'll save me moderator points.
God: Noah, I want you to build an ark!
Noah: Riiiiiiiight!
God: I'm serious. Build it so many qubits by so many qubits.
Noah: Riiiiiiiight! What's a qubit?
God: Um, I used to know that. Uh, that's not important....
--
PS - Yes, I know the difference between qubit and cubit, and if you've never heard Bill Cosby's "Noah" routine, I am entirely too old.
I'd rather have someone respond than be modded up.
---
the pen is mightier than the sword, the sword is mightier than the court, the court is mightier than the pen.
I swear, stories on /. about quantum computing are nothing but field days for people to post science-fiction they just made up.
Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
...and, of course, I want one.
Serving your airship needs since 1995.
Someone has a very fast factoring algorithm for quantum computers. Existence of said theorem does not imply that there aren't fast algorithms for other ciphers. But this is a /. quantum computing story whuch means people are allowed to post whatever BS they want and it'll get modded up.
Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
A small disclaimer: I work on QC.
I think we should all have an unbiased but intense look at what DWave presents. There is big scepticism in the community about adiabatic quantum computation. Specifically it is not sure that it solves the the problem which it is primarily claimed to adress, namely the decoherence. In some sense the Article DWave published on the preprint archive recently about the coupling is interesting. The article about "Thermally assisted adiabatic QC" is also interesting; yet for most of the QC applications it is believed that the computational power comes from entanglement. And entanglent and anything "thermal" in the same energy range seldom are a good combination. Dwave wants to demonstrate on a well choses problem set that their chip works. However there are a lot of thing which they did not discuss.
Some more observations:
1) DWave circumvents the normal scientific way of presenting the thing to the peers first. This is a habit among patent-collecting companies, but it for sure does not contribute in developing a trusting relatenship to the community. On the other hand I could also imagine that DWave is liked so little by a few people that they block papers. However this is nothing we know.
2) Geordie Rose is a little bit to agressive in intentionally devaluating the other approaches. His Blog Entry "Why I hate the Gate Model" is particularly interesting in that aspect. I agree that in his bussiness you sometimes have to kick competitors - sometimes that really helps. However this Entry is IMHO an intentional misunderstanding of what the "Gate model" is about. It is funny that quantum algortihms usually are defined in terms of gates. The task of building a quantum computer is to implement these gates. If you can make an optimization in the end (you can do e.g see Frank Wilhelm et. al), nice for you. Even if you write your Algorithm in terms of gates, nobody is forcing you to do them one by one. However to hate the gate model means to hate your task. But i think Geordies posts main intention was to direct the focus away from implementing an generic QC towards a specific QC. As much as I find his enthousiam about AQC good for the field, one should not redefine the term QC in order to have the most advance QC (Well, that would not be the first time that this happens....).
3) I am missing if they invited anybody from the field to check the experiment. I trust DWave in not faking, but still sombody should have a look at their calculations, ideas and at the final tests. Since they did not publish anythin it would contribute to my interest in this event if they would have some other "referees". Maybe they have.
Nevertheless, i wish DWave good success in the presentation. If the processor does what it is claimed to do, and that reasonable fast (e.g. solving the Ising Model in between 10S and 100S), it a showcase of the things which are yet to come. So even if the term QC should be argued about have this showcase of something non-trivial will help the field. I really hope that political condiderations will be put aside after that and that DWave will be evaluated hard, but unbiased by the community.
Ok Linux and Beowulf clusters we're not sure of, but the real question is will it run Duke Neukem Forever??
Aha! So that's a quantum computer in the bubble-head of the Robot!
The obvious and scary application for this is factoring public keys. If they can factor say 2048 bit keys in less than an hour then I'd say they have something.
Beautiful mirrors! (how long before it can play Doom?)
look at them and they stop working
No Fair! You changed the outcome by observing it!
General Relativity: Space-time tells matter where to go; Matter tells space-time what shape to be.
Any computer held together with Duct tape has got to be a success.
They make it sound like they have built a device that will solve an arbitrary instance of a particular NP-complete problem (the two dimensional Ising model in a magnetic field). Indeed, they argue that they will be able to solve any problem in NP by using a conventional computer to convert that problem to the one they can solve. It would be a major breakthrough to show that any NP-complete problem can be solved in polynomial time on a quantum computer, but I don't think they've done it. (Factoring can be done in polynomial time on a quantum computer, but is not generally believed to be NP-complete.)
From their paper, "The third, and perhaps most interesting, time-complexity result-- the possibility of exponential speedup on almost all difficult instances of NP-hard problems--comes from explicit numerical integrations of Schroedinger's equation to simulate adiabatic computation on sets of small instances of these problems..."
What they have is not a mathematical proof but some hand waving extrapolation based on small instances. Most likely what they have is a faster way to do simulated annealing. If so, it will give good, but not necessarily optimal, approximations to certain NP-complete problems. But approximations don't in general transfer across the polynomial time reductions used to convert one NP-complete problem to another. So their idea of having a front end computer that transforms an arbitrary problem to their Ising model doesn't look likely to work. Consider how magical it would be if you really could solve NP-complete problems in polynomial time. Almost any question in mathematics could be solved in minutes. Do you want a proof of the Riemann hypothesis? Chances are that if a proof exists it's reasonably small -- say, less than 1000 pages. (If it's much bigger than that no human will be able to understand it anyway.) Any such proof can be expressed in a formal language and verified in polynomial time by a conventional computer. So, just have your NP machine guess the proof and verify it.
Finally, keep in mind that this machine has only 16 qubits. A problem with just 16 qubits can be solved by brute force on your laptop computer. Any dreams about solving monster traveling saleman problems will have to be defered until they have at least a few thousand qubits.
In short, what they have may be a useful next step in quantum computing but it sounds seriously over hyped.
Just like me when someone knocks on my door at a public toilet. I stop "working", too.
It's been a while since I looked at QC, and the blog is a bit vague and hand-wavey, but he seems to intimate that their machine reduces NP-complete to "just polynomial." I was under the impression that QC could solve certain hard problems (Shor's algorithm for factorization), but couldn't reduce NP-complete to P. I'm rather skeptical.
With the uncertainty principle, maybe its already computing or not computing for a while yet :-)
(Maybe exaggerating this princple. You cant resolve a measurement finer than a quantum.)
A quantum computer could simultaneously generate all possible /. memes:
Does it run Linux?
In Soviet Russia, quantum states entangle you!
Here is a _picture_of_it_ [goatse.cx]
The idea behind an "adiabatic" quantum computer is that you can somehow set up a system so that the solution to a problem that you want to solve is encoded in the system's ground state. Thus, in principle all you have to do is cool the system down so that it's at its lowest possible energy level, measure it, and then "decode" the measurements to obtain your solution. The problem with this is that you can't necessarily know when you've gotten the system to be in the ground state; it is possible for it to get "stuck" in a slightly higher-energy state from which it cannot escape, as there might be a forbidden transition between its current level and the ground state.
:-)
This is analgous to a situation in atomic physics: if you've got an electron in an n=2, l=0 state, then it is hard for it to fall all the way down to the n=1 state because in order to change energy it has to emit a photon which changes its angular momentum and thus increases l, but there is no n=1, l=1 state there's only a n=1, l=0 state, and so the transition is forbidden. (Of course, this is an over-simplification that neglects things like the fact that the electron can change it's spin, but you get the idea.)
So you don't try to go straight to the ground system that you are interested in, because you don't know for sure that you can get there consistently. Instead, you build a system whose ground state you are sure you can get to, and then you slowly change the configuration of that system until it matches the one that you want to solve. Because you are changing it slowly -- i.e., "adiabatically" -- you should never leave the ground state (even though the ground state itself is changing right under you) and thus when you are done you are guaranteed to be in the ground state of your system of interest, from which you can obtain the solution to your NP complete problem.
There is a catch, though, which is that you have to have the system be *very* cold, and you have to change it *very*, *very* slowly. And here's where the catch can kill you: as the size of your system increases, the gap between the lowest two energy states decreases *exponentially*. This means that you have to make the system exponentially colder, *and* that you have to change it exponentially slower. Thus, adiabatic computers are not expected to be able to solve NP-complete problems in linear time, as there is still a cost in time (and cooling effort) which grows exponentially with the size of your problem. Nonetheless, it's likely that you can get a quadratic speed-up equivalent to Grover's search algorithm by building such a computer.
This, by-the-way, is why many quantum computing people believe that D-wave is ultimately going to fail -- probably not with this particular computer, but with scaling it up to the point where it's actually useful. But hey, maybe we're wrong and they've figured it all out; we can certainly hope that's the case.
Snarkiness is inversely proportional to wisdom because it emphasizes feeling right rather than being right.
I would have just said "scam" but you expressed it so much more elegantly.
Doesn't it make you feel good to know that our freedoms are protected by politicans, lawyers and journalists.
Parent is most valuable post here
For those of you who know some quantum mechanics, here's what's going on:
:-)
The idea behind an "adiabatic" quantum computer is that you can somehow set up a system so that the solution to a problem that you want to solve is encoded in the system's ground state. Thus, in principle all you have to do is cool the system down so that it's at its lowest possible energy level, measure it, and then "decode" the measurements to obtain your solution. The problem with this is that you can't necessarily know when you've gotten the system to be in the ground state; it is possible for it to get "stuck" in a slightly higher-energy state from which it cannot escape, as there might be a forbidden transition between its current level and the ground state.
This is analgous to a situation in atomic physics: if you've got an electron in an n=2, l=0 state, then it is hard for it to fall all the way down to the n=1 state because in order to change energy it has to emit a photon which changes its angular momentum and thus increases l, but there is no n=1, l=1 state, there's only a n=1, l=0 state, and so the transition is forbidden. (Of course, this is an over-simplification that neglects things like the fact that the electron can change it's spin, but you get the idea.)
So you don't try to go straight to the ground system that you are interested in, because you don't know for sure that you can get there consistently. Instead, you build a system whose ground state you are sure you can get to, and then you slowly change the configuration of that system until it matches the one that you want to solve. Because you are changing it slowly -- i.e., "adiabatically" -- you should never leave the ground state (even though the ground state itself is changing right under you) and thus when you are done you are guaranteed to be in the ground state of your system of interest, from which you can obtain the solution to your NP-complete problem.
There is a catch, though, which is that you have to have the system be *very* cold, and you have to change it *very*, *very* slowly. And here's where the catch can kill you: as the size of your system increases, the gap between the lowest two energy states can decrease *exponentially*. This means that you have to make the system exponentially colder, *and* that you have to change it exponentially slower. In general systems do not behave this badly, but it is expected (and possibly has been shown, I don't remember) that systems which can solve NP-complete problems *do* behave this badly. Thus, adiabatic computers are not expected to be able to solve NP-complete problems in linear time, as there is still a cost in time (and cooling effort) which grows exponentially with the size of your problem. Mind you, you aren't *forced* to move so slowly, but if you don't then you have a good chance of effectively kicking the system into an excited state and thus ending up with something that is not a solution to your problem. Nonetheless, it's likely that you can get somehow a quadratic speed-up (equivalent to Grover's search algorithm) over classical computation by building such a computer.
This, by-the-way, is why many quantum computing people believe that D-wave is ultimately going to fail -- probably not with this particular computer, but with scaling it up to the point where it's actually useful. But hey, maybe we're wrong and they've figured it all out; we can certainly hope that's the case.
Snarkiness is inversely proportional to wisdom because it emphasizes feeling right rather than being right.
Superb post. Many thanks.
There are way too many misunderstandings in this thread. I've taken a class at Berkeley on QC, and the best known quantum algorithm for solving NP-C problems is Grover's algorithm: http://en.wikipedia.org/wiki/Grover's_algorithm The hitch is, it only provides quadratic speedup rather than polynomial. So, a problem you can solve in O(2^n) time now takes O(2^(n/2)) time. This would be a big deal if you could make a sufficiently big QC, but it's nothing like the polytime algorithm you get for factoring with Shor's algorithm. There are almost undoubtedly other undiscovered quantum algorithms out there (for the most part there is only Grover's and Shor's so far), but I seem to remember a proof of some sort that you can't do much better unless P=NP (in which case you could solve NP-C problems efficiently on classical computers too!).
Parent would be insightful, actually. Guess not many know about Perl's Quantum::Superposition module.
:-)
Just when you thought that Perl couldn't possibly get any more confusing...
I remember the last time I led a screaming mob replete with pitchforks and torches, several people caught on fire and one stuck the guy in front of him with his hayfork. This lack of professionalism really upset me at the time; it's hard to make the right impression when you've got henchmen fist-fighting among themselves and rolling about on the ground.
You are correct in that the code ended with 'A'. In the original code, select did not matter, however a lot of non konami games ended up ripping the code for alot of their games when it was popular with the 'inside' crowd, and of course variations arose, with different ending keys for diff codes, or where select/start at the end mattered.
g ames
For the first few konami games, you had to put in the code either at the title screen, or while paused, so start simply started the game or unpaused, like you said.
I just now looked actually, wikipedia has a surprisingly long article on it, plus a list of games (both konami and non) that used that code.. atleast one is as new as the nintendo Wii!
http://en.wikipedia.org/wiki/Konami_code
http://en.wikipedia.org/wiki/List_of_Konami_code_
Posting with no karma bonus due to offtopicness...
I know some people still do math in their heads... but... this is it when they figure it out right? I mean you'll need a computer to think for you as soon as you get out of practice... (because it will finally be better) (?)
This of course is a perfect example of where it actually IS appropriate to point a torch.
...so I can be the first person running Linux on an unopened Xbox (or Xbox 360) with just a burned Linux CD.
"Screw Sun, cross-platform will never work. Let's move on and steal the Java language." - Visual J++ Product Manager
Quantum Computer To Launch Next Week
Of course, they released it last year, but because it is backwards compatible, for some people it won't show up until next week.
Shipping was a problem. It's pretty black and white that most people will just find a humdinger of a cat, which they are likely to shrow out the window as soon as they open the box. The cat, as the tail goes, landed on all four feet, and scientific circles pawsed to argue that it should be meters instead. But employing meter-made cat women would be to batty an idea.
The rest of the people caused them to fall asleep, and their computers were stolen.
Have you read my journal today?
I'd been nebbing for some time for a satisfactory perspective on what 'adiabatic' means. Community like htis is why /. is so cool.
baggage-handler-in-the-middle problem.