BetaBenj sent us the latest update from
TechWeb concerning the latest advances in solid quantum computing. Recently, there have been a couple key advances bringing us closer-but we're still a ways out. Still, the ramifications of it are
almost as staggering as nanotech. Almost.
Human Nature (Score:1)
Keeping that statement in mind, is it any wonder why people get excited about breaking into a secure computer system? Most mainstream people are appalled at crackers attempting to gain access to a secure system, yet here the same impulse is driving research that could fundamentally change our lives.
I just always find it interesting when human nature morally cris-crosses itself....
--Mid
Re:Why oh why must I die!?!?!?! (Score:1)
Of course, remember the words of Scott Adams... "The average person alive today will experience 80 complaint-free years of life. Unfortunately, they will live to be 160." Or something like that.
--
Re:Why oh why must I die!?!?!?! (Score:1)
--GAck
Re:QC soon, yeah right! (Score:1)
--
First one Big as House--DeskTop--Hand--100/chip--"Now Optical Computers" nope.
--
The Feature Size of the Device, I/O and HouseKeeping are real Limits to any CPU.
And once you have all this extra stuff keeping it from jamming the very effect you are using is not easy.
Like CrystalMemory and others it works on paper only, Demo'ed as one shot, never seen again.
my2c
Setting Up A Quantum Computer (Score:1)
How difficult is it to do this setup?
Given that the experiments I've heard of are on the 2+2=4 level, how do we know that the difficulty of setting up a quantum computer to factor a specific 1024-bit number isn't comparable to the difficulty of doing the factoring by deterministic algorithms?
/.
Re:Simple Defence - use quantum cryptography (Score:1)
First, to Sangui5:
Sure, there won't be many of these built for a while, and sure, only governments might be able to afford them. But remember, it isn't just a few people with PGP that rely on RSA. Banks do. Government agencies do. Other governments do. I personally don't want some revolutionary nut in a third-world country stealing a quantum comp. and raiding my bank account. I'm funny that way.
To the Anonymous Coward who suggested quantum encryption:
Oh boy, there's some fun: first, you have to build your own communication medium, because phone lines and satellites are out. It has to be strong, it has to be extremely accurate, and it has to be completely isolated. Oh, and you'll need to make many different versions. And they all have to be hard-wired, as you can't do this sort of thing over radio waves. I'll explain why at the end. Second, you have to know what the error rates of the particles you're sending actually are. Counting photons is a tedious job. Third, you have to find someone else with the same setup you've got.
So you finally got your quantum encryption set up. Now what? Well, here's where it gets funny: quantum "encryption" is as effective if you are using 256-bit RSA encryption or if you are using the secret code from the ring you found in your Cracker Jack box. Why? Encryption is based on the concept that you don't want anyone to whom you don't give permission to see your data. All quantum encryption does is change the medium so that one of those pesky laws of quantum physics, Heisenberg's cute "uncertainty principle", keeps other people from looking at your stuff when it's in transmission without you knowing. You will know someone's watching because the error rates have risen. Oh, and to keep this medium working, it has to be as isolated from natural interference as possible. So, what happens when you know that someone's reading your stuff? You have to change channels, so to speak, and use a different connection, or wait until that eavesdropper gets off your communication line. Sounds annoying, doesn't it? Well, it is, as well as financially unfeasible for, say, an entire country.
So, which is worse, the problem or the solution?
Mike
Re:I don't pretend to understand (Score:1)
Assuming that you have a constant number of processors in your "parallel machine" searching through an n-element list still takes linear (IOW, O(n)) time. This is pretty obvious to see since your uniprocessor machine can emulate a k-processor box where each virtual processor runs at 1/k (minus context switching overhead) the speed of the original processor.
Also, you don't need a special computational model to search through a 4-element list in O(1). In fact, I have an ultra-secret algorithm for searching through a 5 bazillion-element list in O(1) on a Turing machine!!! (hint -- if the size of your input is constant and the function is computable, you'll always be able to compute the answer in a constant amount of time).
-NooM
/. and Science (Score:1)
In this case, I refer to the belief that 'all computing is equal', that the only difference between, say, a QC, a Compaq and my brain is in the implementation and speed. QC's are not just really fast, expensive and fragile supercomputers, they won't run Quake or Linux, and they won't replace those anyones Compaq. They do a few things really well--sorts, searches, etc--but most things very poorly, if at all. They are less general purpose machines than accessories, designed to fulfill some specific needs--coprocessors for your Cray, rather then replacements. On top of that, they cost a fortune and are unimaginably fragile compared to a desktop machine.
In some fields they will be revolutionary, but for the most part the effects will be similar to the release of the K7 on the population of Iran.
Re:But Seriously - Quantum Brains. (Score:1)
Re:An explanation of quantum computing?? (Score:1)
http://xxx.lanl.gov/archive/quant-ph [lanl.gov]
Some useful background information is in Andrew Steane's paper [lanl.gov], but you will get heaps more stuff with a quick search.
Remember this site: http://xxx.lanl.gov [lanl.gov] it's damn useful.
Quantum Physics (Score:1)
Re:Solid state quantum computing (Score:1)
The CMPNet article scares me because they are talking practicality. Not 20 years off. Real world, many-bit devices. And NEC, the one with the solid state research, is a multinational corporation. Lucent, I hear is also in the game -- nearing practical results. I can't remember my source on the Lucent stuff, so take it with a grain of salt.
ratatatat
Surely that's going over the top? (Score:1)
If we were to make games completely real, they'd lose a lot of the fun. For instance, the rocket jump would simply send bits of player flying all over the arena. A one-hour deathmatch would result in all the players getting exhausted, and a couple of them dying from heart attacks. Also, control mechanisms would have to become much more advanced, giving you control of breathing, more exact control of limbs, etc. Such a system might be good for a simulation game such as 'Hidden and Dangerous', but it would lack the immediacy of Quake.
--------------------------------------
Re:Surely that's going over the top? (Score:1)
Making more immersive games (IMO) would relieve lots of stress. After all, why blow away all of your classmates when you can pretend to and not have to go to jail after?
LK
Re:Besides quake. (Score:2)
You miss my point - QC might *not* do this any better than standard computers.
Re:wrong (Score:1)
QC's aren't Turing machines, and apparently neither are brains (I'm currently studying the latter). However, I don't believe that QC's are more powerful than Turing machines. They are certainly faster in some ways, but the range of functions they can compute is quite small, and AFAIK they cannot compute anything beyond the capabilities of a Turing machine (given enough time). This would make them more of an optimized sub-Turing machine.
As far as what *is* more powerful than a Turing machine, most of the candidates are actually variations of TM's (oracles, etc), or analog (such as recurrent neural networks) systems. I don't believe QM has much to offer here, unless it can add a new realm to the analog-digital spectrum.
And for the record, I've never taken any CompSci courses, though I sometimes wander through the field chasing a neural network.
Re:Simple Defence - use quantum cryptography (Score:1)
Re:So, what will be next? (Score:1)
information so in practice relativity still works.
This is exactly what may not be true if Bohm's theory accurately accounts for quantum phenomena..
At least, that's what I think David Z. Albert was saying in class...
It's Official...I'm OLD (Score:1)
There was a day (year/decade), when the idea of learning new things and facing new challenges thrilled me. Now I'm just glad that I have saved enough money to retire comfortably.
I'm old and I haven't even turned forty yet. I can't scoff at all those old used-up professors any more; I am one.
Seriously Real (Score:1)
I think the final straw is Heisenberg's theory, it'll be tough to get around that one. And, of course, the fact that time keeps going.
(is this what happens when geeks go meta-physical?)
Re:Simple Defence - use quantum cryptography (Score:1)
Just give it time.
Frictionless surfaces (Score:1)
Imagine having a play toy at tempuratures under 7K. Or in the case of the article 1K!
Unfortunately with the fact being that one needs temperatures that low in order to have the right conditions for quantum computing means that we probably won't see a consumer version in our life time.
The amount of really cool stuff that can be done at temperatures 1K and lower is amazing. Eistein-Bose condensates, which lead to matter beams, which lead to true 3D holograms like what we have seen in so many movies. Quantum computing. Tests with frictionless surfaces. Ahh. That is why I'm a physics major.
QC soon, yeah right! (Score:1)
Not gonna Happen Folks. QC is dead end.
Basic Problem is the cross talk issue in packing.
They have solve that one first.
my2c
Human Nature is a Superposition of Good and Bad (Score:1)
There is a big difference between exploration and conquest. Remember that technology is amoral, it is the applications/outcomes which are determined by our positive or negative tendencies, and even that is defined to some extend by social context. The psychology of "crackers" (essentially ego driven) is completely different from the pure form of hacking (curiosity driven), about the same difference between a vandal and an artist. Both might use similar techniques but the creative tendencies of an artist are channeled into positive outcomes.
Researchers are a different breed from paranoid security cryptoanalysis (at least I hope so as my taxes are being levied for them to be paranoid). Science and research operate in a climate of open and free exchange of ideas and anything which is regarded as a "difficult challenge" is of interest. Security on the other hand is dealing with control and exclusion (private property) which tends to bring out the acquisitive side of human nature (remember wanting a toy just so that your sibling can't have it?). The impulses that drive research and finding knowledge (and to some extent pure hacking) are not the same as cracking and destorying data.
I just always find it interesting when human nature morally cris-crosses itself....
Society has developed informal rules (social norms) and institutions (courts, non-profits) to minimise human nature to destroy itself. Morality is a rather complex abstraction in its own right. As one wit once noted on the dispartity of income distribution along the age axis
"If you're not a communist when you're young, you've no heart. If you're not a capitalist when you're old, you've no brain"
Good, bad, indifferent, we are all evolving bitstreams in the global memory of human conciousness. I only hope that people have enough self-awareness of their own nature and act accordingly.
LL
Re:I don't pretend to understand (Score:2)
I geus a cheezy way to describe the limitations of cuantum computing is to say that you get a lot of really powerfull parallelism, but since you only read out one answer you can not directly take advantage of it. The quantum algorithms ``make the wrong answers cancel out.'' Currently all the quantum mechanical algorithms which provide exponential speedup (like factoring) work by finding the period of some function by useing a Foruer transform.
Yeah you're right... (Score:1)
Re:Solid state quantum computing (Score:1)
ratatatat
Re:Seriously Real (Score:1)
Um, no (Score:2)
No, No, No.
NP-complete problems are hard.
All of them.
Equally hard.
That is, if you can solve one NP-complete problem, you can use it to do the others in polynomial type. A Hamiltonian oracle can solve 3-coloring, circuit-sat, traveling salesmen, and the others, fast
...
I don't really know if quantum computers can solve NP problems, or even factoring for that matter, since I don't know how to phrase algos in quantum computable terms....although, like parallel algorithms, it'll be a booming area of research, you can bet.
Re:But Seriously - Quantum Brains. (Score:1)
and the os can always be updated with greater ease. i guess the problem is that most people never need more that %10.
imagine using a chip in your brain to focus cerebral development to the field of your choice.
then again, having a powerful unit for processing hooked up to your motherboard (brain) means little if you can interact with it
at great speeds.
once again we're limited by our inferior architecture.
Re:But Seriously (Score:1)
Rendering aside, this type of computer could consider more variables in a game than anything that is currently available. Back to the FPS game.
Let's just list a few factors which would influence the outcome of a match.
Height
Physical Condition
Heart Rate
Rate of Respiration
Lung Capacity
Age and related degeration of bodily systems
Type of footwear
Striations of the barrel of a firearm
Irregularities in the surface of a bullet
Wind Resistance
Crosswind
Temperature
If clothing fibers would clog a hollow point to such a degree that it won't expand
Finger Length
How a weapon performs as it heats up and the moving parts wear
Even if rendering routines for quantum computers are never written, it is the underlying computations that make the sim important, calculating voluminous numbers of possibilities is where the strength of quantum computing lies.
For example, quantum computers could determine exactly what is a perfect game of chess.
Rendering is the easy part, that can be handled by hardware that is only a few years away on our current path.
LK
wrong indeed (Score:1)
Actually, the consensus among complexity theorists is that quantum turing machines are more powerful, even theoretically, than regular probabilistic turing machines. This has not been proven, for similar reasons that ~(P=NP) has not been proven either (namely, that it is freakin HARD problem to do so).
For more on this, look at this paper by Umesh Vazirani (one of the big names in computational complexity): Quantum Complexity Theory [berkeley.edu].
Re:Um, no (Score:1)
Re:Strange... (Score:2)
'Twas meant to be a joke -- the "OW!" was meant to be my response to someone smacking me upside the head for saying this...
Open Qubit (Score:3)
Solid state quantum computing (Score:1)
And wait until some hacker cracks into Lucent's Quantum Computing Array, and breaks into your bank account.
But Seriously (Score:1)
This presents excellent possibilities. Imagine a distributed.net client, or a game executed on such a machine.
The realism or flight sims and FPS games would be mind boggling. A machine like this would be able to calculate whether a bullet would glance off of a rib and break it or if it would punch straight through. How much blood would be lost, and friction could be calculated to determine how much one would slip on the blood.
This is very cool.
LK
And we're just getting started... (Score:1)
Quantum computing is at much the same stage right now. Some brainy-folk have shown that the math works, and it should be possible to build these things, but now we need to invent ways of making it practical.
The only thing that worries me is that I'm going to need to learn how this stuff works some day if I want to keep a job in the industry!
Now, is this a good thing? (Score:2)
Yeah, it would be great for all sorts of things (just imagine the speed boost for things like ray-tracing, searching, and sorting) but it would also make a brute force attack on any encryption algorithm a simple matter, rather than a computational nightmare.
Now, it would be fair if everybody had their nondeterministic turing machines to chug out quantum encryption, but how much is this going to cost. I'm thinking that quantum computing, and all of it's benefits, will be the realm of governments and large corperations, at the expense of everybody else.
Re:But Seriously (Score:1)
Makes me wanna go into computer engineering (Score:1)
This sounds pretty rad. I used to read all kinds of stuff about quantum physics, and Niels Bohr is one of my heros, I'm glad stuff like this is finding some real practical applications.
Re:Solid state quantum computing (Score:1)
quantum computers to come up with mega-bit
encryption keys? The whole point of RSA is that
it's much easier to encrypt than decrypt- when
processing power means you can decrpypt something, it also means you can encrypt it another order
of magnitude up..
(Not very technical, I know, but the point is that
there could be new forms of encryption also
based on quantum computers)
Re:And we're just getting started... (Score:1)
>>to need to learn how this stuff works some day
>>if I want to keep a job in the industry!
Yeah, but remember back 10-20 years ago when
people thought the same thing about PC's.
Now they're (basically) easy enough for
everyone to use! I'd love to learn about them,
but just to know. I'm not a prgrammer, I just
think the possibilites are way cool!
-------------------------------------
Re:Open Qubit (Score:2)
Anyway, more interesting is the prospect of encryption with qubits using "intertwining" of particles to ensure that nobody can listen in on your conversation.. without you knowing about it. Think about it. If somebody "cracks" your encryption scheme, you know *right now*. That would basically eliminate alot of signals intelligence that the NSA engages in today. They won't be getting much funding from uncle sam, I can assure you of that!
--
An explanation of quantum computing?? (Score:1)
Can anyone try and explain this a little more clearly? I took a half a semester or so of quantum mechanics in college, so I'm familiar with superpositioning of quantum states, Schroedinger, and such, but I'm still confused as to how that can be used to allow for operations to be performed on combinatorial sets of data... I'm looking for an answer more from a computer science standpoint rather than a physics one, if it's possible...
Dave
Re:typical Microsoft propaganda (Score:2)
With quantum computing does that mean we could only view the contents of a Micros~1 Word document or modify them but not both?
Re:So, what will be next? (Score:1)
than the speed of light. Quantum entanglement
effects (such as a pair of photons having
instantaneous effects on each other irregardless
of distance) can seem to violate the speed of
light, but they're worthless for transmitting
information so in practice relativity still works.
Quantum entanglement can be used to provide
quantum cryptography over networks - unbreakable
codes, even with a quantum computer.
Re:That's nice but... (Score:1)
Still, you were probably thinking of something specific when you said the above. What was it?
gomi
incomplete statements cause such trouble
Re:Now, is this a good thing? (Score:1)
- That geek guy from the Simpsons in the episode where Abu gets his US citizenship.
Re:Seriously Real (Score:1)
Predicting large objects, by large I mean things large enough that classical mechanical physics can be used without too much degredation in accurace, will be easily computed. When you get down to the quantum level of physics, by the time the quantum computer knows the answer it will have already have happened because one is still just dealing with probabilities at that level.
As for time only going forward. Read Feinmann (I know I misspelled his name). He had devolped this really interesting and far reaching theory about the idea of anti-matter actually being matter going backwards in time. Mathematically all the speed of light is is a vertical asymptote. It slopes up then comes right back down.
Re:Simple Defence - use quantum cryptography (Score:1)
There is a difference, electronic parts can be easily manufactured. Apparati that can get temperatures of 1K and lower won't be for a very very long time. Also, there are enough problems with people hurting themselves on computer today. Imagine what would happen when one of these breaks open and freezes some poor bastard into an icicle. His wife comes home, screams, and sues. Tempuratures of 1K are NOT SAFE!
Re:Makes me glad I'm engineering physics (Score:1)
As for practical applications, look at Eistein-Bose condensates and matter lasers.
Re:/. and Science (Score:1)
Re:Simple Defence - use quantum cryptography (Score:1)
Oh boy, there's some fun: first, you have to build your own communication medium, because phone lines and satellites are out. It has to be strong, it has to be extremely accurate, and it has to be completely isolated. Oh, and you'll need to make many different versions. And they all have to be hard-wired, as you can't do this sort of thing over radio waves.
Packet-switched networks are out too (I think?).
:(
Re:Solid state quantum computing (Score:1)
What little that I understand about the quantum microverse and quantum computing, leads me to think that anything quantum can *do*, it can *undo*. Although you may be able to encrypt huge keys, quantum allows you to try ALL the combinations on the lock at once, no matter how large.
I don't know much about quantum computing either, but from what I've read in the context of cryptography, quantum computers are able to solve many (most? all?) problems using the square root of the number of operations needed by conventional computers.
This would make a 128-bit key solvable in 2^64 operations. You would need a 256-bit key to have the same security as a 128-bit key seems to offer today.
Quantum computers will not be able to test every possibility simultaneously. I don't recall details, but I think it had something to do with getting only a certain amount of information about the answer out of each measurement.
Re:But Seriously (Score:1)
One shot clips the side of your knee, and you collapse in a screaming heap, and remain there bleeding to death for the rest of the game, unless someone puts you out of your misery...
Fun.
Re:typical Microsoft propaganda (Score:1)
With quantum computing does that mean we could only view the contents of a Micros~1 Word document or modify them but not both?
No. It means that you can not view it without changing it. ;)
Re:Solid state quantum computing (Score:1)
Spyky
Re:Simple Defence - use quantum cryptography (Score:1)
Would this actually help Quake? (Score:2)
I'm not sure about that. The current applications that are being proposed for QC are of a fundamentally different nature. QC speeds up things like searches, but I can't see a way for it to easily speed up things like rendering or kinetics simulations. At the very least, a very different approach to those problems would have to be thought of.
Does anyone else have more information on what kinds of problems quantum computing will and will _not_ be good at?
I don't pretend to understand (Score:4)
Quantum computers do not really translate to higher FPS in Quake3 or more realistic flightsims. You don't get quantum computers that have amazing SPECfp numbers.
Quantum computers do operations that normally take one order of magnitude in a much lower order time. Example: searching a list of items for a value on von Neumann machine is O(n) (length of the list), since you have to look at each element till you find the one you want. You can do this in O(1) on a parallel machine. This is a significant improvement. IIRC there was a quantum computer that could search a 4-element list in O(1).
Obviously, that's a pretty trivial problem. Even for very long lists, O(n) isn't bad, and you can do it in parallel.
What about fundamentally much more complex problems, such as factoring, or better, something NP-complete such as circuit-sat or Hamilton paths (that's what the article was talking about, I think. Those guys think their quantum computer is a Hamilton oracle, if I'm right. So you have to pose questions in the form of graphs...not a serious problem since all NP is orthogonal). A parallel machine doesn't help there. But a quantum computer can take NP problems from exponential to polynomial time.
All of a sudden factoring (not NP, just decently hard) goes from taking 100 trillion years to taking hours.
Yes, all encryption that uses factoring as a trapdoor (one-way function) would be toast.
No, it wouldn't necessarily be any better at running first person shooters.
Still, an NP oracle machine IMHO would be much more significant than some bloody nanotech robots.
Hey, you kids! (Score:1)
So, when does Sun put Java on this thing? When does Microsoft announce "Visual Q"? And, of course, you'll need a larger quantum computer to run that one, and it won't be compatible with other quantum programming languages. But an animated quark will pop up from time to time and advise you on your programming style.
I read an article in Sci-Am about this quantum superposition stuff. And I still don't understand how I would go about using it for computation. I feel like such a caveman.
Re:Open Qubit (Score:1)
One method of quantum encryption (the one I've studied) is not really encryption at all. Alice sends Bob messages in plaintext, as individual quantum states. Now, if Eve wants to intercept that signal, she must measure the quantum states as they go by; that measurement will necessarily corrupt the signal, and Bob gets a meCsaTe with a f3w bits scraBbled. That's a signal that Eve has been mucking around again -- but better yet, if the message is NOT scrambled, Bob knows that NOBODY could have been snooping; and if the message is scrambled, Bob knows by how much is scrambled how precisely Eve has snooped.
Several drawbacks to this method: you have to be able to measure individual quantum states (which means expensive equipment); you have to have a network that doesn't lose much of the information in the fragile quantum states (or at least loses a definite, known amount of information). That means you probably can only use it over a local network, at least with current (read: "at least 10 years ahead") technology. (You also have to know the expected information content in the message to determine that something's been screwed up, but that's usually easy.)
Another method involves using EPR pairs to "teleport" a message by measuring one of the pair (which causes the other to collapse based on the choice of measurement) -- you need to send a classical message with the signal (so speed-of-light won't be violated with this method), but the classical message is meaningless without the EPR state, and vice-versa. Again, good luck carrying around your very own EPR pairs; hope you have a huge budget!
--
Strange... (Score:2)
Re:An explanation of quantum computing?? (Score:2)
In a combinatorial set of data, operations are order independent. Because of this, you can configure the quantum hardware in such a way that all of the appropriate electron jumps can happen in one clock cycle, since thousands of electron jumps can happen in less time than we can clock (we're talking femtoseconds here).
Only when operations are order dependent (1 + 2 * 3) must we be sure one thing has completed before we begin another, and this is the reason we use clock cycles. For (1 * 2 * 3 / 4) order doesn't matter.
Each operation takes a certain amount of time to complete (due to propagation delays, gate time, etc). You can't hit the next clock cycle until results have stabalized. Right now we are working to make conventional gates faster so that we can drive clocks at a higer rate. Imagine a single gate system that could do thousands of order independent operations at the "same time" (one clock cycle). So this "single operation" is really many many multiplications and divisions, but it can happen in one clock cycle.
Make sense?
It doesn't to me
-Alison
Re:But Seriously - Quantum Brains. (Score:1)
EVERYTHING would change, new challenges and new goals would replace the old ones.
Forget game realism, the focus would shift to mathematical computing for fun.
"Perfection is achieved only at the point of collapse."
Math Class (Score:1)
Say a "supercomputer" (from the article) is equivalent to a 10,000 MHz machine. This would make our neat new "chip" the equivalent of a 8.76e15 MHz processor. Wow.
Going to distributed.net and looking up the current stats for the RC5-64 project (http://tally.distributed.net/rc5-64/), I saw that it had done 27,504,975 blocks yesterday with 41,655 machines contributing. Let's say, on average, 30,000 machines contributed for the full 24 hours (some people may turn theirs off, etc.). Let's also say that the average computer is the equivalent to a 300 MHz machine, which gives us a combined 9,000,000 Mhz per day.
At 27,504,975 blocks per day, it would take approximately 2,499 days to go though all of the blocks. However, if we substituted our 8.76 quadrillion MHz processor in, we could do 2.677e16 blocks per day. Not too shabby. At that rate, we could have done all of the RC5-64 blocks in 2.57e-6 days, which is 0.22 seconds.
To degree or not degree... (Score:1)
I had some physics courses too at university, but I don't remember what they called it there.
Stepping to Solid State Quantum Computing (Score:1)
Using embeded Quantum Computers to control your nanomachines is it!!!!
Re:But Seriously (Score:1)
Unfortunately I don't believe that these computers will be any better to these types of problems than regular computers. Although quantum computers are several orders of magnitude faster than regular computers for factoring and similar problems, I haven't seen any algorithms that let them say render a scene.
In some sense quantum computing attacks a fundamentally different problem then regular computers and using quantum computers to solve problems that regular computers do well may be just as inefficient as using regular computers to factor large numbers.
Re:Seriously Real (Score:1)
He had devolped this really interesting and far reaching theory about the idea of anti-matter actually being matter going backwards in time. Mathematically all the speed of light is is a vertical asymptote. It slopes up then comes right back down.
I did some quick searches, but couldn't find it.
I love this stuff and have written a few papers on it, relating quantum physics to the meaning of life and all that. It'll be up soon, stay tuned....
Re:QC soon, yeah right! (Score:1)
Could you elaborate a bit?
thanks,
Re:An explanation of quantum computing?? (Score:1)
Don't understate the power of the quantum logic gate. The quantum computer isn't merely moving around the processors so all of the jumps happen in the same cycle. A quantum computer uses a fundamentally different logic gate. In essence, the 1 and the 0 are both registered at the same time because what's being registered is not the particle, but the probability of where the particle might go. The probabilities are what are manipulated by the hardware, and where the electrons actually go determines the answer. This is as simple as it gets. However, I know that this probably doesn't make much sense to a lot of people. (It only makes some sense to me because I had to write a report on quant. computation&cryptography and neg. probability.) My advice to anyone who is not extremely well-versed in both computer science and quantum mechanics (there are like a dozen of them on the planet) is to find a book on the subject. I'd recommend G.L. Milburn's "The Feynman Processor" (he's one of those dozen).
That's just my two cents though.
Mike
Re:Strange... (Score:1)
How about every time a new kind of computer is mentioned on Slashdot, we take it as a given that a Beowulf cluster of them would be cool? Then moderators can mark posts like this as "Redundant" and everyone saves a little bandwidth.
--
The beginning of the end? (Score:1)
Certainly, with this technology, we are nearing the threshold of "smaller, better, faster", no?
Hermm...
-Cereb
icaveo (Score:1)
So, what will be next? (Score:1)
I'm no expert on QM, and I believe that this particular aspect of the subject is controversial, but as I understand it, a plausible interpretation of Bohm's theory allows for the possibility of transmitting a readable signal to any point in the universe, instantly. That would sure beat the hell out of Gbit ethernet, and even that terabit line Siemens is working with... basically, anything that operated with light or electricity would be toast..
Open fire if you think this is way off base... given how much I know, you're probably right.
Anyway, just a random thought..
Re:But Seriously (Score:1)
But then again having my own holideck *sp?* aka Star Trek would be nice
Re:Open Qubit, more info (Score:2)