Light-Based Computers Using Quantum Principles
Maddog2030 cites a story at Science Daily, writing: "Here's an interesting twist to all the news on quantum computing. A computer running similarly to a quantum based computer, except it runs on light at similar speeds for particular tasks. It also rids itself of the many complications introduced by quantum computing."
Because it's cheating. First of all, because it has got nothing to do with quantum computing. Searching a database in parallel is only one aspect of quantum computing. Other aspects, like Shor's algorithm, totally depends on entanglement, which is something completely different from interfence. It's even worse, Shor's algorithm uses the fact that the combination of entangled states and partial measurements result in the destruction of interference. The second reason is that it will take you a rather long time to find out which of the 50 frequencies is altered. You have to do an interference measurements, which involves measuring light intensities with a moving detector. This is slower than a clasical computer.
The device in question works using interference of light waves, interference which can be described using a classical wave-only description of light: i.e. light can be treated as a wave propogating in a 3-d field of real-valued vectors that describe the magnitude and direction of E and H at each point in space.
This is in contrast to quantum interference, which generally involves the superpostion of state vectors in a Hilbert space (of complex valued wave functions).
-David
I kind of like the mudslinging here between the quantum and optics camps, but has anybody else been troubled by the glossing over of spatial complexity here? Anybody can build a device that will solve a problem in one step. The spoiler is that the device will grow in size (or in this case, frequencies) proportional to the complexity of the problem. The QC paper on database searches did this: they claimed that a "conventional computer" could only search n items in O(n) time. But "conventional" devices have been built which find an item in O(1) time, eg by indexing the items by value. It seems like we have a mutually interfering group of entangled misconceptions here.
Heck, you could probably shoot radar at the surface of a hard disk and tune it to find a particular bit pattern, "billions of times faster". Would that violate "classical computing limits"? Not at all.
Overall, I would say that this is a step in the right direction. If you read the article you'll find that the stumbling block was that the optical crowd thought that the particles had to be entangled for a device to work. I suspect that this misunderstanding arose from Deutsch when he used the term incorrectly to describe a QC.
Maybe next they'll discover that a DRAM can fetch a value from any location *in one step*. My gosh, that's amazing. (OK, I'm sarcastic, but I think the physicists have to be a bit clearer in proving that their whizbang devices are not spatially complex...and yes, I am reading the papers to try to clear this up).
---- "If we have to go on with these damned quantum jumps, then I'm sorry that I ever got involved" - Erwin Schrodinger
Yes, they seem to be ignoring spatial complexity here. That was my reaction to the quantum paper on the same thing.
---- "If we have to go on with these damned quantum jumps, then I'm sorry that I ever got involved" - Erwin Schrodinger
Yes, I think the field is incredibly strange and wonderful, but not for the physics. The ignorance and mutual misdirection are entertaining. What other field has physicists, philosophers, and computer scientists, all misunderstanding each other in fundamental ways? Now we have the optics community involved. Maybe at least we can separate the wave mechanics from the rest of it all, if there is any remainder.
I'm not trying to start a flamewar, but the claim that QM implies nondeterminism also falls into the unfounded hyperbole category. As someone wrote in Physical Review Letters a while ago, the stuff about trajectories not existing, and instantaneous quantum jumps, many worlds, etc., is a good way to keep from presuming too much information about a system, but it's not a proof of any deeper reality.
---- "If we have to go on with these damned quantum jumps, then I'm sorry that I ever got involved" - Erwin Schrodinger
I'm about at the same stage of understanding. I suspect that wave mechanics (as the opticists used) may underly a lot of the claims. QC relies heavily on Bennett's work in reversible computing. The idea is that information, and its underlying physical representation, can flow both ways through the logic gates, just as light can propagate or resonate both ways in an optical system. If the system is stable (that's something I'm not convinced of), then the observed wave function should reflect the proper relationship between the "input" and "output" (even if we, say, put in a known output and want to reverse to an input). Measurements against such a system should yield statistics that reflect the wavefunction at different parts of the system, and the wavefunction will represent something about the information we're seeking.
I don't see anything so mysterious about this. QM brings on a lot of handwaving (eg Deutsch's claim that QC "proves" that the many-worlds interpretation is correct), but I believe the opticists are on the right track when they say a lot of the logic can be done in non-quantum systems. QM at best provides a good source of waveforms to put through our interferometers.
---- "If we have to go on with these damned quantum jumps, then I'm sorry that I ever got involved" - Erwin Schrodinger
I did, but not nearly as much as this guy. I still have them Little Black Books to prove it, too!
**>>BELCH
No one has ever shown that quantum computers could break a symmetric encryption at more than twice as fast as brute force, and the actual clocking of quantum gates is not that fast.
What everyone is talking about with encryption is Public Key, where quantum mechanics may be able to reduce the brute force test to n operations given an n bit key, and n quantum gates. This is particularly true of those built on prime numbers.
While this does sound very neat and seems like a fantastic idea, it does seem to have a few inherent limitations.
In order for this light interference method to work most efficiently, a single beam of light must be able to shine on the entire database at once. For small databases, no problem, but for large ones it seems an impossibility. Why not just do part of the database at a time? Well then you lose the reason you were doing this for in the first place, which is to make a single request to the database and come up with your answer.
Another limitation with the size of the database is the number of frequencies that the light must be split up into. I'm not sure of the actual number of frequencies that we know how to split light into, but there must be some limit. Potentially, with quantum computers, there would be no limitations. Just add more qubits.
So while this does sound very cool, I don't see it replacing quantum computers as the next big leap in computing.
---- El diablo esta en mis pantalones! Mire, mire!
you're thinking that an increase in speed of merely a billion times (or ANY physically possible multiplier) is going to help you brute force 256 bit keys?
</flame>
I suggest you go check up on the properties of exponents. A billion times faster is the same as reducing the keyspace by 30 bits: leaving you with a task equivalent to bruteforcing a 226 bit key on current hardware. If you make it a billion billion times faster, I need merely add 60 bits to my key to regain the previous level of security.
The thing about quantuum computers is that they are good at reducing the order of complexity of certain computations -- in this case factorisation. You only need to start worrying about symmetric keys when a quantum computer can solve NP problems in P time. But then you REALLY have to start worrying, because ALL symmetric ciphers are in NP.
Not possible. If all the energy of a supernova could be channeled into a ideal computer that did nothing but count, it would only get up to 2^219. (from Applied Cryptography by Bruce Schneier). Brute force attacks will never work against keys of sufficient length; you will need to find a weakness in the cryptographic algorithm (or find the sticky note the user wrote his password on, which is a much better bet).
How to solve most of our problems: 1.Lots of nuclear plants. 2.Cure aging.
Photons are pretty stable against these kinds of interference, since they don't interact strongly with matter. So, as long as you use high quality optical elements, you can do quantum computation experements at room temperature. Unfortunately, the lack of interactions makes it hard to implement quantum gates, making systems larger than 2 qubits difficult.
NMR quantum computer experements are also at room temperature, but have their own problems.
No, with this sort of device you do not have to iterate over the frequencies. If the 'on' bits of the modulator retard the light passing through them by, 2n-1/1 wavelengths and the off bits have no effect then when the beam is recombined you can just bounce it of a grating/prism into a linear array of detectors and there's your answer. The slow bit is reading the detectors, ie. as usual its the optical->electronic bit thats slow.
This sounds more like holographic computing, rather than quantum computing. In QC, a search would involve manipulating the system until one state is left. In this article's example, you still have to iterate over the frequencies to find the frequency that changed. As I am given to understand QC, were this a true analog to QC you'd simple have one color standing alone, with no searching.
www.eFax.com are spammers
I suppose a unit of quantum speed could be how long your average gate operation takes. In an ion trap QC it's about 10^-3 s. Or a clock speed of 1 milliHertz. Crap, in other word.
:wq
If you didn't get basic atomic structure in grade school you should just be taken out and shot.
They pretty much glossed over any details. I'll wait for the article in Nature.
I'm trying to teach myself to set people on fire with my mind... Is it hot in here?
There are 7-qbit quantum computers.
-no broken link
Another example is finding the bounding convex polygon for a set of n points. I don't remember the runtime for the algorithm, but for the real world it's O(n): you get a board, nail in the n points, then find a rubber band and wrapp it around the nails.
The article describes another one of these problems that is solved faster with a physical process, in this case looking up a record in a database. By physically encoding data differently, you can find a record in a large set in a single step (well, maybe not since you still have to FFT the light to find the frequency, so I'm still not sure how this is faster than the O(log n) of an index, remember FFT is also O(log n) where n is the number of frequencies, and you need the number of frequencies to be the same as the number of records so it seems equivelent to me, but there may be some other way of determining the frequency of the altered light).
This can't be used to crack RSA, and it's not a general method of algorithmically running through a large number of possiblilities concurrently, which we get with quantum computers. There may be a way to crack RSA generically with a physical process (didn't Shamir come up with an optical process for 512 bit RSA). But this has nothing to do with that.
-no broken link
Egan's homepage can be found at http://www.netspace.net.au/~gregegan/.
Lawrence Person (lawrencepersonh@gmailh.com (remove all "h"s to mail)
http://www.lawrenceperson.com/
That article was insipid to the point where I couldn't finish it. A few points in the first few paragraphs are worth mentioning:
1) Quantum speeds? WTF is that? There's no such unit, not even associated with quantum computing.
2) The device "mimics quantum interference". No, it's light; it displays quantum interference. Light is photons, quantum particles. Dur.
3) "performs some tasks a billion times faster". This is what I call a 'crazy number' since it's not based on any sort of measurement and thrown in only for show-value.
Don't get me wrong, I'm active in QC research and I like what the folks at Rochester are doing, so, too, the folks in an optics group at Los Alamos. But whoever wrote that Science Daily article is whacked out. It cheapens everything.
So, it looks like this thing can do computations about a billion times faster then conventional methods....that's gotta knock a hole in current key lengths and security...I wonder how fast this thing has to get before brute forcing a 256 bit key becomes feasible. (big math people out there anywhere?)
Fortunately, that should also offer a slew of new possibilities for encryption schemes that were previously too slow or bulky.
On your mark, get set, encrypt
----------
ah honey, we're all resplendent - Bill Mallonee
In our real spacetime, you probably won't get radiation resistance. Quantum effects are all extremely susceptible to any sort of interference. AFAIK, any sort of quantum computing device only works as close to absoulte zero temperature as you can get.
what does this do to all the companies spending *billions* on quantum research? does this mean they are screwed? or does this mean they accelerate their research? i hope for the latter... (not just because i work for one, i assure you...)
The REAL sam_at_caveman_dot_org is user ID 13833.
The term debugging originated supposedly when they found a bug in between the relais of one of the first computers. I was just thinking what would happen if they actually build one of these machines and had to debug it: would they find a firefly??
Disclaimer/shameless plug: I've recently compiled a semi-technical paper on some of the theory behind quantum computing, as a project in our undergraduate physics course.
--
Escher was the first MC and Giger invented the HR department.
In analysing this sort of thing, the "size" of the problem is usually taken as the logarithm of the number of entries (ie the number of bits required to label each item). Since the strength of the output beam decreases linearly with the number of entries, it falls off exponentially with problem size.
Now, it can be shown that even with a Quantum Computer, the best we can do is to speed up the search by the square root of the number of entries. So 10^6 entries takes 10^3 searches, and so on. This isn't an exponential speedup (which is impossible for Unordered Search), but I can't see that this "light interference" method could match a quantum machine.
And it certainly couldn't match the exponential speedups on Factoring, the killer app for Quantum Computing.
StuP
This would be the perfect computer to crack open when you're drunk/stoned/whatever. "Wow, look at the pretty colors....wooowww...."
The Blaster Master Fighting for Truth, Justice, and Evil Pie since 1979
Anyone ever spend the extra mega-credits to get a fiber optic based computer for their starship?
Though in Traveller, you didn't get better performance, you just got radiation resistance.
As has been pointed out by many posters already, this is not what nearly all researchers would call a quantum computer. A universal quantum computer, from a physicists perspective, is a computer built with pieces which obey quantum mechanics AND can be used to EFFICIENTLY simulate the effects of systems obeying quantum mechanics. This EFFICIENCY condition is extremely important, because, for instance, your classical computer can simulate quantum physics...it just takes it a hell of a long time for most reasonably sized problems!
The device described (poorly) in the article fails to achieve an efficient simulation of quantum systems because the number of frequencies needed in order to perform a given simulation will scale exponentially in the size of the quantum computer being simulated. Albeit technologically interesting, the computation performed by the experiment is not something which a classical computer cannot do as efficiently.
But what really troubles me is the quote attributed to Walmsley in the article:
"We wanted to show that the implementations which have been done with quantum computing have an exact analogy that is just as effective in light-based processes," says Walmsley.
Just as effective?! That is a just not true. Is this a case of a scientist being quoted out of context or is it a case of a scientist who doesn't understand the issue?
Yes, MTIOQC (my thesis is on quantum computing), so I feel like I have a little bit vested in this issue. Being so biased, I hope that this is just an out of context mistake.
I would like to think that our enlightment grows with time, but every new article I read about quantum computing research seems to be filled with more and more hyperbole (oh do I hate the words "paradigm shift" and "synergy") and less and less good science. Don't get me wrong, I think quantum computing has a promising future both in actual future practice as well as in helping shed light on areas of physics (We all learned that quantum mechanics destroyed the computer-like determinism of Newtonian mechanics, but now we think that, while the universe is not a big classical computer, the universe may be a big quantum computer!), but irresponsible press releases drive me bonkers.
dabacon
This is definitely not scalable. They claim it runs at "Quantum speeds" which isn't even really a word. There is no such thing as "Quantum speed", a quantum computer can take just as long for any particular algorithm as a classical computer, the special thing about QC is just that the speed scales polynomially with input size rather than exponentially. This is *not* true of the light interference system they describe, for many reasons some of which have been pointed out here already. (The time it takes to iterate through the outputs, the size of the beam, the number of beam splitters you would need, and the limited bandwidth of the light spectrum). None of these things scale polynomially with the input size so claiming that this is a substitute for Qc is nothing more than a trick to get funding. Plus, the idea isn't exactly new. I attended a conference on Quantum Computing at Georiga Tech over a year and a half ago where we discussed this very idea, and all parties (many PhD CS and Quantum Physicists among us) agreed that it could not yield the power of a quantum computer.
Yes but quantum computing Sounds So Much Cooler....
In all seriousness, this is the sort of situation where the Internet is more a hinderence than a help. Over time discussions such as this will polarize the lay community either for or against a particular area of research, wher two areas of research strive to achieve similar goals.
Public Opinion greatly influences funding of research, so I hope that premature dabates of which technology is superior, won't shape decisions to fund one or the other, since ther is the possibility that one or the other area of research might hit a brick wall at some time in the future, at which point it wll be nessecery to pursue the other area of study. It would be bennefitial to all to have continued both areas of research in parrelel.
Don't get me wrong. I don't believe that discussions like this alone will influence the course of research, but merely that the colaborative enviroment the Internet offers will promote (suprisingly) colaboration to the point where only one research path will be pursued by both teams, working together, rather than competing, as it were.This is an area whewre competition is a positive thing in academic research. I merely question the degree to which the Internet actually contributes to this.
--CTH
--
--Got Lists? | Top 95 Star Wars Line
So we convert the problem from scanning a spatial array to scanning a frequency array. Don't we still have to analyze the frequencies to figure out which one has been altered?
I suppose that each frequency could go to a parallel detection array, which would then drive some sort of interrupt, however this would seem to become unwieldy as the problem space increases.
Can someone explain further just how the detection of which frequency of light was changed would actually work in practice with a large problem space?
So far we have 3 people posting who claim to be doing Quantum Computing research. No wonder we're not getting any closer to getting a QC built.. all the researchers are posting on slashdot all day.
*smirks*
Let's look at the story for a second here folks.
The scientist set up a data-storage device (in this case an acoustically massaged medium), then an information retrieval was carried out against the medium. This retrieval was carried out in parallel. Now this is fairly exciting news, but it has some serious distance to go before it manages to become something general enough to threaten the intellectual-share of true quantum-entaglement computing schemes.
The promises for the device so far seem to be in determining data returns along mulitple paths. In effect, the thing is performing the many many calculations (in this case actually only data-retrievals). However, it's performing them in parallel.
In addition, I'm curious as to how the data is retrieved. If the recombinant beam must be compared to the original beam along all the frequency divisions, there's another indivisible operation requiring some length of time.
But....
It is an interesting method of encoding/decoding data from a medium to a laser without transducers. I'd say that this technology has great promise as a method to be derived from to create all-optical switching fabrics that are actually data-sensitive (how'd you love it if you could decode, process, and filter packet data from the very laser transmission that carried it down the fat fiber pipe...?)
Nietzsche on Diku:
sn; at god ba g
:Backstab >KILLS< god.