
Light-Based Computers Using Quantum Principles 83
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."
I can see it now... (Score:1)
"I didn't... try walking toward it."
Re:the cryptographic race begins again (Score:1)
Another interesting light-based technology (Score:1)
http://www.simovits.com/archive/twinkle.pdf
And to all the scepticals out there: There are results that show that QC can achieve better results that standard computation models (factoring is not one of them as we don't know its hard). We've only merged from the level of understanding quantum bits to the level of having a few interesting algorithms. Give it a few more years for digestion and we'll know much more about what can and what can not be done with "non-standrad" tecniques.
Can't wait for the light-based Tetris.
Re:No link to quantum computers (Score:1)
super quantum computers (Score:1)
Re:Sounds very simple (Score:3)
Re:Does anyone think anymore? (Score:2)
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
NOT supposedly, here's the picture.. (Score:1)
Debugged [dhs.org].
Scientists discover content-addressable memory (Score:2)
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).
Re:No link to quantum computers (Score:2)
Re:When a scientist misspeaks? (Score:2)
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.
Re:Using Light (Score:2)
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.
Re:Shades of Traveller (O/T) (Score:2)
Re:Shades of Traveller (O/T) (Score:1)
I bought the rules and thought it was a pile of poo. The individual combat system was awful and it didn't seem to have the aura of fun that say D&D had.
Re:Shades of Traveller (O/T) (Score:1)
Are they worth anything ?
Re:the cryptographic race begins again (Score:3)
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.
Re:this mimics q. *interference*, not *superpositi (Score:1)
Re:formatting (Score:1)
this mimics q. *interference*, not *superposition* (Score:1)
Ultimate Radiation Resistance (Score:1)
Re:Sounds very simple (Score:1)
Limitations (Score:2)
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.
Re:the cryptographic race begins again (Score:2)
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.
Re:the cryptographic race begins again (Score:2)
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).
Re:Shades of Traveller (Score:2)
NMR quantum computer experements are also at room temperature, but have their own problems.
Re:This doesn't sound like quantum computing (Score:2)
This doesn't sound like quantum computing (Score:4)
Re:Iam Walmsley responds to my question (Score:1)
Re:formatting (Score:1)
Speed of light? (Score:1)
Re:Does anyone think anymore? (Score:2)
Did you get to the bit about Electrons? (Score:2)
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.
If parent AC is correct, please mod up like a mofo (Score:1)
TomatoMan
Re:No link to quantum computers (Score:1)
Re:No link to quantum computers (Score:2)
No link to quantum computers (Score:5)
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.
Greg Egan's "Luminous" (Score:2)
Egan's homepage can be found at http://www.netspace.net.au/~gregegan/. [netspace.net.au]
Journalist got his phonebook analogy wrong.. (Score:1)
The operations it takes to search through a million-entry sorted database isn't a million. It's proportional to log2(n). Think about it. Divide it in half. Is the current entry bigger or smaller? Bigger->Divide the bottom half in half and repeat. Smaller->Divide the top half in half and repeat.
So how many times can you divide a phone book in half before you're guaranteed to find your answer? log2(n).
Re:I can see it now... (Score:1)
Re:Does anyone think anymore? (Score:1)
-david
Does anyone think anymore? (Score:5)
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.
the cryptographic race begins again (Score:3)
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
Re:Shades of Traveller (Score:2)
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.
ramifications for quantum research (Score:2)
Just a funny thought... (Score:2)
Holographic storage, yes. (Score:4)
Disclaimer/shameless plug: I've recently compiled a semi-technical paper [ucam.org] on some of the theory behind quantum computing, as a project in our undergraduate physics course.
--
Re:Iam Walmsley responds to my question (Score:1)
Re:Does anyone think anymore? (Score:2)
Re:Journalist got his phonebook analogy wrong.. (Score:1)
Re:the cryptographic race begins again (Score:2)
However, Quantum Cryptography (properly called "Quantum Key Distribution") is another matter entirely. It doesn't rely on any computational problem being hard - it is based in the fundamentals of quantum measurement. Essentially, because of the fragile nature of quantum states, you can arrange that no eavesdropper can know your key - not even one bit of it - without disturbing it and so revealing themselves. Thus, you need never use an unsafe key again.
Not even a quantum computer can get around the fundamental limits of quantum measurement, and so QKD is provably secure against any future technological development.
StuP
Light Interference can't match Quantum (Score:3)
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
The perfect computer... (Score:2)
Help! (Score:1)
Doesn't the beam of light have to contain the data that the user is looking for so that the match can be made? How is the data encoded into the light and how much data can be encoded? Guess I need more info. It kinda strikes me that all that guy is doing is using the 2d method of storage and the availability of air as a transmission medium for light to establish a connection to EACH section of the data storage medium. What's that got to do with quantum computing.
Urgh. I'm feeling rather confused today.
Pinky: "What are we going to do tomorrow night Brain?"
Storage Medium (Score:1)
Pinky: "What are we going to do tomorrow night Brain?"
What a load! (Score:1)
My seventh grade social studies teacher showed us punched cards with the holes along the edges. You ran a long metal pin through the holes and lifted, and the cards where the edge was punched away stayed in the tray. Repeat for multiple WHERE clauses. At least that could handle multiple cards with the same value.
Hello (Score:1)
Unless you use a database of course...
Shades of Traveller (Score:2)
Though in Traveller, you didn't get better performance, you just got radiation resistance.
Re:Using Light (Score:1)
But the "power" of quantum algorithms over classical algorithms makes itself clear when you realize that all efficient quantum algorithms make use of a COLLECTION of quantum systems. When you take the polarization of a single photon and use polarization filters you essentially have a single quantum bit of information corresponding to the two polarizations. But in order to make a quantum algorithm, you need to put a bunch of these qubits together and they must interact in a non-trivial manner. Thus you need to get someway for the polarization of one photon to interaction with the polarization of another photon. This is really a pain in the ass to do without destroying the photon or the coherence of the polarizations.
So I guess what I am saying is that when you take a bunch of quantum systems and build a quantum algorithm, the power of the algorithm comes from the dynamics of the interaction of multiple quantum systems.
The fact that quantum computers are probabilistic and rely have a "collapse" of the wavefunction at the end of the computation are sort of secondary to the issue of where the power comes from.
dabacon
Re:No link to quantum computers (Score:1)
As for me, I'm betting on good old human ingenuity.
dabacon
When a scientist misspeaks? (Score:2)
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 article is BS (Score:2)
Re:the cryptographic race begins again (Score:1)
"...before brute forcing a 256 bit key becomes
feasible..."
Just remember that a 256 bit key has 2^128
_TIMES_ as many states as a 128 bit key.
That's 3.4 x 10^38 _TIMES_ more bits than a
128 bit key, or 1.56 x 10^77 total states.
A computer which is a billion times faster
still _CANNOT_ approach this problem. A
computer would have to be many QUADRILLION,
QUADRILLION times faster to even have a
chance.
C//
Re:Help! (Score:1)
the data that the user is looking for so
that the match can be made?"
----
I think so, yes. This is a search for key,
find value lookup approach, I think.
C//
Optical vs. Quantum Computing... (Score:4)
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
--
Sounds very simple (Score:1)
Prana (Score:1)
Don't you still have to scan the frequencies? (Score:2)
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?
Uh... no. (Score:1)
Re:This article is BS (Score:1)
all parties (many PhD CS and Quantum Physicists among us) agreed that it could not yield the power of a quantum computer.
"Hey John Q. Public! Concerned about the security of your encrypted data transmissions? Wish you had one of those whiz-bang QC's the Important People get to use? Here, buy one based on pure light! See, light is made up of tiny particles, so it's almost like having a QC of your own, without having to declassify the advances we've made on them!"
Just what I want... to compute on an EZ-Bake Oven.
Re:Parallel data retrieval... dear god... (Score:1)
While this is a neat trick, it isn't readily scalable and thus will be of limited use compared to a quantum computer. It is working in parallel, but with only 50 values. You could expand that number by using multiple units, but based on the capabilities quoted in the article the system can only be scaled linearly, while a quantum computer can scale exponentially.
Now if the can/do have a way to use those 50+ bits exponentially, that's a whole other story. All of this depends on how the data is stored within the tellurium dioxide and thus how it affects the light traveling through it representing the database. Although the method indicated is a linear search the article seems to indicate that it has much more potential.
In any case, either the article overstated things or did not report the technique correctly.
cryptochrome
Iam Walmsley responds to my question (Score:1)
You are correct in the statement that the scalability of our experiment is no better than that of a classical system. (I don't think the UR News Release claimed otherwise, did it? If so, I'd better check with our PR people!) The point is really a different one:
First, we have shown formally that any information processing system based on quantum interference alone (e.g. a single Rydberg atom, or a single photon) can be implemented with equal efficiency with an all-optical interferometer. The important physics here is to realize that with a quantum computer the information in the register has no reality until you read it out, and so you must account for the readout resources in determining the efficiency of the computer.
Second, we implemented an all optical version of Bucksbaum's Rydberg atom Grover search to show that our hypothesis is correct. The resource scaling in both is slightly better than that of Grover's second search algorithm, since we do not need the inversion-about-the-mean operation he proposed. Instead, we use part of the input as a reference beam and make use of interference to do the phase-to-amplitude conversion.
This might leave one with the impression that all interference based schemes, including those based on quantum interference alone, can never do better than a classical machine. But recent articles by D. Meyer (PRL, 2000) and E. Knill et al (Nature, 2001) show that interference without entanglement can be used to advantage over classical computers. Therefore we are now seeking to implement the algorithms they analyze optically, and to provide a measure for evaluating the resources needed for them.
Hope this helps - rest assured we are certainly not claiming that we can do everything full-blown quantum computers can, only those that are based on single-particle interference alone.
Parenthetically, one can look for a single marked element in a database of 2^50 items using our method quite easily, provided the database is binary encoded to begin with. But such encoding schemes are also available in classical machines. For unary encoding we are limited to 50-element databases. Perhaps this is what you meant in your second paragraph.
Best regards
IAW
Re:Iam Walmsley responds to my question (Score:1)
cryptochrome
My god, how many /.'s are QC's researchers! (Score:2)
Re:the cryptographic race begins again (Score:1)
Re:the cryptographic race begins again (Score:2)
The idea of quantum computation is to be able to perform complicated (multi-bit) computations using entangled states. For example finding prime factors of a number, can be solved in polynomial time. The proposed light approach as described in the article has no chance of achiving that. (I think)
So we should not be warried about proliferation of cheap quantum computers that can crack codes. We probably should not even worry about quantum computers that can crack codes at all for quite a while. (10-50 years depending on progress)
Re:Ultimate Radiation Resistance (Score:1)
------
#!/usr/bin/perl -w
What's the limitation? (Score:1)
Re:Sounds very simple (Score:1)
Re:the cryptographic race begins again (Score:2)
I think that the applications to cryptography should be mentioned. Both for this particular mechanism (low, imnsho) and for more general quantum computers. These eventual cryptography machines will be massive, dedicated, and initially incredibly expensive (think eniac). What they *can* be easily seen to be used for is all manner of brute-forcing attacks on data by governmental and/or large institutions.
Moreover, don't believe for a second that there will be "a slew of new possibilities for encryption schemes" that we'll see anytime soon. In fact, I suspect that it's precisely private data that will be exposed during early usage of new decryption methods; meanwhile, don't suppose that the various powers that be will ever allow an easily implemented, private, and quantum-secure data-hiding scheme.
Nietzsche on Diku:
sn; at god ba g
:Backstab >KILLS< god.
Parallel data retrieval... dear god... (Score:4)
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.
Re:Using Light (Score:1)
actual digital information through binary
code? Electricity runnning through
circuits. What is one way to get
electricity? Light. There, it's as simple
as that. I even made a formula for you guys:
Light = Electricity = Binary Circuits = Digital Data.
somebody once asked / 'could I spare some change for gas / I need to get my self away from this place' / I said 'Yep. What a concept. I could use a little fuel my self and we could all use a little change
-All Star, Smash MOuth
Re:Don't you still have to scan the frequencies? (Score:1)
Re:I don't get it (Score:1)